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
Amjams
+5
Bhamrick
+5
Jonner
+5
Trilok Puri
+5
Stargirl
+5
ZXX
+5
JayZ4Lyf
+5
SophieV
+5
Codyc4321
+5
Dangph
+5
Peter.petrov
+5
Sarath
+5
Aviv Shener
+5
I159
+5
Bazza
+5
Lizzie
+5
Jeff Puckett
+5
Hakaishin
+5
416E64726577
+5