Tip 1: Master the Fundamentals: Start by understanding the core concepts of Data Structures (arrays, linked lists, stacks, queues, trees, graphs) and Algorithms (sorting, searching, recursion, dynamic programming). Use online resources like Coding Ninjas to strengthen your basics. Without a solid foundation, solving advanced problems will be difficult.
Tip 2: Practice consistently on Coding Platforms: Regularly solve problems on online platforms. Start with easy problems, then move to medium and hard ones. Follow the patterns approach, solve multiple problems of the same type (e.g., sliding window, two-pointer, recursion). Track your progress and learn from mistakes.
Tip 3: Mock Interviews & Time Management: Practice mock interviews on online platforms to get used to solving problems under time constraints. Participate in coding contests to improve speed and accuracy. Learn to communicate your approach clearly, as explaining your thought process is crucial in interviews.
Tip 1: Keep it concise and well-structured.
Tip 2: Showcase projects and achievements.
I was asked 60 MCQs and 2 coding questions. MCQs included questions on Spring Boot, Java, MySQL, and other technologies. It tested my understanding of backend frameworks, database queries, OOP principles, and application development concepts, ensuring a strong technical foundation.



Given a string s, write a program to reverse the order of words and remove extra spaces.
Example:
Input: " Hello World "
Output: "World Hello"
Use split() to break the string into words and reverse them.



Given a binary tree and two nodes, find their lowest common ancestor (LCA) in the Binary Tree.
Example:
Input: root = [3,5,1,6,2,0,8], p = 5, q = 1
Output: 3
Use recursion to find the LCA.
The HR round focused on assessing my communication skills, personality, and cultural fit for the company. It was more of a discussion rather than a technical evaluation.
The final round was a video call interview, where the interviewer assessed my technical knowledge, communication skills, and overall suitability for the role. It was a mix of technical discussions and behavioural questions.
Key Areas Covered:
1. Technical Discussion: Questions on Java, Spring Boot, and MySQL, focusing on real-world application scenarios. A coding problem on DSA (arrays or trees)—I explained my approach and optimized the solution. Discussion about my previous projects, including the challenges I faced and how I solved them.
2. Problem-Solving & Logical Thinking: The interviewer gave a scenario-based problem to test my analytical skills. Asked how I would debug and optimize a slow-running application.



You are given the root of a binary tree. Your task is to write a Java program to determine whether the given binary tree is a Binary Search Tree (BST) or not.
Tips to Solve:
Use recursion to check if each node follows the BST property within a valid range.
Pass minimum and maximum constraints (min, max) while traversing to ensure values stay within valid limits.
If a node violates the range, return false.
If you reach a null node, return true (base case).
Whether in coding, learning, or any skill, small daily improvements lead to long-term mastery. Stay persistent, adapt, and keep challenging yourself.
Write an SQL query to find the second highest salary from an Employees table. (Practice)
Explain ACID properties in the context of MySQL transactions. (Learn)

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