📄️ Big Countries
LeetCode 595 | Difficulty: Easy
📄️ Implement Trie (Prefix Tree)
LeetCode 208 | Difficulty: Medium
📄️ Word Search II
Given an m x n board of characters and a list of strings words, return all words on the board.
Trie Problems
Prefix matching, autocomplete, word search, and trie-based data structures.