What is the time complexity of this custom function? Question: Is it correct to say that the time complexity of the following code snippet is O(n^2)? My main doubt is whether I can consider triplets.append(sorted([array[i], array[j], twoSum – array[j]])) as constant time since it does not depend on N and is always sorting an array …
How to write a python3 function that merges two lists of sets so that the output list has sets of elements that were present in both input sets? Question: I have two lists of sets, let’s say: [{1, 2, 3}, {4, 5}, {6, 7}] and [{1, 2}, {3, 4}, {5, 6, 7}] No set in …
Understanding time/space complexity for Leetcode 1366 Question: I’ve solved leetcode 1366 but having some trouble approximating the proper time/space complexity. I’ve looked at the solutions tab but answers vary and I’m not sure if I buy some of them. Here is my code and the general algorithm – class Solution: def rankTeams(self, votes: List[str]) -> …
How can I reduce time complexity on this algorithm? Question: I have this exercise and the goal is to solve it with complexity less than O(n^2). You have an array with length N filled with event probabilities. Create another array in which for each element i calculate the probability of all event to happen until …
Time complexity and number of calls Question: I have trouble finding the time complexity of my program and the exact formula to compute the number of calls (represented by the length of the list). Here is my python program that I wrote: from math import * def calc(n): i = n li = [] while …
CPython list.insert(index) real time complexity, when all inserts occur at same index? Question: My noob question is in the title I have some code that iteratively builds a list. All inserts are always at the second-to-last position. Is list.insert(-1, value) truly an O(1) operation in the CPython implementation? O(?) -> what I want to do …
Time complexity question: why is it O(n log n)? Question: Can someone explain why this is O(n log n) and not O(n^2)? I had the idea that the if statement is n times and the else is log n so you pick the worst case between the two in this case is O(n) so multiply …
Triple nested while loop – Big Oh Notation – Count of Primitive Operations Question: I’m having some trouble figuring out the primitive count of operations for the following lines of code def question1(n): n = n # 1 ops i = 0 # 1 ops a = 0 # 1 ops while i < n: …
Generate Permutation With Minimum Guaranteed Distance from Elements in Source Question: Given a sequence a with n unique elements, I want to create a sequence b which is a randomly selected permutation of a such that there is at least a specified minimum distance d between duplicate elements of the sequence which is b appended …
Distances between same numbers in list using single for loop Question: I have an assignment to get distances of every occurrence of same number in string and its time complexity should be O(n) so it shouldn’t use nested for loops. For example if my string contains "100101" and I need to get distances between ones …
