Google SDE - 2 L3 Interview Experience | Reject

**Google SDE-2 L3 Interview Experience **

Current Experience : 2.9 years
Working in PBC
Recruiter reached out via Email

Step 1 :
The Recruiter reached out to me via email and we have a brief google meet discussion to discuss about the how the interview will go and what should i be preparing for . The Recruiter asked me how many leetcode questions I have done . And asked me how much time i require to prepare for the interviews . I asked about 3 weeks , and somehow it got extended to about a month . The recruiter asked me to practice only hard and medium hard questions . Expectation was something like MEDIUM questions should be done in 20mins and HARD questions in 40 mins maximum . Interviews will be of 45 mins
The recruiter said there will be 1 phone screen round and 3 DSA and 1 behavarioul interview .

On the day of the phone Screen , the recruiter said due to my experience they are skipping the phone screen and will be directly going for the onsite .
They provided dates for the 1st onsite , 2nd onsite and 3rd onsite . They were 3 days consecutively

1st onsite :- Came up with the logic but did not have enough time to code it up

Problem - An arithmetic sequence is a list of numbers with a definite pattern. If you take any number in the sequence then subtract it from the previous one, the difference is always a constant.

A good arithmetic sequence is an arithmetic sequence with a common difference of either 1 or -1.

For example, [4, 5, 6] is a good arithmetic sequence. So is [6, 5, 4], [10, 9], or [-3, -2, -1]. But, [1, 2, 1] (no common difference) or [3, 7] (common difference is 4) is NOT.
Implied, any sequence that has only one element is a good arithmetic sequence.

For example, [4] is a good arithmetic sequence.
Given an integer array nums, return the sum of the sums of each subarray that is a good arithmetic sequence.

Example:

Given nums = [7, 4, 5, 6, 5]. Each of the following subarrays is a good arithmetic sequence:

[7], [4], [5], [6], [5],
[4, 5], [5, 6], [6, 5],
[4, 5, 6]
The sums of these subarrays are:

7, 4, 5, 6, 5,
4 + 5 = 9, 5 + 6 = 11, 6 + 5 = 11,
4 + 5 + 6 = 15
Thus, the answer is the sum of all the sums above, which is:

7 + 4 + 5 + 6 + 5 + 9 + 11 + 11 + 15 = 73.

[5 6 7 8 9]
[6 7 8]

2nd Onsite question :- Was not able to come up with the logic even

Question was something to design a linux directory management system

Given a list of file paths return the final composed list of paths

Input :-

you will be given a list of paths

/home/foo/bar/file1.txt
/home/foo/bar/file2.txt
/home/foo/mobi/wiki/file3.txt
/home/foo/mobi/file4.txt
/home/foo/file5.txt
/home/foo/mobi/file6.txt

Output :-
/home/foo/bar ---> (file1.txt , file2.txt) are composed here
/home/foo/mobi/wiki/file3.txt (file3.txt) can be found here
/home/foo/mobi --> (file4.txt , file6.txt ) are composed here
/home/foo/file5 --> (file5.txt) can be found here

This was tree kind of question and you kind of need to find the node in the tree which has all its children visited .

3rd Onsite :

arr -> [ 12 , 15 , 16 , 81 , 23 , 19 , 21 , 43 ]
Given an array of positive integers

For any given subarray , that subarray will have a maximum element , lets call it M1
and a minimum element , lets call it M2
lets call M1 + M2 as the extreme sum of a given subarray .
Find the extreme sum of all the subarrays .

4th Onsite : Was behavariol Round

Then Recruiter set me up for 2 HM rounds , from this i called the Recruiter up asking about the feedback
the feedback was Lean Hire, No Hire , Strong Hire , Lean Hire . So she said that we are trying to get good feedback from the HM so that you can pass the Hiring Committee . So what i learnt is that if your fit calls are happening before you have got the offer , then its probably that your interview's feedback
need some backup with the Hiring Manager's Feedback.
Had 2 fit calls after that recruiter called and said won't be able to proceed furthur as the feedback does not seem favourable .

The process lasted for around 4 months . But it was a good process . I realised if you can solve medium hard in 30 minutes and Hard in 40 minutes you are good
Also Luck factor is also there . AnyWays good luck hope this helps .
I could not find similar
Hope this helps you in your preparation . Best of luck