Coding (Algo)

Bipartite graph check: two-color every connected component and reject conflicting edges

Bipartite graph check: Given an undirected graph, return whether every connected component can be colored with two colors so adjacent nodes differ.

Input: A JSON object { "n": number, "edges": [number,number][] }.

Output: A JSON boolean.

Constraints:

0 <= n <= 100000
Nodes are numbered from 0 to n-1
The graph may be disconnected

Read one JSON value from stdin and print exactly one JSON-serialized answer to stdout with no extra text.

Difficulty: MEDIUM. Variant: 2. Expect follow-up questions about complexity, edge cases, and alternative approaches.

Practice context

This coding (algo) exercise trains prompt interpretation, explicit assumptions, a concrete response, and a concise explanation of the decisions made. It is marked medium difficulty.

The signed-in workspace provides the tools required by the round, such as recording, code execution, diagrams, structured notes, o

What this task practices

This coding (algo) exercise trains the same sequence expected in an interview: understand the prompt, make assumptions explicit, produce a concrete answer, and explain the decisions behind it. The task is marked medium difficulty. The private workspace adds the tools required by this round, such as recording, code execution, diagrams, evidence panels, or structured notes. It also preserves the attempt so later feedback can be compared with previous work. Evaluation is based on task-specific criteria and the candidate seniority selected in the preparation path. Public pages never expose the reference solution, hidden tests, evaluator instructions, or another candidate’s work.