Coming to the first round of the interview process, I was asked to brief myself and how I developed my interest for such a software role. Then the interviewer moved on to a few coding questions after providing me with a live coding link where I had to write my code (just the required functions/classes/structures not the whole code from top to bottom). He asked me to find an element in a rotated array that was otherwise sorted(https://www.geeksforgeeks.org/problems/search-in-a-rotated-array4618/1). I told him I can provide him with a binary search solution which will take O(log n) time. Learning that I already know the approach, he moved on and asked me to write a function to find the Lowest Common Ancestor in a Binary Tree. I wrote the code successfully and ran a few manual test cases on it. After that, he modified the LCA question a bit and asked my approach. I shared what I thought but it was not 100% correct so he told me the correct approach to that. Then he asked me another question: https://www.geeksforgeeks.org/problems/maximum-gap3845/1 He asked me to solve it in O(n) time complexity and after thinking for sometime, I told him what approach I thought of. I didn't know Pigeonhole Sorting technique, and tried to solve it using stacks but couldn't arrive at a proper solution in that limited time. But the interviewer was happy with my approach and told me "Quite close". Within a couple of hours, I received a call and got notified that my second round of interviews was scheduled in an hour.