Oracle OCI | MTS (IC2) | USA | Aug 2024 [Passed]

Status: 2 YOE
Location: USA
Date: Aug 2024

Technical Phone Screen (1 Hour):

1. Check if a linked list is Circular Linked List
2. Kth Largest Element in an Array
3. 5-10 mins, Java DSA Questions

Onsite( 3 Rounds):

Round 1 (1 Hour):

1. kth Smallest Element in an Array
2. K-way merge algorithm (Algo/TC/SC Discussion only)

Round 2 (1 Hour):

1. Given Paths (45 mins):
   /abc/def/ghi,
   jkl/mno/pqr,
   stu/vwx/yz

• Write a method to return all unique directories and files from the list.
• Followup: Return directories and files separately
• Followup: Discussion only for being able to return in hierarchical format (Tree)

2. System Design: Restaurant Management (15 mins)

• Class Diagrams only

• Scalable Options (LB, Caching) and theortical questions.

HM - Round 3 (1 Hour)

Coding (40 mins)

1. Merge 2 sorted List
2. Follow up: Merge k sorted list (Divide and Conquer Algorithm

System Design (25 mins) - TinyUrl (Complete)

Behavioural Questions (15 mins)

Result: Pass

This was a challenging interview for me and encourage all readers to do well.