Tip 1 : Clear the basic concepts of data structure and OOPs.
Tip 2 : Use coding ninja platform and Hackerearth for practice on coding skills.
Tip 3 : Use Geeks For Geeks for interview preparation.
Tip 1: Make your resume short and try to make it of one page only.
Tip 2: Add relevant keywords
* MCQ
* No Negative Marking
* All questions are not compulsory


Check if seat number is valid seat number or not(i.e in range of 1 to 72).
if (seat_number % 8) equals 1 or 4, then berth is a lower berth
if (seat_number % 8) equals 2 or 5, then berth is a middle berth
if (seat_number % 8) equals 3 or 6, then berth is an upper berth
if (seat_number % 8) equals 7, then berth is a side lower berth
if (seat_number % 8) equals 0 then berth is a side upper berth
First they asked me to introduce myself then they started questioning on oops concept from basic to advance level such as inheritance, polymorphism, abstraction, exception handling , STL etc. Next they started questioning on data structures. They asked me the logic of “how to find the middle of a linked list”.
Recursive Solution:
Factorial can be calculated using following recursive formula.
n! = n * (n-1)!
n! = 1 if n = 0 or n = 1
I




A Simple solution is to do the following.
1) Create transpose of given matrix.
2) Check if transpose and given matrices are same or not.

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