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 ?
shilpa6
@shilpa6
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 ?

RE: My simple java Solution use recursion
@daiqiang1117
The complexity for priority queue and this method is same i.e. nlogk. Because in priority queue you will make some n additions ( assuming n nodes ) for a list length of k. 
[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 ?

RE: Java AC solution using BFS
"["za","zb","ca","cb"]" How is this test case handled. It should give out an empty string as the order can not be decided from the words given. but instead it returns "azbc".
Can someone please explain this.
Thanks!