Hi @zfuuuuu , Thanks a lot for the explanation! I think it will still add another n^2 to the merge of 2 pairs where we need put traverse through the left and right results of every pair. Like for a pair(1,5) we will have to combine results from pair(1,3) and pair(4,5). This can add an additional n^2 ?
S
shilpa6
@shilpa6
5
Reputation
12
Posts
232
Profile views
0
Followers
0
Following
Posts made by shilpa6

RE: Divide conquer idea with memorization, 3ms, beats 83.24%

RE: 20ms C++ topdown DP solution
The time complexity without memoization is 2^n , so the time complexity of such an approach should be lesser than this. Can some one point out what is the time complexity of this ?

RE: Divide conquer idea with memorization, 3ms, beats 83.24%
what will be the time complexity of such a solution ?

[Not an interview question] How does leetcode assign a difficulty level to the questions ?
Is the difficulty assigned manually? Or is there some algorithm that computes the difficulty of the questions ?