Tip 1: Make a strong resume.
Tip 2: Make really good and innovative projects based on real-life problems.
Tip 3: Do practice interviews with your friends and seniors; that will help you out.
Tip 1: Make a resume with points and tech-stack that you are comfortable with.
Tip 2: Don't add unnecessary things
online
All the elements in the array are distinct.
Input: arr = [3,4,5,1,2]
Output: 1
Explanation: The original array was [1,2,3,4,5] and it was rotated 3 times.
The diameter of a binary tree is the length of the longest path between any two end nodes in a tree.
The number of edges between two nodes represents the length of the path between them.
Input: Consider the given binary tree:
Output: 6
Explanation:
Nodes in the diameter are highlighted. The length of the diameter, i.e., the path length, is 6.
Similar to the above question, but it was very tricky to understand. So, I would say, be careful while reading the question; don't just assume things. Think about the data structures that would implement with the given constraints. Try to run a few test cases in mind on your algorithm, then proceed with the approach.
Offline face to face
Be confident in your answers, show your motivation, and most importantly, be clear about your fundamentals. It all comes down to fundamentals. Make really good projects because most of the time can be covered in explaining the projects. Also, be ready with a live demo. I showed my projects on my phone, and they were really impressed.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Which SQL keyword removes duplicate records from a result set?