Code Room
CodingEasy
Question
Given an integer array, move all 0s to the end while keeping the relative order of the non-zero elements, and return the result. Aim to do it with a single pass and constant extra space. The array has length >= 1.
Implement
move_zeroes(nums: list[int]) → list[int]Examples
in
[[0,1,0,3,12]]out[1,3,12,0,0]What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Learn the concepts
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.
Run or narrate your approach, then ask the coach.