Round 1: Tech

A DSA question was asked: Given a number 'n', find the smallest k such that all the bits of n in base k are 1.

Round 2: Tech.

Given an array of n integers, remove a subarray such that the sum of remaining elements is divisible by k.

Round 3: Hiring Manager

Some behavioral questions, CS fundamentals, and the resume were discussed.

Round 1:

1 DSA question was asked: Given a number 'n', find the smallest k such that all the bits of n in base k are 1.

Round 2:

Given an array of n integers, remove a subarray such that the sum of the remaining elements is divisible by k.