Tip 1: Don't lose confidence if you are unable to solve some DSA questions; keep trying and stay persistent.
Tip 2: Be consistent in practising DSA and make notes of theoretical questions that may be asked by some companies.
Tip 3: Start with easy-level DSA questions and then begin attending interviews. This approach will help open up your mind and give you an understanding of the types of questions being asked.
Tip 1: Keep the skills section clearly at the top, and list the skills that the organization is looking for first, such as Java 8, Microservices, and Spring Boot.
Tip 2: Mention your total experience and contact details. Don't make the HR department calculate your experience based on the time you spent with previous organizations.
This round was around DSA.



Given the root of a binary tree and an integer targetSum, return true if the tree has a root-to-leaf path such that adding up all the values along the path equals targetSum.
It is an easy-level tagged question. I took the approach of adding elements to an ArrayList, and when I encountered a leaf node, I checked whether the sum of the ArrayList was equivalent to the target sum.



We cannot use the element at a given index twice.
Try to do this problem in O(N) time complexity.
It is a simple question, so I didn't have to struggle much. It is an easy-level question. I used a hash map and applied a for loop, in which I checked whether the target minus the current item was present in the hash map. If it was, I found the desired indices; otherwise, I added the element to the hash map. The solution has a time complexity of O(n).
This round is about System Design, in which I explained my current project.
Explain the Object Pool pattern and provide code for it. I tried to solve it by considering a database connection pool, as it typically uses this design pattern, but I was unable to recall the details.

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