โ† Accolite questions

Stable In-place Binary Array Sort

Filed under Accolite

Given an array containing only 0s and 1s, sort the array in-place in O(n) time and O(1) extra space such that all 0s precede all 1s while maintaining stability.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Accolite questions

Collected from public candidate posts and coding forums. Updated Nov 2026.