LeetCode Experience

#886 Possible Bipartition

Interview Experience

LeetCode #886: Possible Bipartition. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory. Asked at Amazon 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 Graph Union Find