Status: B.tech in Electronics and Communication Engineering from NIT(2021 Grad) | On Campus Offer
Position:SDE-1 at OYO
Date: November 2020
ROUND 1-Online Assesment
This round was held on hackerearth. Two fairly simple questions were asked.
First was variation of next greater element and instead of next greater element it asked about next greater frequent element.It was solvable using stack.
Second question was a bfs problem in 2d grid- Find shortest distance between source to destination in 2d grid where obstacles are present and you can move in all four directions.
I solved both questions.
Also, 10 mcqs were asked ranging from ds/algo, oops,dbms,os.
Although few people who solved only one questions were also shortlisted but most/all of the final converts were who solved both questions.
INTERVIEW
Technical Interview round1
Firstly Two coding questions were asked:
- Container with most water-https://leetcode.com/problems/container-with-most-water/
- Bottom view of Binary tree
Then I had to explain both online assesment questions with proper time and space complexity
This round too went very well.
Technical Interview Round2
First question was-Find a pair of elements swapping which makes sum of two arrays same
I struggled in this question for a while. Could not come up with most efficient solution.
Second question was Shortest Unique Prefix
I gave trie based solution
Third question was to print path between given two nodes in tree- I presented solution based on LCA.
Few questions on oops,DBMS,OS were asked.
Then they asked me to design database of Quora and some queries on it were also asked.
This round went pretty long.
Few people also had third round of interview. I had only two.
Verdict: Selected :)