dsa2 min read
Longest Increasing Subsequence — O(n log n) Patience Sorting
Find the length of the longest strictly increasing subsequence. O(n²) DP or O(n log n) patience sorting with binary search.
Read →
All Posts
1575 articles
dsa1 min read
Russian Doll Envelopes — 2D LIS
Maximum envelopes you can nest. Sort by width ascending and height descending, then LIS on heights. Descending heights prevents using same-width twice.
Read →
dsa1 min read
Palindromic Substrings — Expand Around Center
Count palindromic substrings. Expand around each center (n odd-length + n-1 even-length centers), count valid expansions.
Read →
dsa1 min read
Longest Palindromic Subsequence — 2D DP
Find longest palindromic subsequence length. 2D DP: if s[i]==s[j], dp[i][j] = dp[i+1][j-1]+2, else max of neighbors. Fill diagonally.
Read →
dsa2 min read
Partition Equal Subset Sum — 0/1 Knapsack
Can array be partitioned into two equal-sum subsets? 0/1 knapsack: can we pick some numbers summing to total/2? Bitset or DP boolean array.
Read →
Page 97 of 315