Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
This is Very Technical Round asked questions on Data structures and my college subjects like dbms and OS

T(N) = 3N + 2, where N is a positive integer starting from 1. Your task is to print the first x terms of this series, but you should exclude any term that is a multiple of 4.
Approach :
1) Declare a temporary array/list variable ‘ANS’ in which we store our answer.
2) Declare a temporary variable ‘GOT’ that will store the total number of elements we obtained until now, which are acceptable.
3) Declare a temporary variable ‘CURRENT’ that will store the current number of series 3 * ‘N’ + 2 and initialize with the first number of series 5.
4) Run a loop while ‘GOT’ is not equal to ‘X’:
4.1) If ‘CURRENT’ is not divisible by 4, we will append the value at the end of ‘ANS’ and increment the value of ‘GOT’ by 1.
4.2) Increment the value of ‘CURRENT’ by three as the next value of the series.
5) Finally, return ‘ANS’.


1. If the list is empty, the function immediately returns None because there is no middle node to find.
2. If the list has only one node, then the only node in the list is trivially the middle node, and the function returns that node.
This is again technical Round , Now interviewer asked me about more on my college projects and some little bit technical questions
Explain Piping in Unix/Linux.
This is a cultural fitment testing round .HR was very frank and asked standard questions. Then we discussed about my role.
Why do you want to join us?
Where do you see yourself in 5-10 years?

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