🧮 Sets & Combinatorics
One-line summary: Generate and reason over subsets, permutations, combinations, and classic set-based DP problems.
Algorithms in this section
Runnable implementations (with tests) live alongside this guide in this folder:
- Cartesian Product
- Fisher–Yates Shuffle
- Power Set
- Permutations
- Combinations
- Combination Sum
- Longest Common Subsequence (LCS)
- Longest Increasing Subsequence
- Shortest Common Supersequence (SCS)
- Knapsack Problem (0/1 and Unbound)
- Maximum Subarray
Related Topics
- Backtracking — generating subsets/permutations
- Dynamic Programming — LCS, LIS, knapsack
← Back to Home · © sparshjaswal