The time complexity of the basic solution should be exponential ie O(2^n)
|
|
6
|
553
|
June 2, 2021
|
Recursive Approach Not Working
|
|
0
|
145
|
May 19, 2021
|
Why initialize dp[0] and dp[1] = 1
|
|
0
|
168
|
May 15, 2021
|
Path reconstructions for SCS
|
|
0
|
156
|
May 13, 2021
|
Path reconstructions for LIS
|
|
0
|
147
|
May 13, 2021
|
Path reconstructions for subsequence
|
|
0
|
311
|
May 13, 2021
|
https://www.educative.io/courses/c-sharp-concurrency-for-senior-engineering-interviews/gx6P4xjL4wG
|
|
0
|
139
|
May 3, 2021
|
Explain the "two" in Bottom-up | Longest Alternating subsequence
|
|
0
|
146
|
April 20, 2021
|
Wrong time and space complexities in Equal Subset problem
|
|
0
|
165
|
April 9, 2021
|
Simple queues, no lookback, 9.5 minutes
|
|
1
|
285
|
April 6, 2021
|
As it said, the problem is similar to LCS, can we solve it in this way?
|
|
1
|
373
|
March 30, 2021
|
JavaScript Solution
|
|
0
|
118
|
March 29, 2021
|
Apply bottom up from Longest Palindromic SubSequence formula
|
|
0
|
181
|
March 27, 2021
|
Extra on Subset Sum
|
|
0
|
162
|
March 14, 2021
|
What has this problem anything to do with "FACT"?
|
|
0
|
165
|
March 4, 2021
|
How would you find the contents of each subset using the matrix created in the bottom-up approach?
|
|
0
|
204
|
February 25, 2021
|
Longest common subsequence vs substring
|
|
4
|
4849
|
February 18, 2021
|
Brute force solution complexity
|
|
6
|
423
|
February 13, 2021
|
3rd example doesn't confirm to the problem statement
|
|
3
|
430
|
February 9, 2021
|
How is this different from the coin change problem?
|
|
1
|
334
|
January 25, 2021
|
How brute-force solution has complexity O(2 ^(N+C) )
|
|
3
|
683
|
January 18, 2021
|
Question on fixing extra string error
|
|
0
|
253
|
January 7, 2021
|
Blockchain deploy network
|
|
0
|
185
|
December 31, 2020
|
The Bottom Up Solutions Gives Memory Limit Exceeded on Leetcode
|
|
0
|
394
|
December 21, 2020
|
Topdown Solution Missing Space + Time Complexity?
|
|
0
|
199
|
December 12, 2020
|
Shouldn't the space complexity be O( max(C,T)) instead of O( C+T) for recursive approach?
|
|
0
|
153
|
December 10, 2020
|
The BottomUp Solution seems failing at some test cases
|
|
5
|
282
|
November 27, 2020
|
O(n log n) solution
|
|
1
|
401
|
November 18, 2020
|
Understanding the improved version of the process
|
|
1
|
315
|
November 16, 2020
|
Why do we need a 2d array for the top down solution
|
|
1
|
281
|
October 21, 2020
|