1Design File SystemMediumHash TableStringDesign
Solve → 2Design File SystemMediumHash TableStringDesign
Solve → 3Check if One String Swap Can Make Strings EqualEasyHash TableStringCounting
Solve → 4Design In-Memory File SystemHardHash TableStringDesign
Solve → 5Buddy StringsEasyHash TableString
Solve → 6Minimum Number of Steps to Make Two Strings AnagramMediumHash TableStringCounting
Solve → 7Vertical Order Traversal of a Binary TreeHardHash TableTreeDepth-First Search
Solve → 8Implement Trie (Prefix Tree)MediumHash TableStringDesign
Solve → 9Binary Tree Vertical Order TraversalMediumHash TableTreeDepth-First Search
Solve → 10LRU CacheMediumHash TableLinked ListDesign
Solve → 11Integer to RomanMediumHash TableMathString
Solve → 12LFU CacheHardHash TableLinked ListDesign
Solve → 13Roman to IntegerEasyHash TableMathString
Solve → 14Design File SystemMediumHash TableStringDesign
Solve → 15Check if One String Swap Can Make Strings EqualEasyHash TableStringCounting
Solve → 16Design In-Memory File SystemHardHash TableStringDesign
Solve → 17Buddy StringsEasyHash TableString
Solve → 18Minimum Number of Steps to Make Two Strings AnagramMediumHash TableStringCounting
Solve → 19Vertical Order Traversal of a Binary TreeHardHash TableTreeDepth-First Search
Solve → 20Implement Trie (Prefix Tree)MediumHash TableStringDesign
Solve → 21LRU CacheMediumHash TableLinked ListDesign
Solve → 22Binary Tree Vertical Order TraversalMediumHash TableTreeDepth-First Search
Solve → 23Integer to RomanMediumHash TableMathString
Solve → 24LFU CacheHardHash TableLinked ListDesign
Solve → 25Roman to IntegerEasyHash TableMathString
Solve →