Quick Overview

Determine whether a possibly disconnected undirected graph with up to 20 vertices can be colored using at most three colors so that adjacent vertices receive different colors. Account for disconnected components and isolated vertices.

Determine Whether an Undirected Graph Is 3-Colorable

Company: Snowflake

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: medium

Interview Round: Technical Screen

Overview: Determine whether a possibly disconnected undirected graph with up to 20 vertices can be colored using at most three colors so that adjacent vertices receive different colors. Account for disconnected components and isolated vertices.

Loading…