Tip 1 : Practice SQL and data structure questions of at least 60.
Tip 2 : Learn about Tools that are present in the market (People soft)
Tip 3 : Try to do at least 1 project.
Tip 1 : Include the project.
Tip 2 : Always add skills related to technical things and do not forget to write achievements.
This coding round is not that hard most of the questions are related to a data structure. The environment is good and also the question is not that hard.



The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Can you solve this problem in O(N) time and O(1) space complexity?
Step 1: Create Nodelist()
Step 2:reverselist(), Display list()
Step 3: Input the number of nodes : 3
Input data for node 1: 5
Input data for node 2: 6
Input data for node 3: 7



Input:
‘ARR’ = [-6,-3, 2, 1, 5]
If we take a square of each element then the array/list will become [36, 9, 4, 1, 25].
Then the sorted array/list will be [1, 4, 9, 25, 36].
Output :
[1, 4, 9, 25, 36].
It was a general discussion with HR Related to Salary negotiation, Location, and about company environment.
What is your biggest achievement
why do you want to join the company?
are you ready to relocate to another city?

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