Sort a Binary Array | Dataford Interview Questions

Write an algorithm to efficiently sort a binary array.

Use the function signature def sort_binary_array(nums):. The input is a list containing only 0 and 1; return the same list sorted in ascending order. Aim for O(n) time and O(1) extra space.

Constraints

1 <= len(nums) <= 1000
Each element of nums is either 0 or 1
The input list should be modified in place
Return the sorted list

Function Signature

def sort_binary_array(nums):

Your question is Sort a Binary Array. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Write an algorithm to efficiently sort a binary array.

Use the function signature def sort_binary_array(nums):. The input is a list containing only 0 and 1; return the same list sorted in ascending order. Aim for O(n) time and O(1) extra space.

Constraints

1 <= len(nums) <= 1000
Each element of nums is either 0 or 1
The input list should be modified in place
Return the sorted list

Function Signature

def sort_binary_array(nums):

Your question is Sort a Binary Array. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.