Tip 1 : Atleast 200 to 250+ Data Structures and Algorithms Questions
Tip 2 : Thorough with your Projects , Skills , any previous experience etc. mentioned in your resume.
Tip 3 : Practice of Mathematical and Logical Puzzles
Tip 1 : Mention projects which you can explain and defend clearly.
Tip 2 : Resume should always be crisp and clear and should be of 1 page.
Tip 3 : If you do competitive programming , you can put links of your various online platforms profiles
Tip 4 : There should not be any false achievements or false experience mentioned in the resume.
This was the first round and it consisted of 20 MCQs and 2 programming questions.
The test was on HackerEarth platform.
The test was of 2 hours , web-proctored and switching between tabs was not allowed.



str = "ababc"
The longest palindromic substring of "ababc" is "aba", since "aba" is a palindrome and it is the longest substring of length 3 which is a palindrome.
There is another palindromic substring of length 3 is "bab". Since starting index of "aba" is less than "bab", so "aba" is the answer.
Step 1 : I first thought of the naive approach by first considering all the substrings and then check weather it is a palindrome or not and then check weather its length is maximum till now or not. But the complexity of this approach was O(n^3) which can't be executed according to constraints.
Step 2 : Then I thought of another DP approach using gap strategy of first finding palindrome for small length substrings and then use the answer to calculate further.
The complexity of this approach was O(n^2) and I was able to pass all the test cases.



Note: Since the number of ways can be very large, return the answer modulo 1000000007.
N=3

We can climb one step at a time i.e. {(0, 1) ,(1, 2),(2,3)} or we can climb the first two-step and then one step i.e. {(0,2),(1, 3)} or we can climb first one step and then two step i.e. {(0,1), (1,3)}.
Step 1 : The first method I thought uses the technique of recursion to solve the problem. We can easily find the recursive nature in the problem. The person can reach nth stair from either (n-1)th stair or from (n-2)th stair. Hence, for each stair n, we try to find out the number of ways to reach (n-1)th stair and (n-2)th stair and add them to give the answer for the nth stair.
But the complexity for the problem is O(2^n) and I got time limit exceed in some cases.
Step 2 : Then I used the approach of DP which is of O(N) complexity and all the test cases passed.
This was the second round and the interview round. It was all about OOPS concepts , OS and DBMS fundamentals.It was of 45 minutes approximately .
What is Normalization ?
Why it is needed ?
Types of Normalizations and there conditions.
What is Indexing ?
Types of Indexing and the difference between them.
2-3 SQL queries to find the nth largest salary , maximum salary of each department etc.
Difference between primary and unique constraints in SQL.
Tip 1 : Have a thorough knowledge of concepts of DBMS.
Tip 2 : Check out videos for better understandings.
Tip 3 : Practice of SQL queries is must.
What is Deadlock ?
What are the conditions of Deadlock ?
Real life scenarios where deadlock happens.
What is CPU Scheduling?
Round Robin in CPU Scheduling.
What are Semaphores and its applications?
Tip 1 : Have a thorough knowledge of concepts of Operating Systems.
Tip 2 : Check out videos for better understandings.
Real Life Examples of OOPS fundamentals like Abstraction , Encapsulation , Polymorphism , Inheritance.
Difference between Dynamic and Static Polymorphism.
To write a small program which shows how Dynamic Polymorphism work.
How interfaces works and difference between abstract class and interfaces.
Exceptional Handling and some code related questions of Exceptional Handling.
Tip 1 : Have deep knowledge of all OOPS concepts.
Tip 2 : Hands on coding experience of OOPS concepts is a plus.
This was the third round and the round was focused on Projects and Puzzles. It was of 1/2 hour approximately.
My project was based on Machine Learning and the discussion was all about the algorithm of the project , the accuracy ,
and the application of it in real world.
Tip 1 : Have the knowledge of all the concepts you used in your project.
Tip 2 : Know how your project can be used in real-world problems.
1. How do we measure forty-five minutes using two identical wires, each of which takes an hour to burn? The wires burn non-uniformly.
2. Given two hourglass of 4 minutes and 7 minutes, the task is to measure 9 minutes.
It was the last round and was all about HR questions.
Tell me about yourself.
Are you willing to go for higher studies.
What challenges did you face in your life and how did you overcome them?
When have you tried to adapt to a new situation?
Are you a smart worker or a hard worker?
Tip 1 : You should prepare the answers for some of the common questions beforehand and for other questions you should always answer smartly and confidently.

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