Tip 1 : Prepare DSA well and I personally recommend Coding Ninjas and GeeksForGeeks for interview preparation.
Tip 2 : Be confident & relaxed during the interview.
Tip 3 : Do revise your projects i.e how it works and what are its functionalities.
Tip 1 : Make your resume short and try to make it one page only and mention all the skills that you are confident in.
Tip 2 : Do not put false things on your resume.
In this Assessment had 3 sections which is based on Cognitive Ability, Technical MCQs. and Also had One Easy Coding Question.



By using traversing one by one able to solve this.
In Technical Interviewer asked Project related Questions, OOPS, and DBMS Questions. I had rejected in the interview because they want Immediate Joiner. so that reason I was Rejected.



A sequence a1, a2, .... an is called an alternating sequence if its elements satisfy one of the following relations : a1 < a2 > a3 < a4 > a5..... or a1 > a2 < a3 > a4 < a5.
'ARR' = {3, 10, 1, 2, 30}, the longest alternating subsequence for this array can be {3, 10, 1, 30} or {3, 10, 2, 30}. Therefore, the answer will be 4.
1. Declare two integers inc and dec equal to one
2. Run a loop for i [1, N-1]
If arr[i] is greater than the previous element then set inc equal to dec + 1
else if arr[i] is smaller than the previous element then set dec equal to inc + 1
3. Return the maximum of inc and dec

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