πŸŽ“How I Study AIHISA
πŸ“–Read
πŸ“„PapersπŸ“°Blogs🎬Courses
πŸ’‘Learn
πŸ›€οΈPathsπŸ“šTopicsπŸ’‘Concepts🎴Shorts
🎯Practice
🧩Problems🎯Prompts🧠Review
Search

Concepts4

Category

πŸ”·Allβˆ‘Mathβš™οΈAlgoπŸ—‚οΈDSπŸ“šTheory

Level

AllBeginnerIntermediateAdvanced
Filtering by:
#interval scheduling
βš™οΈAlgorithmIntermediate

Proof Techniques for Greedy Algorithms

Greedy algorithm correctness is usually proved with patterns like exchange argument, stays-ahead, structural arguments, cut-and-paste, and contradiction.

#greedy algorithms#exchange argument#stays ahead+12
βš™οΈAlgorithmAdvanced

Aliens Trick (WQS Binary Search)

Aliens Trick (WQS Binary Search) converts a hard β€œexactly k items” optimization into an unconstrained problem by adding a penalty Ξ» per chosen item.

#aliens trick#wqs binary search#parametric search+11
βš™οΈAlgorithmIntermediate

Greedy - Exchange Argument

The exchange argument proves a greedy algorithm is optimal by swapping out-of-order choices in any supposed optimal solution until it matches the greedy one without making it worse.

#greedy#exchange argument#pairwise swap+12
βš™οΈAlgorithmIntermediate

Greedy Algorithms

Greedy algorithms build a solution step by step by always taking the best local choice available.

#greedy algorithms#activity selection#interval scheduling+12