Tip 1: Strengthen core concepts of Data Structures (arrays, strings, basic recursion, sorting, searching) and practice at least 100–150 questions.
Tip 2: Have strong understanding of OOP concepts (encapsulation, inheritance, polymorphism) and be ready to explain them with real examples.
Tip 3: Build at least 1–2 simple projects and practice explaining your logic clearly, as communication matters as much as technical skills.
Tip 1: Keep your resume clear and focused with relevant projects and technologies rather than adding too many unnecessary details.
Tip 2: Be honest about your skills and ensure you can confidently explain everything mentioned in your resume.
The assessment was conducted in the evening from 5:00 PM to 6:00 PM. The overall environment was smooth and well-managed, and the platform worked without any major issues. Since it was an online test, it required a stable internet connection and a quiet environment.
The test was divided into four sections: Aptitude, Verbal Ability, Conceptual Computer Science, and Programming Skills. Each section had a strict time limit, so time management was very important. The questions were moderate in difficulty and required a clear understanding of basic concepts. There was no interviewer interaction during this round as it was an automated online assessment.



Input: 'arr' = [1, 2, 7, -4, 3, 2, -10, 9, 1]
Output: 11
Explanation: The subarray yielding the maximum sum is [1, 2, 7, -4, 3, 2].
Step 1: I first understood the problem and thought of a brute-force approach where I would check all possible subarrays and calculate their sums. However, I realized this would take O(n²) time, which is not efficient.
Step 2: Then I recalled an optimized approach using Kadane’s Algorithm, which works in linear time. The idea is to keep track of the current subarray sum and reset it whenever it becomes negative.
Step 3: I initialized two variables – currentSum and maxSum. I iterated through the array, adding each element to currentSum.
Step 4: If currentSum became greater than maxSum, I updated maxSum. If currentSum dropped below zero, I reset it to zero because a negative sum would not help in maximizing the result.
Step 5: After completing the iteration, maxSum contained the maximum subarray sum, which I returned as the final answer.
The interview round was conducted during the daytime in a virtual mode. The environment was smooth and professional, and the interviewer was friendly and supportive throughout the discussion.
The interviewer focused mainly on core Computer Science concepts, especially Object-Oriented Programming. Questions were asked on concepts like inheritance, polymorphism. The interviewer also checked my understanding by asking me to explain these concepts with examples.
Apart from theoretical questions, I was also given a coding problem to test my problem-solving skills. The interviewer guided me during the discussion and was interested in understanding my approach rather than just the final answer. Overall, it was an interactive and knowledge-based interview experience.



‘ARR1’ = [3 6 9 0 0]
‘ARR2’ = [4 10]
After merging the ‘ARR1’ and ‘ARR2’ in ‘ARR1’.
‘ARR1’ = [3 4 6 9 10]
Step 1: I first understood the problem and initially thought of a simple approach where I could combine both arrays into one and then sort the final array. However, I realized this would increase the time complexity to O((n+m) log(n+m)).
Step 2: Then I moved to an optimized approach using the two-pointer technique since both arrays were already sorted.
Step 3: I initialized two pointers, one for each array, starting from index 0. I compared the elements at both pointers.
Step 4: I added the smaller element to the result array and moved the corresponding pointer forward. This ensured the merged array remained sorted.
Step 5: I continued this process until one of the arrays was completely traversed.
Step 6: Finally, I added the remaining elements from the other array to the result array.
Step 7: This approach reduced the time complexity to O(n + m), and the interviewer was satisfied with the optimized solution.
Explain access modifiers in C++. (Learn)
This round was an HR interview conducted in a virtual mode. The timing was during the daytime, and the overall environment was comfortable and professional. The interviewer was friendly and made the conversation easy to follow.
The discussion mainly focused on my background, especially my college projects. I was asked to explain my project, my role in it, and the technologies I used. The interviewer was interested in understanding my involvement and how well I could explain my work.
Additionally, I was asked general HR questions to understand my career goals and aspirations. The round was more about evaluating communication skills, confidence, and clarity of thought rather than technical depth.
Tip 1: I explained my college project in a structured way by covering the problem statement, my contribution, the technologies used, and the outcome. I focused on being clear and confident while explaining.
Tip 2: For the 5-year goal question, I gave a realistic and growth-oriented answer, aligning my personal goals with the company’s growth. I avoided overstatements and kept my answer practical.
Tip 3: Overall, I ensured that my communication was clear, concise, and confident, as HR rounds mainly evaluate personality and attitude.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which data structure is used to implement a DFS?