Tip 1 : Proficient in atleast 1 object oriented language
Tip 2 : Have clear fundamentals of OOPS and Data Structures
Tip 3 : Understand the basic working of the OS, especially Multi Threading
Tip 1 : Single Page
Tip 2 : Keep it focused on your previous work (experience/project)
Can be completed anytime between the specified dates.



F(n) = F(n-1) + F(n-2),
Where, F(1) = F(2) = 1.
For ‘N’ = 5, the output will be 5.
Step 1 - Take 2 variables and store the first 2 numbers of the fibonacci series
Step 2 - Write a recursive function to go to the N-th fibonacci number and store the N-th and (N-1) fibonacci term in the above mentioned variables
Step 3 - Start subtracting from those two numbers and keep printing it until you reach 0
Space Complexity - O(1)
Time Complexity - O(N)
Timing was from 12PM-1PM over a zoom call.
The interviewer was knowledgeable and very well spoken and put me at ease.
Return the record with the 2nd highest salary of the employee table
Tip 1 : Learn the SQL syntax
Tip 2 : Learn about aggregation functions
Tip 3 : Look into order by, limit and offset functions

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
How do you remove whitespace from the start of a string?