tag

#prefix

3 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 915: Partition Array into Disjoint Intervals

Problem Restatement We are given an integer array nums . We need to split it into two contiguous non-empty parts: left = nums[0:i] right = nums[i:] The split must satisfy: max(left) <= min(right) In words, every element in left must be less than or equal to every element in right . Return the smallest possible length of left . The problem guarantees that a valid partition exists. Input and Output...
leetcode array prefix suffix May 12, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 440: K-th Smallest in Lexicographical Order

Problem Restatement We are given two integers n and k . We need to return the k -th smallest integer in lexicographical order among all integers from 1 to n . Lexicographical order means dictionary order, as if every number were compared as a string. For example, when: n = 13 the numbers in lexicographical order are: [1, 10, 11, 12, 13, 2, 3, 4, 5, 6, 7, 8, 9]...
leetcode trie prefix math lexicographical-order May 10, 2026
Wiki › Algorithms › 02. Data Structures › 2. Advanced Data Structures and Operations ›

2.6 Tries and Prefix Structures

2.6 Tries and prefix structures, 45 index slug name 1 trie Trie 2 trie-insert Trie Insert 3 trie-search Trie Search 4 trie-prefix-search Prefix Search 5 trie-delete Trie Delete 6 compressed-trie Compressed Trie 7 radix-tree Radix Tree 8 patricia-trie Patricia Trie 9 crit-bit-tree Crit Bit Tree 10 ternary-search-tree Ternary Search Tree 11 binary-trie Binary Trie 12 xor-trie XOR Trie 13 suffix-trie Suffix Trie 14 suffix-tree Suffix Tree 15 suffix-array Suffix Array...
algorithms data-structures trie prefix