1 Like
What is the good-way to memorize these? Read this multiple times or should that be remembered by practice ? Or any other good way?
1 Like
You should work through the problems and it’ll come naturally to you.
3 Likes
Spaced Repetition.
1 Like
Kadane’s algorithm - Isn’t this supposed to be listed as DP instead of greedy?
I asked the AI about the Subsequence suggestions and it said:
It looks like there might be some confusion in the context provided because the Longest Increasing Subsequence (LIS) problem is typically solved using Dynamic Programming (DP) or a more optimal method utilizing a tree data structure (specifically, a Balanced Binary Search Tree) or with a technique involving binary search, but not directly with Depth First Search (DFS) or a Sliding Window.