Tip 1 : Do 2 projects.
Tip 2 : Practice data structures programs.
Tip 3 : Take a course on Coding Ninjas.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
Timing was 9: 30 AM. Platform was quite good and easy to understand.






Duplicate number is always present in the given array/list.






Timing was 9:30 AM. The interviewer was very nice.



F(n) = F(n - 1) + F(n - 2),
Where, F(1) = 1, F(2) = 1
"Indexing is start from 1"
Input: 6
Output: 8
Explanation: The number is ‘6’ so we have to find the “6th” Fibonacci number.
So by using the given formula of the Fibonacci series, we get the series:
[ 1, 1, 2, 3, 5, 8, 13, 21]
So the “6th” element is “8” hence we get the output.
Write SQL query to find second highest salary from a Table.
Timing was 12 PM. Interviewer was not good.



Given 'S' : abcdg
Then output will be : 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
What is Normalization and 3NF?

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