TreeDepth-First SearchBreadth-First SearchBinary Tree
Special Binary String
HARD
50%
StringDivide and ConquerSorting
Decode the Slanted Ciphertext
MEDIUM
50%
StringSimulation
Evaluate Reverse Polish Notation
MEDIUM
62.5%
ArrayMathStack
Implement Trie (Prefix Tree)
MEDIUM
50%
Hash TableStringDesignTrie
Need Help Solving These Problems?
CodingInterviewAI can instantly identify algorithms and generate optimal solutions for any LeetCode problem. Get step-by-step explanations and ace your next technical interview.