Background: 3 Years Experienced
Education: CSE Grad from NIT
Round 1 : DSA ( 1hr )
Word Ladder
Largest Rectangle in Histogram
Round 2 : DSA,LLD,HLD (90 mins)
1 Check if a Binary Tree is Binary Search Tree ( O(N) Time complexity )
2 . Flatten a multilevel Sorted Linked List .
- Design a Data Structure for the following operations. The data structure should be efficient enough to accommodate the operations according to their frequency.
findMin() : Returns the minimum item.
Frequency: Most frequent
findMax() : Returns the maximum item.
Frequency: Most frequent
deleteMin() : Delete the minimum item.
Frequency: Moderate frequent
deleteMax() : Delete the maximum item.
Frequency: Moderate frequent
Insert() : Inserts an item.
Frequency: Least frequent
Delete() : Deletes an item.
Frequency: Least frequent.
(Used a min and max Heap and a HashMap) then optimized it with 2 heaps and a linked list .
Design Rate Limiter ( Low level Design) for a single Machine
Extend this for a production system with multiple machines and a high level design of the system. ( I had some hiccups in the counter questioning while designing the system as I was not sure if my implementation was an optimal one)
Round 3 : DSA,LLD (60 mins)
Find Longest Common Subsequence between 3 strings.
Design a Logger System with two functionalities (Low Level Design)
Different levels of logs - info, debug, warn, severe
Different output modes- console, DB, File ( Should be supportive of both sync and async mode)
Round 4 : (LLD/HLD Discussion on OYO Hotel System for 45 mins) + Leadership Principles, Business Logic, Mentorship Strategies etc.( 25 mins)
Hired!
Compensation : https://leetcode.com/discuss/compensation/1048027/OYO-or-SDE-2-or-Hyderabad