I got a call from a recruiter for a phone screening. Once that was done, I received a coding assessment (any language, preferably Python) provided by the company, which is a preliminary technical screening. After the assessment was reviewed, I received a call from HR to schedule a coding round.

Find the subarray which will give the largest sum.

Given a target number, find the index of the two numbers whose sum gives the target number.

Given 9 balls which look alike and weigh the same; however, there is one ball amongst these balls which is slightly heavier. How many iterations are required to find the heavier ball?