Available question text
Given an undirected graph as adjacency lists (possibly disconnected), determine whether it is bipartite — i.e., can its vertices be two-colored so no adjacent vertices share a color — which reduces to detecting a conflict/odd cycle via graph traversal (BFS/DFS).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 2 records
Google
Leetcode 785. Is Graph Bipartite?
Reported Sep 26, 2024 · 1 source report
JUNIOR
Source snapshot: Nov 12, 2026
View sourceLinkedIn
Leetcode 785. Is Graph Bipartite?
Reported Apr 30, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source