can anybody explain time complexity ?
terminator123456
@terminator123456
Posts made by terminator123456

RE: Concise recursive C++ solution

complexity of combination / permutation problems
whats the complexity of combination sum problem ?
https://leetcode.com/problems/combinationsum/description/
and for generating all permutations i think complexity is N!, please correct me if i am wrong

RE: time complexity of backtracking algorithms
isnt it N! as compared to exponential ?

RE: [Java/C++]Straightforward dfs solution
whats the complexity

RE: Very concise O(log(min(M,N))) iterative solution with detailed explanation
@stellari i am trying to find complexity of this solution . It seems like O(log(m+n)). I was not able to understand your statement "The time complexity is O((N+M)log(N+M)) because of num.sort(), much worse than the optimal solution. Get item by index in python list is a O(1) operation". I dont see num.sort anywhere, given array are already sorted right ?

RE: My clean Java solution, very easy to understand
whats the complexity of this func ?

time complexity of backtracking algorithms
whats the time complexity of common backtracking problems say queens problem or simple string match
http://www.geeksforgeeks.org/backtrackingset3nqueenproblem/

RE: Share my Java backtracking solution
whats the time complexity of this code ?

Linkedin phone screen
I have linkedin phone interview, can anybody tell me the level of questions asked in phone screen ?

Big O complexity of common functions
I wanted to summarize what is the big o notation complexity of the most common algorithms. I am listing some algorithms and what i think about complexity, please correct me if needed
permutations of array> O(N!)
combinations of array>O(N!)
all possible subsets>O(2^n)
combination of phonenumber >o(3^n)