Gamified challenge · Backtracking
There are n countries numbered 0 to n - 1. Each pair [a, b] in borders means countries a and b share a border. You have m paints, numbered 1 to m.
Write colour(n, borders, m) that returns a list c of length n, where c[i] is the paint of country i, such that no two bordering countries share a paint. Any valid colouring passes. If no colouring with m paints exists, return an empty list [].
Example: a triangle n = 3, borders = [[0, 1], [1, 2], [0, 2]] with m = 3 can be [1, 2, 3]; with m = 2 the answer is [].
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google