InterviewBit Problems   Repeating Sub-Sequence : Solved

About the Repeating Sub-Sequence : Solved category (1)
Just like the LCS but excluding the case i== j and length of LCS should be >=2 (1)
O(n) solution using Hashmaps C++ (1)
Simple python-3 solution using dp (1)
Simple solution without using dp or lps array in O(n) (1)
C++ O(128*128) operations solution (1)
C++ O(n) space and O(1) space solution, Two pointers, greedy (1)
Easy recursive + memoized code C++ (1)
Recursion + Memoization : C++ solution (1)
Java Solution using DP and LCS: fully commented and explained code in O(N) time (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)