Recent Amazon Internship OA | Camera Proctored | ₹125000/Month Stipend
- Posted
- 27 Oct 2026
Summary
I completed a camera‑proctored online assessment for an internship. It contained a binary‑string optimization problem and a debugging task.
How it went
Could not take image of the problem as audio & video was getting proctored.
The first question was based on a binary string log and an integer k. We can choose one substring of length k and change every 0 inside that substring to 1. The goal is to find the maximum number of consecutive 1s possible after the operation. Example log = "11001" k = 2
11[00]1 ↓ 11[11]1
Result = "11111"
Answer = 5
Second Question was based on debugging code repository with multiple files and 100s of lines of codes in each file on average.
Questions asked (1)
- 01
Maximize Consecutive Ones after Flipping a Substring
Data Structures & Algorithms · Medium
Given a binary string
logand an integerk, you may choose any substring of lengthkand change every0inside that substring to1. After performing this operation exactly once, determine the maximum possible length of a consecutive sequence of1s in the resulting string.Example
log = "11001" k = 2 11[00]1 <- choose the substring of length 2 (positions 3‑4) ↓ 11[11]1 <- flip zeros to ones Resulting string: "11111" Maximum consecutive 1s = 5