Status: 2 YOE
Position: SDE2 at a product based company
Location: Banglore, India
Date: December 2021

All the interviews were smooth and the interviewers were really helpful

There were 3 technical rounds

Round 1: DS/algo
Q1: Given 2 arrays denoting the power of heroes and villains, determine how many villans can each hero kill, every hero starts killing villains from villan[0] no matter how many villans the previous hero killed, a hero can kill a villain power of hero > power of villain?

Q2: Given an array, return max product of triplets possible such that if
I < j < k then
A[i] < a[j] < a[k]
example:
Ip = [2, 3, 1, 5, 1, 8, 6]
OP = 120(3 * 5 * 8)

Q3: Given an array in which all numbers appear twice except one number. determine the unique number. do it on better complexity than O(n) if all the repeated elements are present together. ex: [9, 9, 10, 10, 11, 11, 3, 3, 0, 1, 1]

Round 2: This was the LLD round I was asked to design split-wise (data model and APIs and the logic in APIs)

Round 3: DS/algo
Q1: Given a string(s) and a list of lists(l)
Every list in l represents 2 indices of s which we can swap
In one operation we can pick any list in l and swap characters at those indices
return the lexicographically smallest s after performing these operations any number of times and in any order.

Example:
s = 'cba'
l = [[0,1], [1,2]]
answer = 'abc'

 Q2: Given an array and an element k you can perform k operations,
In an operation, you can pick either the leftmost or the rightmost element in the array and add it to your sum, return the maximum sum that can be obtained.

Round 4: Hiring Manager round, usual HM questions like reason for leaving previous job, why cure.fit, any challenging projects, technical and non-technical intrests.

Offer details: https://leetcode.com/discuss/compensation/1666684/cure.fit-or-Backend-Engineer-or-Banglore