Doubt regarding Longest Increasing Subsequence problem

#1

Can you provide me the memoization code of this problem i.e, using Top Down DP approach .

#2

Hey @Lalit2142
if (arr[i] >= prev) {
ans = 1 + lisr(arr, arr[i], i + 1); // Consider
}
int noCon = lisr(arr, prev, i + 1); // not Consider