Tip 1: Practice data Structures every day.
Tip 2: Work on a real-time project.
Tip 3: Focus on small targets, not go from 0 to 100. Go from 0 to 10 and then continue.
Tip 1: Make your resume simple and put only useful content and skills in which you are perfect. Don't lie.
Tip 2: Add your top project with a brief intro and also provide their git link.
I was a little nervous but the interviewer was good he made me feel comfortable rest all was a goal he started with an introduction and asked about projects then tested my programming language knowledge (java) in the end there was one coding question.




1. Make in-place changes, that is, modify the nodes given a binary tree to get the required mirror tree.
Step 1: Understand the problem
Step 2: Define the data structure
Step 3: Implement the preorder mirror traversal function\
Check if the current node is null. If so, return.
Swap the left and right child nodes of the current node.
Print or process the value of the current node.
Recursively call the function on the left and right child nodes (the swapped nodes).
Step 4: Test the solution
a=123
b=123
System.out.println(a==b);
The code assigns the value 123 to variable a, then assigns the value of a to variable b. Finally, it prints the comparison result a == b, which is true because both variables hold the same value.



Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
Step 1: Initialize three Variables to store a count of 0,1,2
Step 2: Count the frequency of the Elements
Step 3: Modify the Array based on their frequency.
Step 4:Return the Sorted Array
This time, I was confident before the interview started, but later, I got stuck in some theory questions, due to which my confidence went straight down, later, I somehow managed it, and the interview went well.



Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.
2. Open brackets must be closed in the correct order.
()()()() is a valid parentheses.
)()()( is not a valid parentheses.
Step 1: Understand the problem
Step 2: Define the algorithm
Step 3: Write code for the same
If the character is an opening bracket (such as '(', '[', or '{'), push it onto the stack.
If the character is a closing bracket (')', ']', or '}'), check if the stack is empty. If it is, or if the top of the stack does not match the current closing bracket, return false since the brackets are not in the correct order.
If the top of the stack matches the current closing bracket, pop the top element from the stack and continue iterating.
Step 4:Test the solution
What is an interface? (Learn)
Can you call the base class method without creating an instance? (Learn)
We can do the static method.
What is a finally block? (Learn)
It was a call from HR, mainly about whether I could manage the role and discussing some of my weaknesses and strengths from the interview.
1. What are your strengths and weaknesses?
2. Do you think you'll be able to manage this role?

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