College: Tier 3
Prior experience: 1, SDE-1 at small scale startup
Location: Bangalore
Date: March 2024

Process: I aproached interviewer on mail knowing SDE-1 hiring is currently going on and he sent me the OA.

OA: 1.5hrs | 3 Questions | Medium-Hard

Interviews
Round 1 (1 hr):

Q1-> Given two strings s1 and s2. s2 is the encrypted string which contains s1 as an anagram in it. So we need to find whether s2 contains a substring which is anagram of s1 or not?
I solved this question using a Sliding window and map.

Q2-> We are given a number of strings in an array and we need to find a chain of strings such that every string is a subsequence of its next string and every string’s length should exactly be one more than its previous string. i.e, length of s[i] = length of s[i-1]+1.
I solved this question by combining two concepts together i.e DP and To check whether a string is a subsequence of another string or not.

Round 2 (1 hr):

Q1-> Find the smallest element in the sorted rotated array.
Standard question solved by binary search.

Q2-> Find maximum sum subarray.
Standard question solved by kadane’s algorithm.
There was also a follow up question like what if all the elements of the array are negative.

Round 3 (30 min): Hiring Manager Round
Discussed the project I am currently working on in my current organization. Later, some behavorial questions were there.

My Preparation: Solved Striver's DSA sheet. Prepared Project, DBMS, and OOPS.

Compensation: https://leetcode.com/discuss/compensation/4916827/flipkart-sde-1-2023-grad