I applied through a recruiter. There will be a call from their recruiters.

First round will be a 1-on-1 interview. It had tough-level DS and algo questions. I have mentioned the questions below. I didn't pass the round, so I can't say what happens next.

Question 1: Considering you are a manager of a software development team, you are having a series of tasks, say n, with some credits assigned to each task, and you manage around m people. You need to assign consecutive tasks to those m people such that the maximum of the total of the credits assigned to each person is minimum. Example: n tasks with their credits are {12, 34, 67, 90}, and consider m to be 2. The ways you can assign tasks are: giving person 1 tasks with {12} credits and person 2 with remaining credits {34, 67, 90}, so the maximum of credits is (12, 34+67+90) = 191; giving person 1 tasks with {12, 34} credits and person 2 with remaining credits {67, 90}, so the maximum of credits is (12 + 34, 67+90) = 157; giving person 1 tasks with {12, 34, 67} credits and person 2 with remaining credits {90}, so the maximum of credits is (12 + 34 + 67, 90) = 113. The minimum of the three is 113. You have to assign tasks according to the third way: 12, 46, 113, 203, 303.Question 2: Let's call the 'left cyclic shift' of some string S(1)S(2)S(3)...S(n) -> S(2)S(3)...S(n)S(1). Let's call the 'right cyclic shift' of some string S(1)S(2)S(3)...S(n) -> S(n)S(1)S(2)S(3)...S(n-1). Let's say string 'S' is GOOD if its 'left cyclic shift' = 'right cyclic shift'. You are given string 'S', which consists of digits 0-9. What is the minimum number of characters you need to erase from 'S' to make it GOOD? Constraints: 2 <= |S| <= 2*10^5. Sample Input: 95831. Sample Output: 3. Explanation: You can erase any 3 characters, for example, the 1st, the 3rd, and the 4th. You'll get string 51, and it is good.