Concepts3
⚙️AlgorithmIntermediate
State Space Reduction
State space reduction shrinks the number of dynamic programming or search states by keeping only the information that truly affects future decisions.
#state space reduction#dynamic programming#equivalence relation+12
⚙️AlgorithmIntermediate
LIS Variants
LIS variants extend the classic longest increasing subsequence to handle non-decreasing sequences, counting how many LIS exist, and maximizing the sum of a subsequence.
#lis#lnds#patience sorting+12
⚙️AlgorithmIntermediate
Longest Increasing Subsequence
The Longest Increasing Subsequence (LIS) is the longest sequence you can extract from an array while keeping the original order and making each next element strictly larger.
#longest increasing subsequence#lis#dynamic programming+12