College:- B.tech from a tier 1 college.
Current Company:- Fintech startup
YOE:- 4 years

Application:- Applied via linkedIn in month of of july. Recruiter reached out in the month of sept for the interview.
Round1 [Screening] :- Started the interview with a simple introduction and expectation was I solve 2 coding questions. Q1:- a string is given like this [1[2,[3,4] ] ] and you need to return the result which is calculated like this 31 + 41 +22 + 13 => 14, i.e 1 has multiplication factor(mf) of 3 2 has mf of 2 and (3 and 4 ) has mf of 1 since they are at the deepest level. Needed to write the optimal code for this. Gave the solution with extra space but recruiter wanted it without any extra space except for recusrion stack so did it like that. Dont remeber the Q2 but it was a easy array question
Verdict:- Strong hire
Round2[DSA] -> Q1. it was a backtracking problem , Q2. a binary tree leetcode medium problem, interviewer wanted some optimisation for backtracking problem could not do it by myself.
Verdict:- Lean Hire
Round3[DSA] -> Both two pointers question were asked:- Q1: https://leetcode.com/problems/max-consecutive-ones-iii/description/, Q2 -> https://leetcode.com/problems/minimum-window-substring/description/, was able to solve both
Verdict:- String hire
Round4[Behavioral] -> It was mainly like a tell me about a time and a design question was asked where we have to build a system which checks if the content the user is posting does not violate linkedin guidelines and if it breaks guidelines what the system should do, it was an open ended question, expectation was to take all the inputs by interviewers and make some solid assumption for the system
Verdict:- Strong hire
Round5[Project Discussion]-> in depth discussion of the most challenging project you have worked on , the interviewer will question every design choice of yours, in my case the inetrviewer was not impressed with my project.
Verdict:- Lean hire
Round6[Design round] -> Was asked to build a system like newRelic/Splunk where logs and metrics need to collected and stored and post that need to make an alert and visualization system. More focus was on the metrics collection and how will we be storing so that query on basis of time and keyword can be optimised.
Verdict:- Strong hire
Since I got lean hire for 2 rounds and rest as string hire another round was scheduled for me consisting of both DSA and project discussion
Round7[Misc round]-> 20 mins were spend on project discussion, mentioned another project that i worked upon the candidate liked my work and then asked 2 coding problem which needed to be completed in 40 mins Q1->Given a list of number and 2d array which tells a relation whether number i knows number j or not by a[i][j] with 1 or 0, where 1 means i knows j and 0 means i does not know j, we need to find the famous number out of given input array, a number is famous if it is known by all but that number doesnt know anyone else, did it intially using a stack and then was asked to do it without any extra space, was able to do it without extra space. Q2 ->. this was a tree problem where we needed to modify a tree , dont remember the exact question.
Verdict:- Strong hire

***Overall result*** -> Selected, got the communication after 1.5 week post my last interview, the entire interviews were done in a span of 2 weeks.

`Compensation:- https://leetcode.com/discuss/compensation/6020523/linkedin-senior-software-engineer-backend/2713350`