Tip 1 :Practice at least 250 DSA questions on online coding platforms.
Tip 2 : Build at least 2 real-world projects to demonstrate your development skills.
Tip 3 :Revise core CS fundamentals like OOPS, OS, DBMS, and System Design thoroughly.
Tip 1: Highlight key projects and achievements that showcase your technical skills and impact.
Tip 2: Keep your resume concise, error-free, and tailored to the job description with relevant keywords.
Timing: The interview was conducted in the afternoon, around 2 PM, so it wasn’t too late.
Environment: It was an online interview, and the environment was professional and focused. There were no significant distractions during the session.
Significant Activity: The interviewer emphasized problem-solving approach and time management. At one point, the interviewer gave feedback on my approach and asked for optimization after I solved a problem, which added to the learning experience.
Interviewer: The interviewer was knowledgeable and patient. He was friendly but kept the pace brisk, which kept me on my toes throughout the interview.
The interviewer asked to explain the difference between min-heaps and max-heaps. (Learn)
I was asked to demonstrate how min-heaps always give the smallest value in the data structure, while max-heaps return the greatest value.
The interviewer gave a follow-up question on what gets swapped when inserting or deleting elements from heaps and how heap property is maintained.
Tip 1:General knowledge of heaps in algorithms (common topic in competitive programming)


The problem involved constructing a balanced binary search tree (BST) from a sorted array.
The middle element of the array should be the root, and the left and right subtrees should be formed by recursively repeating this process for the left and right halves of the array.
Typical algorithm for constructing a balanced BST from sorted data, based on divide-and-conquer strategy
The interviewer gave a problem where the task was to sort a large file (e.g., 100 GB) that exceeds available RAM. (Learn)
I was asked to divide the file into smaller chunks, sort them individually, and then merge them into one sorted output file using pointers.
This is a well-known problem in external sorting, often used in scenarios dealing with large datasets.
Timing: The second round was scheduled for 5 PM in the evening, one week after the first round. It was expected to last around 60 minutes, but the interviewer took a bit longer.
Environment: The interview was conducted online. The environment was professional, and the interviewer was focused and direct.
Significant Activity: The interviewer initially intended to ask one question and spend around 30 minutes on it, but the question took more time as I had to troubleshoot and fix syntax errors during my coding process.
Interviewer: The interviewer was patient and helpful when I faced difficulties. He gave me time to think through the problem and write the code but emphasized clean and efficient coding. By the end of the round, I was able to write the correct code, but I felt that my performance could have been better with more practice.
The problem required implementing a basic singly linked list. (Learn)
I was asked to write the code to create nodes, insert elements, and traverse the list.
The interviewer asked me to handle edge cases like an empty list or a list with a single node.
I defined a Node class with pointers to store data and the next node.
I implemented methods for inserting nodes, traversing the list, and displaying the elements.
I managed edge cases by checking for null conditions and updating the head pointer appropriately.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?