4b2835bae6
* Create find_all_words_matching_pattern_in_given_dictionary.cpp Given a dictionary of words where each word follows a CamelCase notation, find all words in it that matches a given pattern of all uppercase characters. We can use a Trie data structure to solve this problem. The idea is to insert all uppercase characters of each word in the CamelCase dictionary into a Trie. Expected output: HiTech HiTechLab HiTechCity * Update README.md |
||
|---|---|---|
| .. | ||
| find_all_words_matching_pattern_in_given_dictionary.cpp | ||
| trie_delete.cpp | ||
| trie_insert_search_startWith.cpp | ||
| trie_search.cpp | ||