The interview process consisted of multiple technical rounds.

It started with an online coding assessment focusing on data structures and algorithms.

This was followed by two technical interviews that involved problem-solving, system design basics, and core CS concepts like OS, DBMS, and OOP.

One round also involved a discussion about my projects and past internship experience.

The final round was with a senior engineer and focused on debugging and code optimization.

Given an array of integers, find the length of the longest subarray with a sum equal to zero.

Implement a Least Recently Used (LRU) cache.

Given two sorted arrays, merge them without using extra space.

Detect and remove a loop in a linked list.

Implement a trie and add functions for insert, search, and delete.

Write a program to perform matrix rotation by 90 degrees clockwise.

Find the kth largest element in an unsorted array.

Implement a stack that returns the minimum element in O(1) time.

Given a binary tree, perform a zigzag level order traversal.

Find the number of islands in a 2D grid (DFS/BFS-based problem).