Tip 1 : Ist round is machine coding round and that plays crucial role in your selection. Practice as much as you can for this round.
Tip 2 : Do practice for time & space complexities as well
Tip 3 : Do company wise preparation.
Tip 1 : Try to maintain single page resume.
Tip 2 : Focus on skills, projects and work experience.
It was online coding round in which you have to solve 2 problems in approximately 70 minutes,
Timings was flexible.



You are given ‘N’ items with certain ‘PROFIT’ and ‘WEIGHT’ and a knapsack with weight capacity ‘W’. You need to fill the knapsack with the items in such a way that you get the maximum profit. You are allowed to take one item multiple times.
It is a very famous problem. I had solved it earlier. So, it was easy to solve



f(n)= max( An + f(n-2) , f(n-1) )
This is a recursive formula which we can implement through simple recursion but here the time complexity will be O(2^n). Therefore we will use dynamic programming approach and store the intermediate results in an array.
After calculating we will return the value stored at nth(last) index in array.
It was pure DSA Round



You have given a Singly linkedlist. Your task is to reverse that linkedlist with the help of recursion
Used recursion to reverse the linked list



• The left subtree of a node contains only nodes with data less than and equal to the node’s data.
• The right subtree of a node contains only nodes with data greater than and equal to the node’s data.
• Both the left and right subtrees must also be partial binary search trees.

Level 1:
All the nodes in the left subtree of 4 (2, 1, 3) are smaller
than 4, all the nodes in the right subtree of the 4 (5) are
larger than 4.
Level 2 :
For node 2:
All the nodes in the left subtree of 2 (1) are smaller than
2, all the nodes in the right subtree of the 2 (3) are larger than 2.
For node 5:
The left and right subtree for node 5 is empty.
Level 3:
For node 1:
The left and right subtree for node 1 are empty.
For node 3:
The left and right subtree for node 3 are empty.
Because all the nodes follow the property of a Partial binary
search tree, the above tree is a Partial binary search tree.
This Round basically consists from your core Engineering Subjects like networking , OS and DBMS
A counting semaphore S is initialized to 10. Then, 6 P operations and 4 V operations are performed on S. What is the final value of S?
Tip 1 : Read DBMS concepts carefully
Tip 2 : Practice MySQL Queries
It was hiring managerial round. Totally focused on Your Soft Skills
Tip 1 : Stay Positive
Tip 2 : Show them that you are willing to work with them

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