Concepts4
📚TheoryIntermediate
Approximation Algorithm Theory
Approximation algorithms deliver provably near-optimal solutions for NP-hard optimization problems within guaranteed factors.
#approximation algorithms#ptas#fptas+12
⚙️AlgorithmIntermediate
Meet in the Middle
Meet-in-the-middle splits a hard exponential search into two halves, enumerates each half, and then combines results efficiently.
#meet in the middle#subset sum#pair sums+12
⚙️AlgorithmIntermediate
Dynamic Programming Fundamentals
Dynamic programming (DP) solves complex problems by breaking them into overlapping subproblems and using their optimal substructure.
#dynamic programming#memoization#tabulation+12
⚙️AlgorithmIntermediate
DP State Design
Dynamic Programming (DP) state design is the art of choosing what information to remember so that optimal substructure can be reused efficiently.
#dynamic programming#dp state#bitmask dp+11