Tip 1 : Practice as many variety of Algorithms and DS Questions as you can
Tip 2 : Competitive Programming while not necessary helps a lot.
Tip 3 : Have proper technical knowledge of your internships and projects, if any
Tip 1 : Be brief with the details of the internship
Tip 2 : Write projects only if you can properly explain it technically
The test was divided into three parts:
First was of English/Reasoning Questions
Second was statistical/Logical Questions
Third was Coding round



Step 1: Start a loop at every index of the array
Step 2: At every 1 you encounter, if you haven't already visited, start a dfs to all the neighbouring ones.
Step 3: Increment an index everytime you perform a dfs
It was a face-to-face interview. It happened online because of the ongoing pandemic.
What are deadlocks? What are the necessary conditions for a deadlock?
Tip 1: Be straight to the point
Tip 2: Be very clear with your answer. If you are not completely sure about something, better leave it.
Tip 3: Do not pretend to know the answer. If you do not know, be honest.



Consider if ‘N’ = 4, the Factorial of 4 will be the product of all numbers from 1 to 4, which is 1 * 2 * 3 * 4 = 24. Hence, the answer is 24.
Step 1: Create an array of n numbers and make f[1]= 1
Step 2: Loop though the array from 2-n and make f[I] = I * f[i-1]
This problem was more about the discussion on my Resume, my past Experiences and discussion regarding my Project.
The interviewer asked about my past Experience and how I designed the backend of an app.
Tip 1: Be clean and concise
Tip 2: Do not exaggerate
Tip 3: Explain your work technically.

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