Tech Interview 1:

This round is entirely based on CS fundamentals (around 45 minutes).

It started with a self-introduction and a discussion of my projects.

I was asked about my role and contribution in each of them. The interviewer asked me questions on Bootstrap CSS. He presented a food application scenario and asked me to explain every stage of SDLC using it.

Topics covered included:

• ACID properties in DBMS
• Triggers and Cursors in DBMS

A coding question was posed: generate permutations of a string. I initially used a predefined function, which the interviewer accepted, but he later asked me to code the logic as well.

Tech Interview 2:

This round is designed to test coding skills (around 45 minutes).

The interviewer began with a self-introduction and then moved directly into coding questions.

Questions included:

• Print stack elements in reverse order with O(1) space complexity.
• Delete the k-th element in a linked list.
• Find a pair in an array that sums to k (I provided multiple approaches, from brute force to optimized).
• Check whether arr2 is a subset of arr1.
• One binary search question (I don't recall the specifics).

Once convinced of my coding abilities, the interviewer asked general questions:

• Data structures and their real-life applications.
• The difference between MySQL and MongoDB.
• How Google Maps finds the shortest path (this was a friendly chat).

HR Round (around 25 minutes):

It began with a self-introduction. The interviewer asked what attracted me to Oracle from the day's presentation. He inquired where I see myself in three years. He asked about my pride possession. He asked if my project was on my local machine. Upon confirming, he requested a demonstration. I explained how data transactions occurred in the project. He then asked me to code a simple program to find the second-largest element in an array. He was satisfied when I presented the most optimized approach.

Print stack elements in reverse. Delete the k-th element in a linked list. Find a pair in an array that sums to k.