Question

Grab | Coding OA Questions and Solutions | SDE | Set - 1 |

Answer 1

In this round, interviewer was friendly. Thankfully!
He directly jumped on coding questions.

Given a BST and we have to find Kth smallest element from it.
- Solved with Inorder Traversal and he asked me to write code. I wrote code quickly and he came up with follow up question. I was able to answer them as well.

Given an array which includes elements in pair find out single element from array.
- eg. [2,1,3,3,1,5,2] output : 5 and 5 is single element with no pair
Solved using XOR bit manipulation. It took me sometime to come up with Bit Manipulation solution but then I was able to do it and code as well

This question was similar to Valid Parenthesis in LC and there was only 10 minutes left to solve this. So he asked me to explain approach first, he seems to be satisfied with approach so didn't asked me to code it out.

After 2 weeks I called HR for follow up and he said I got -ve for system design round.

It was good learning for me and I enjoyed crisp and sorted hiring process of Grab.