Tip 1: Practice DSA consistently and revise important concepts regularly.
Tip 2: Give mock interviews to improve confidence and identify weak areas.
Tip 3: Build at least 2–3 strong projects to showcase practical skills.
Tip 1: Highlight strong projects and clearly explain your contributions.
Tip 2: Keep your resume concise (one page) and include only the skills you are confident about.
The interview was conducted in a calm and professional environment. The interviewer was friendly and focused mainly on my projects and problem-solving ability. The round started with a discussion of the projects mentioned in my resume, especially my Rubik’s Cube Solver and Placement Tracking Platform. The interviewer asked questions related to graph traversal algorithms, such as DFS, BFS, and IDDFS, used in my project.
After the project discussion, the interviewer asked a DSA question and requested me to dry-run it with multiple test cases. The interviewer also asked conceptual questions related to data optimization, indexing, unordered sets, and core OOPs concepts like encapsulation and abstraction. Overall, the interview focused on assessing my fundamentals and practical knowledge from projects.
The interviewer was supportive and encouraged me to explain my thought process clearly.



An array c is a subarray of array d if c can be obtained from d by deletion of several elements from the beginning and several elements from the end.
For e.g.- The non-empty subarrays of an array [1,2,3] will be- [1],[2],[3],[1,2],[2,3],[1,2,3].
If arr = {-3,4,5}.
All the possible non-empty contiguous subarrays of “arr” are {-3}, {4}, {5}, {-3,4}, {4,5} and {-3,4,5}.
The product of these subarrays are -3, 4, 5, -12, 20 and -60 respectively.
The maximum product is 20. Hence, the answer is 20.
Can you solve this in linear time and constant space complexity?
Step 1 : I first carefully understood the problem and identified that the task was to find the maximum product of a contiguous subarray. I realized that negative numbers could flip the product sign, so a simple greedy approach would not work.
Step 2 : I initially thought about checking the product of all possible subarrays, but that would take O(n²) time which is not optimal.
Step 3 : Then I used an optimized approach where I tracked both the maximum product and minimum product at each index, because a negative number can turn the minimum product into the maximum.
Step 4 : While traversing the array, for each element I updated the current maximum and minimum product and kept updating the global maximum product.
Step 5 : Finally, I dry ran the algorithm on multiple test cases including arrays with negative numbers and zeros to verify correctness.
The second round started with a brief introduction. The interviewer asked about the projects mentioned in my resume and which one I was most comfortable explaining. I chose my Placement Tracking Platform project and explained its architecture and features.
The interviewer then asked backend and database-related questions based on my project. I was asked to design a MongoDB schema for the platform and write some related queries. The discussion also included database concepts like normalization and how SQL commands such as LIMIT and OFFSET are internally executed in MySQL.
Later, the interviewer asked system design and backend-related questions, such as how servers handle multiple users accessing them simultaneously and how recommendation systems like Google Search work. Some networking questions, such as HTTP vs HTTPS, JWT authentication, and what happens when we type a URL like google.com in a browser, were also asked.
The interviewer was friendly and mainly evaluated my conceptual understanding and practical knowledge related to backend development and databases.
Tip 1: Know your projects very well. Most interviews start with project discussions, so be ready to explain the architecture, database schema, and design decisions.
Tip 2: Prepare DBMS concepts such as normalization, indexing, schema design, joins, LIMIT/OFFSET, and how databases execute queries internally.
Tip 3: Understand backend fundamentals such as authentication (JWT), handling multiple requests on a server, and API design.
Tip 4: Revise computer network basics such as DNS, HTTP vs HTTPS, what happens when you type a URL, and client-server communication.
Tip 5: Practice explaining concepts clearly with examples, as interviewers often assess how well you communicate technical ideas.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which traversal uses a queue as its primary data structure?