Tip 1 - Build strong fundamentals in core subjects like DBMS, Operating Systems, and Computer Networks instead of only memorizing interview answers.
Tip 2 - Work on real-world projects using Java, Python, and AI-related tools to develop practical understanding and confidence.
Tip 3 - Practice explaining concepts like REST APIs and system architecture clearly, because communication matters as much as technical knowledge in interviews.
Tip 1: Add 1–2 strong projects that demonstrate real-world skills (backend, APIs, AI) and that you fully understand end-to-end.
Tip 2: Only include skills and technologies that you can confidently explain in depth during interviews.
In this round, I was asked questions on core concepts of OOP, DBMS, and Computer Networks to check my fundamentals. The interviewer also discussed my ML project on diabetic prediction and asked a few questions related to its implementation and approach. Additionally, I was given one medium-level DSA problem to solve.
Timing: Evening around 4 to 5
Environment: Calm and professional, no pressure from interviewer
Interviewer: Friendly and supportive, gave hints when required and focused on understanding my thought process



It is possible for Mr. X to rob the same amount of money by looting two different sets of houses. Just print the maximum possible robbed amount, irrespective of sets of houses robbed.
(i) Given the input array arr[] = {2, 3, 2} the output will be 3 because Mr X cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses. So, he’ll rob only house 2 (money = 3)
(ii) Given the input array arr[] = {1, 2, 3, 1} the output will be 4 because Mr X rob house 1 (money = 1) and then rob house 3 (money = 3).
(iii) Given the input array arr[] = {0} the output will be 0 because Mr. X has got nothing to rob.
Step 1: First, I clarified the problem with the interviewer and explained that since houses are in a circular arrangement, we cannot take both the first and last house together.
Step 2: I broke the problem into two linear cases:
Case 1: Consider houses from index 0 to n-2
Case 2: Consider houses from index 1 to n-1
Step 3: I applied the standard House Robber (DP) approach on both cases, where for each house I decide whether to take it or skip it based on maximum profit.
Step 4: I computed the maximum profit for both cases and returned the maximum of the two results.
Step 5: Finally, I dry-ran the code with sample inputs and explained the time and space complexity to the interviewer.
In this round, I was asked about core Java concepts such as Strings, Streams, and exception handling to evaluate my understanding of the language fundamentals. The interviewer also asked a few DSA-related questions to test problem-solving skills. Additionally, my knowledge of MySQL was discussed, including queries and database concepts. The overall focus was on both theoretical understanding and practical application of concepts.

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?