Skip to content

Files

Latest commit

1eb664f · Jan 30, 2020

History

History

problem035

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Jan 30, 2020
Jan 30, 2020
Jan 30, 2020

Daily Coding Problem: Problem #35 [HARD]

Good morning! Here's your coding interview problem for today.

This problem was asked by Google.

Given an array of strictly the characters 'R', 'G', and 'B', segregate the values of the array so that all the Rs come first, the Gs come second, and the Bs come last. You can only swap elements of the array.

Do this in linear time and in-place.

For example, given the array ['G', 'B', 'R', 'R', 'B', 'R', 'G'], it should become ['R', 'R', 'R', 'G', 'G', 'B', 'B'].