Depth-First SearchBreadth-First SearchUnion-FindGraph Theory
Rotate Array
MEDIUM
75%
ArrayMathTwo Pointers
Univalued Binary Tree
EASY
62.5%
TreeDepth-First SearchBreadth-First SearchBinary Tree
Knight Dialer
MEDIUM
62.5%
Dynamic Programming
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.