PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 66: Advanced Combinatorial and Search Algorithms
← All DSA chapters

Part XI · Chapter 66

Advanced Combinatorial and Search Algorithms
  1. 66.01Meet-in-the-middle
    1. Split solution space
    2. Subset sum
    3. Closest subsequence sum
    4. Half-enumeration matching
  2. 66.02Branch and bound
  3. 66.03Exact cover
  4. 66.04Binary decision diagrams
  5. 66.05Game theory algorithms
  6. 66.06Minimax and adversarial search
  7. 66.07SAT and constraint solving
← All DSA chapters

Part XI · Chapter 66

Advanced Combinatorial and Search Algorithms
  1. 66.01Meet-in-the-middle
    1. Split solution space
    2. Subset sum
    3. Closest subsequence sum
    4. Half-enumeration matching
  2. 66.02Branch and bound
  3. 66.03Exact cover
  4. 66.04Binary decision diagrams
  5. 66.05Game theory algorithms
  6. 66.06Minimax and adversarial search
  7. 66.07SAT and constraint solving
Home/DSA/Advanced Combinatorial and Search Algorithms/Meet-in-the-middle
66.01Advanced / Expert4 topics

Meet-in-the-middle

Part of Chapter 66: Advanced Combinatorial and Search Algorithms.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

66.01.1

Split solution space

Explanation coming soon.

66.01.2

Subset sum

Explanation coming soon.

66.01.3

Closest subsequence sum

Explanation coming soon.

66.01.4

Half-enumeration matching

Explanation coming soon.

← Previous · 65.07

Hash-based string and set DS

Next · 66.02 →

Branch and bound

On this page

  • Split solution space
  • Subset sum
  • Closest subsequence sum
  • Half-enumeration matching