Current yoe : 2.7, still I was selected for the staff level position interview.
Current position : 5G R&D Software Engineer at Jio Platforms Limited.

Round 1 (Online Virtual Meet)

The interviewer asked my current day to day work expereince. They were looking for a strong C/C++ work experience. The interviewer asked many advanced C++ concepts with cross questions like :
a. Why inline constructor arguements is used? I answered because its fast. Cross-question : Why fast?
b. Static members use cases. Can they be used by other non - static members? Can non - static members use static members?
Other C++ questions I don't remember.

DSA Questions
Q1. Implement a queue using stack only. Used 2 stacks. Asked to dry run on test cases. Gave correctly. Asked time complexity, I said its amortized O(1). This impressed the interviewer.

Q2. Maximum path sum from top-left of grid to bottom-right of grid. Gave a memoized DP approach with code.

Round 2 (In-office Noida Face to Face Round)

The panel consisted of 2 interviewers.
They asked about some 5G concepts like LTE and what my role is in my team (exact technical terms helped here). Then asked about some points in my resume, specifically the quantified points like home I reached the optimisation. I told them we used flat_hashmap instead of normal, shifting from open addressing to seperate chaining. The interviewer probed deeply, and I couldn't convince him much.
Then some design questions came:
Q1. Design a hashmap, the key value pairs could be integers. I gave an approach having a vector of nodes (a struct with key, value and pointer to next node). They probed deep into the internal memory structure of my approach and I couldn't convince them (biggest negative).
Q2. Design a stack using queue only. It was doable but I couldn't come up with a solution because of pressure from previous question.
Q3 Design two functions for an array of integers :
get(left,right,val) - returns the frequency of integer val between indices left and right.
update(index,val) - update the element at index index with value val.

I tried a segment tree approach but couldn't solidify it with a proper algorithm. I tried another approach using a hashmap of pairs storing the frequency of element within every possible pair of indices ranges. The interviewer probed deep again and I couldn't convince them.
At last, I asked for their feedback. They said I need to revise the concepts by writing code, not just reading theory. The hashmap implementation could have been done and explained better, that was a negative point as per them.

Verdict: Not selected. The HR reached out to me for another position in Bengaluru but no interviews were scheduled.