InterviewBit Problems   Repeating Sub-Sequence : Solved


About the Repeating Sub-Sequence : Solved category (1)
O(N) time and O(1) Space solution c++ greedy approach (1)
Smallest python solution without dp (1)
Top down approach solution MODIFY LCS (1)
Top Down Approach(JAVA) (1)
Greedy solution (1)
O(N) space O(N2) Time (1)
Just for better understanding of memoization you can see this solution (C++) (1)
Python Solution O(n^2) time and space, using LCS solution (1)
Easy deque C++ O(n) (1)
Why there is a need for DP? Simple O(N) solution (3)
Simple variation of LCS (1)
C++ solution without DP O(n) time complexity and O(n) space (1)
O(n^2) DP solution, variant of LCS (1)
C++ O(n^2) time /O(n) space solution without DP - Only check for subsequence len=2 (1)
Simple C++ solution without DP (3)
O(n) solution with easy understanding with o(1) space (2)
[PYTHON] Solution without using DP O(max(k^2,n)) (1)
O(n) easy solution (1)
Even O(n^3) brute force passed, please fix this (1)
Simple dp solution using lcs (1)
Simple Solution in C++, non-DP (1)
Simple O(N^2) time and O(N) space solution (1)
Please, add test-case (1)
O(n^2) NON DP SOLUTION (2)
Non-DP O(n*256) (1)
Alternate Solution (2)
O(n) non Dp solution (2)
Non-DP solution, running time O(n) and memory O(n) (1)
Simple using map in o(n) and o(n) extra space (1)