done with all rounds last week.

TPS - pick/delete random elements.
Tc: O(1)
Sc: O (n)
verdict : hire

round 1: desing Run length encoding. and testcases.

Here, implemented using key as range of same element and value as that element.
but forgot to add last range and it fails on [1,1,1]. not sure will get "no hire" or "lean hire".

round 2: classic interval problem. mentioned in so many previous posts.
Input
Foo 10 30
Bar 15 45

Output
10 15 Foo
15 30 Foo, Bar
30 45 Bar

TC : O(n^2)
SC : O(n)

self verdict: lean hire because interviewer intend to ask 2nd question as well but I took more time to implement.

round 3: leetcode separate square1/2.
self verdict : hire/strong hire.

one of the best round and interviewer happy with my approach and code.

Googliness : googliness standard questions

self verdict : hire

In round1, due to interview pressure left the bug and interviewer didn't point out it but after interview i realised that made this silly/common mistake.

As per your experience is their any chances to get an offer.

will share detailed question in my next post.