OYO Interview Experience 2019 (On-Campus)

Round 1:

This was an online coding round on interviewbit and consisted 20 MCQs and 2 coding questions.

  1. Generate Grey code
  2. Minimum number of jumps

Round 2:



The interviewer was very cool and made sure I understood the problem.He asked me to brief my projects and then gave me 3 coding questions and told me to write modular code for each of them.

  1. Find one missing number in given range
  2. maximum-value-array-m-range-increment-operations  Similar to this question with decrement.
  3. find-the-ordering-of-tasks-from-given-dependencies Multiple questions on working and edge cases.
  4. What is deadlock?

Round 3 :

The round started with a introduction then discussion on my projects and questions related to them.Then he gave me two coding questions.As my resume mostly focused on competitive coding he told me not to miss any edge cases.

  1. nearest-1-in-binary-matrix Similar to this question with diagonal movement and -1 values.
  2. find-a-tour-that-visits-all-stations I gave him O(n^2) solution then modified to O(n), but he insisted on giving him an approach by which he can tell in constant time if it is possible to complete the tour from given point.
  3. What happens when you hit a URL? Also he asked me what happens if The URL is of a newly created website.
  4. What is ISP and DNS.
  5. Hash-map and how it is implemented, collision handling.
  6. Difference between SQL and NO-SQL database and why I used NO-SQL.

Questions on OS, DBMS mainly

  1. Virtual memory
  2. Deadlock
  3. Paging
  4. Indexing and its implementation
  5. Keys.

 

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.