dsa1 min read
Candy [Hard/Medium] — Two-Pass Greedy
Distribute minimum candies so each child with higher rating than neighbors gets more, using left-to-right then right-to-left passes.
Read →
All Posts
1276 articles
dsa1 min read
Minimum Moves to Equal Array Elements II [Medium] — Median Target
Find the minimum total moves to make all array elements equal by targeting the median value.
Read →
dsa1 min read
Array Nesting [Medium] — Cycle Length Tracking
Find the longest nested set S(k) in a permutation array by tracing cycles with visited marking in O(n) time.
Read →
dsa2 min read
Advantage Shuffle [Medium] — Greedy Strongest Beat Weakest
Rearrange nums to maximize advantage over B using a greedy strategy: assign the smallest winning card, else discard the smallest.
Read →
dsa1 min read
Subsets II [Medium] — Backtracking with Duplicate Skip
Generate all unique subsets from an array with duplicates by sorting and skipping repeated elements at each recursion level.
Read →
Page 15 of 256