Tip 1: Do not take DP and Graphs lightly. They appear in the majority of DSA rounds at product-based companies.
Tip 2: Actively participate in coding contests. They significantly improve problem-solving speed and pattern recognition.
Tip 3: For experienced candidates, investing time in large projects with real impact is crucial, as most companies include a separate round to assess project depth and ownership.
Tip 1: Always include links to your coding profiles in your resume.
Tip 2: Experienced candidates should highlight significant, high-impact projects they have worked on within their organization.
My interview round was scheduled from 4:00–5:00 PM. The first few minutes were spent on basic introductions. This was followed by around 30 minutes of discussion on a project I led at TATA 1mg, during which the interviewer asked several follow-up questions that I was able to answer confidently.
After that, I was given a DSA problem to solve on a Google Sheet, with roughly 25–30 minutes allotted. The problem was graph-based, fell into the medium-to-hard category, and was conceptually similar to Path Sum III. I started by explaining the brute-force approach and then reasoned my way toward a more optimized solution using prefix sums. Due to time constraints, the interviewer asked me to skip writing the complete code and instead focused on follow-up questions. One of them was whether negative node values would affect the solution, which I was able to explain clearly.
Overall, I felt confident throughout the discussion, and the round went well from my side.


i) Nodes considered for the sum should be from parent to child.
ii) For a particular way, you can only consider nodes having the common path.
iii) Two ways are different from each other if they have an unequal number of nodes (for making sum equal to k) or at least one node is different between both the ways.

For the binary tree shown in the figure, the possible ways/paths are [8, 6, -4], [6, -3, 7], and [1, 9] for a sum of nodes equal to 10.
Brute Force Approach:
Optimized Approach:
Instead of recalculating sums for every node, maintain a prefix sum map while traversing the tree and perform a DFS traversal:
The second interview round was scheduled from 4:00–5:00 PM and focused on a deep dive into my projects. I was asked to design and explain the high-level architecture, including how different services interacted with each other within the system.
The discussion then moved to backend fundamentals, where I was asked questions related to caching strategies and distributed locks. This was followed by general system design and database concepts, such as what happens behind the scenes when you type google.com and press Enter, an explanation of various database isolation levels, and the dirty read problem.
Overall, the round was of medium difficulty.
What happens behind the scenes when you type google.com and hit Enter?
What are the various isolation levels? (Learn)
This round primarily focused on behavioral questions and salary discussions. I was asked scenario-based questions, such as how I would handle and resolve conflicts within a team.

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