Remove Duplicate Letters — Monotonic Stack + Greedy Solution
Solve LeetCode 316 Remove Duplicate Letters using monotonic stack with frequency and visited tracking. Smallest lexicographic subsequence in Python.
·5 min read · #dsa#stacks#greedy
#greedy
9 posts · page 1 of 1
Greedy Algorithm Patterns: From Activity Selection to Huffman
Master greedy algorithm patterns including activity selection, fractional knapsack, Huffman coding, job scheduling, and gas station. With proofs and Python code.
·12 min read · #dsa#greedy#intermediate
Greedy vs DP: When to Use Which Approach
Learn when greedy algorithms work and when you need dynamic programming. Covers greedy choice property, optimal substructure, exchange arguments, and side-by-side comparisons.
·11 min read · #dsa#greedy#intermediate
Interval Problems: Merge, Insert, Schedule, and Sweep
Master interval problems — merge intervals, insert interval, meeting rooms, interval scheduling, sweep line technique, and non-overlapping intervals with Python implementations.
·12 min read · #dsa#greedy#intermediate
Greedy Algorithm Patterns: Interval Scheduling, Activity Selection, and More
Master greedy algorithm patterns for LeetCode including interval scheduling, activity selection, jump games, and proving greedy correctness.
·7 min read · #leetcode#greedy#intervals
Best Time to Buy and Sell Stock II — Greedy Sum of Positive Deltas
Solve the multi-transaction stock problem with the greedy peak-valley insight: sum every positive daily delta. Includes complexity analysis and DP alternative.
·4 min read · #leetcode#arrays#greedy
Jump Game — Greedy Max-Reach Beats DP
Solve Jump Game with a single-pass greedy max-reach approach. Compare it against the dynamic programming solution and learn when greedy is provably optimal.
·4 min read · #dsa#leetcode#greedy
Merge Intervals — Sort and Sweep
Walk through Merge Intervals step by step. Brute force vs the optimal sort-and-sweep approach, edge cases, and clean code you can ship in an interview.
·5 min read · #dsa#leetcode#intervals
Greedy Algorithms: When Locally Best Wins Globally
An introduction to greedy algorithms — when the locally best choice gives a globally optimal answer, when it doesn't, the exchange argument, and six classic problems.
·8 min read · #dsa#greedy#intermediate