You are on level: Student
Overview
Basic Data Structures
Basic Algorithms
Same Direction
Opposite Direction
Sliding Window
Cycle Finding
Speedrun
DFS on Tree
Binary Search Tree
Combinatorial Search
Additional States
Aggregation and Memoization
Additional Practices
Speedrun
Vanilla BFS
Matrix as Graph
Implicit Graph
Directed Graph / Topological Sort
Weighted Graph
Minimum Spanning Tree
Introduction
Dynamic number of subproblems
Knapsack
Additional Practices
Disjoint Set Union | Union Find
Data Structure Design
Segment Tree
Monotonic Stack
Line Sweep
Tree Traversal without Recursion
Amazon OA
Microsoft OA
Google OA
Editorials
Prereq: BFS on Graph
On an infinitely large chessboard, a knight is located on [0, 0].
A knight can move in eight directions.
Given a destination coordinate [x, y], determine the minimum number of moves from [0, 0] to [x, y].