What do you want to save?
Add Code snippet
New code examples
-
TypeScript 2021-11-20 05:38:11
longest increasing subsequence when elements hae duplicates
#include <iostream> #include <algorithm> using namespace std; // define maximum possible length of X and Y #define N 20 // lookup[i][j] stores the length of LCS of subarray X[0..i-1], Y[0..j-1] int lookup[N][N]; // Functio... Add solution
Best helpers
Ranking is empty