Oyo Interview Experience SDE – On campus 2019

Round 1: Coding Round hosted on interviewbit platform.

Consisted of two coding questions – Number of ways to decode, LIS. Consisted of MCQs based on Operating systems and DBMS

https://www.geeksforgeeks.org/count-possible-decodings-given-digit-sequence/



https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/

Round 2: Technical Round :

I was asked to implement two questions. First one was to print all the triplets that sum to K. Duplicates were allowed in the array. Focus was more on the approach than on the actual solution. Second question was to do in place string compression.

https://www.geeksforgeeks.org/print-all-triplets-with-given-sum/

https://www.geeksforgeeks.org/run-length-encoding/

Round 3: Technical Round:

I was asked a question based on Lowest common ancestor and then to calculate the distance from lca to both the nodes and then I had to apply some kind of manipulations. I was to implement the whole code. Then I was asked a question based on string matching and window.

ref:

https://www.geeksforgeeks.org/diameter-of-a-binary-tree/

https://www.geeksforgeeks.org/anagram-substring-search-search-permutations/

Then I was asked questions based on OS and DBMS:

  1. What is virtual memory? How will you design a virtual memory?
  2. Questions based on demand paging, page swapping, how does page map, data structures used for it, page table concepts and functions of memory management unit.
  3. Page replacement algorithms, implement LRU Cache ( I did it using dll and hashmap)
  4. Fragmentation in OS and DBMS, transaction, serialization, indexing and usage of checkpoints in recovery.
  5. More logical questions were asked based on whatever answer one gives.


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.