LeetCode 915: Partition Array into Disjoint Intervals
A clear explanation of finding the smallest left partition using prefix maximums and suffix minimums.
Tag
Prefix
3 notes
LeetCode 440: K-th Smallest in Lexicographical Order
Find the k-th integer in lexicographical order without generating all numbers, using prefix counting over a conceptual trie.
2.6 Tries and Prefix Structures
Trie variants including compressed, Patricia, ternary, XOR, suffix trees, Aho-Corasick, DAWG, HAMT, and concurrent prefix structures.