InterviewBit Problems
Distinct Subsequences : Solved
About the Distinct Subsequences : Solved category
(1)
Lcs easy variation
(1)
Using LCS with base case changes
(1)
Dp recursive (top down approach)self explained code
(1)
Solution using Longest common subsequence
(1)
Recursive x DP Solution
(1)
Using Memoization in c++, understandable
(1)
Easy memoization approach
(1)
O(N) space | O(M*N) time
(1)
Java Bottom up Solution
(1)
With Explanation DP C++
(1)
Bottom Up Recursive C++
(2)
Top Down Approach (simple)
(2)
Top Down DP simple using nCr=n-1Cr-1 + n-1Cr
(2)
Does top-down implementation work for anyone?
(6)
Modification of knapsack problem, subset sum problem O(m*n)
(1)
LCS type dp O(n*m)
(1)
DP solution Python 0(len(A)*len(B))
(1)
Easy top down (Recursive with memoization) dp solution
(1)
Simple dp solution in cpp
(1)
Iterative Solution
(2)
C++ O(N^2) iterative DP solution
(1)
C++, bottom up approach
(1)
Very short dp solution with o(n) space
(1)
Bottom Up C++ with comments
(1)
Bottom up approach
(1)
Dynamic programming approach: Top Down, Bottom Up, space optimized version (using one and two arary)
(1)
Top Down Dp solution
(1)
next page →