Round 1: DSA (Online Coding)

Q1: Number of Connected Components in a Graph
→ DFS/BFS, O(V + E)

Q2: Boats to Save People
→ Greedy + Sorting, O(n log n)

Asked to explain both brute-force and optimized approaches with time & space complexity.

Round 2: DSA (Online Coding)

Q1: Alien Dictionary
→ Topological Sort (Kahn’s Algo), O(N + K)

Q2: Kth Largest Element in Array
→ Min Heap / Quickselect, O(n log k) / O(n)

Q3: Unique Number III(GFG)
→ Couldn't fully solve but discussed bitwise approach

Asked to explain both brute-force and optimized approaches with time & space complexity.

Round 3: Backend + System Design + CS Fundamentals

Node.js: Event loop, threading, multithreading

DB Design: Hotel Order Management – Entities like Customers, Orders, Menu Items, Payments

Operating Systems: Process vs Thread, Context Switching