IC2 - SSE Role: R1: DSA
1.nearest smaller element to the left - BruteForce O[N^2], And with Stacks O[N].
2.reverse the first k elements of an array - Solved with 2 pointer approach and inplace swap O[K].
Making sure, we think out loud with approach, consider all base-cases and constraints, with dry runs at the end.
Verdict: Hire

R2: Design + DSA Started with Intro, questions from current project's Architecture.
-minimum number of days to disconnect island - LC, we had a thorough discussion, and interviewer helped me with the approach(this was a very tough question to solve on the go).
-RateLimiting design, I had this on my resume which I implemented with redis-lua.
-some questions on spring, java, kafka, API servlets, webservers to windup
Verdict: Hire

R3: HLD/LLD Started with Intro, questions from current project Architecture. Three major contributions from you [have discussed on usage of AI as well]
-how did you manage the latency to psql DB (connection pooling) how did you achieve stickiness and high availability(consistent hashing)
-Design and Implement an application for URL scrapping, client shares source-url and depth, need to return list of URLs till depth. max depth can be ~100K I have focused on taking proper NFR, FR and API designing which helped.
PS: I initially started to implement backtracking thinking if it was a DSA problem :P

Interviewer again was friendly, he helped me with all the questions I had for the design.
Verdict: Strong Hire

R4: Hiring Manager Questions related to previous experience, and few behavioural questions.
Verdict: Strong Hire