About me:

YOE: 5 months intern + 2 months fulltime in product based MNC.
Clg: B.Tech CSE(Tier 2)
LeetCode: 188E 416M 153H

OA:

Got 2 questions on hackerrank with some LP questions:

Q1 : https://leetcode.com/problems/merge-k-sorted-lists/
Q2: https://leetcode.com/problems/minimum-path-sum/

Interview Round 1:

Was scheduled after 10 days of OA.

Directly jumped to the coding question:
Q: https://leetcode.com/problems/lru-cache/
Only one question was asked in this round, follow up was to implement it with singly linked list.

Interview Round 2:

Same day as Round 1.

Directly jumped to the questions:
Q1: Find the max distance between first and the last occurance of anagram.

s = 'acbzzadbc'
anagram = 'abc'

first occurance is from index 0 to 2 and last occurance is index 5 to 8. 

distance between both of them is 2.
So, res = 2

Q2: Given for integer arrays, find the total number of possible combinations picking 1 element from each array within specific budget.

a = [1, 2, 3]
b = [4, 6, 7]
c = [2]
d = [3, 4]
budget = 11

res = 3

Interview Round 3(Hiring Manager Round):

Next day

Deep dive into previous company work and personally project. Also asked few things about Compilers, Networks and OS and 2 coding question.
I told that I am not well versed with Compilers and Networks and answered OS questions.

Q1: https://leetcode.com/problems/implement-stack-using-queues/
Q2: https://leetcode.com/problems/unique-paths-iii/

Interview Round 4(Bar Raiser Round):

Same day as round 3

Asked me about prev company experience and things I did and asked 2 questions apart from it.

Q1: https://leetcode.com/problems/binary-tree-maximum-path-sum/
Q2: https://leetcode.com/problems/maximum-subarray/

Verdict:

Got offer after 2 days.