BFS Shortest Path in an Unweighted Graph (Authoritative) — Open the Lock
Use BFS to find the minimum number of moves in an implicit unweighted graph (LeetCode 752: Open the Lock).
Intersection of Two Arrays
Find the intersection of two arrays and return the result as an array.
Longest Consecutive Sequence
Find the length of the longest consecutive elements sequence in an unsorted array.