Practice problems across 75+ categories
Practice problems frequently asked at Trie • 59 problems | 5 Easy | 25 Medium | 25 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 31 | Maximum Genetic Difference Query | Hard | ArrayHash TableBit Manipulation |
| 32 | Maximum Strong Pair XOR I | Easy | ArrayHash TableBit Manipulation |
| 33 | Maximum Strong Pair XOR II | Hard | ArrayHash TableBit Manipulation |
| 34 | Maximum XOR of Two Non-Overlapping Subtrees | Hard | TreeDepth-First SearchGraph |
| 35 | Maximum XOR of Two Numbers in an Array | Medium | ArrayHash TableBit Manipulation |
| 36 | Maximum XOR With an Element From Array | Hard | ArrayBit ManipulationTrie |
| 37 | Minimum Cost to Convert String II | Hard | ArrayStringDynamic Programming |
| 38 | Minimum Number of Valid Strings to Form Target I | Medium | ArrayStringBinary Search |
| 39 | Number of Distinct Substrings in a String | Unknown | StringTrieRolling Hash |
| 40 | Number of Matching Subsequences | Medium | ArrayHash TableString |
| 41 | Number of Valid Words for Each Puzzle | Hard | ArrayHash TableString |
| 42 | Palindrome Pairs | Hard | ArrayHash TableString |
| 43 | Partition String | Unknown | Hash TableStringTrie |
| 44 | Phone Number Prefix | Easy | ArrayStringTrie |
| 45 | Prefix and Suffix Search | Hard | ArrayHash TableString |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
