Online Assessment

Binary Swaps and a Django Post Fix

AmazonSoftware Engineer · New Grad · Online Assessment · Aug 2026

I took the online assessment. It had two parts. DSA: minimum adjacent swaps for a binary array Given an array containing only 0s and 1s, rearrange it so that all 0s are at one end and all 1s are at the other. Either ordering was allowed: 000...111 or 111...000. In one move, I could swap two adjacent elements. I had to return the minimum number of moves required. For [0, 1, 0, 1], the answer was 1…

Shared by a candidate · reported Aug 2026. Interview formats change; use it as a guide, not a script.