Recent Amazon Internship OA | Camera Proctored | ₹125000/Month Stipend

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.