Interview Experience
LeetCode #3710: Maximum Partition Factor. Difficulty: Hard. Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory. Asked at Google in the last 6 months.
Original Source
This is a frequency-tagged signal. The full problem statement lives on the original source.
View original →Topics
Breadth-First Search
Depth-First Search
Graph Theory
Union-Find
Arrays
Binary Search
Graph
Union Find