Tip 1 :Practice all standard questions of DSA ( atleast 400 questions)
Tip 2 : Do computer fundamentals like OS,CS,OOPs
Tip 3 :Do atleast 4 projects.
Tip 1: Make it clean with appropriate kowledge.
Tip 2: Provide true information and avoid telling lie in which You are not sure.
It was morning time from 10:00 am to 11:30Am.
All the questions were based on Aptitude and Quant.
Tip 1:Try to solve the aptitude problems in less time.
Tip 2: Never ever skip the quants while preparing for interview.
It was morning time and from 10:00 am . It happened via the google meet online process and it was very smooth onboarding . Interviewer was very friendly kind of nature .



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)}.
int countWays(int n)
{
if(n == 1) return n;
int mod = 1000000000 + 7;
int prev = 2, prev2 = 1, curr = 0;
for(int i = 2 ; i < n ; i++){
curr = (prev + prev2) % mod;
prev2 = prev;
prev = curr;
}
return prev ;
}
It was in afternoon and happened in a very smooth way.
Introduction, Strength and Weakness, Situation based questions.
Tip 1:Try to give answer with the real life.
Tip 2:Give answers in your own language and avoid the bookish language

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