This site uses JavaScript for navigation, themes, and games like 2048. Please enable JavaScript in your browser settings, then reload the page.
3 problems. Click one to open the details.
0/3 solved
1.Implement Trie
Insert, search, startsWith on a prefix tree.
2.Maximum XOR of Two Numbers
Bit trie for max a[i] XOR a[j].
3.Count Distinct Substrings
Trie of all suffixes / substrings; count new nodes.