MISSION PROGRESS
COMPLETION STATUS
0%
TOTAL PROBLEMS
6
COMPLETED
0
| STATUS | PROBLEMS | BOOKMARKS | COMMENTS | ACCESS |
|---|---|---|---|---|
Construct a trie from scratch | ||||
Find shortest unique prefix for every word in a given list | ||||
Word Break Problem | (Trie solution) | ||||
Given a sequence of words, print all anagrams together | ||||
Implement a Phone Directory | ||||
Print unique rows in a given boolean matrix |