Tip 1 : Practice at least 250 Questions of DS/Algo
Tip 2 : Do at least 2 application based projects
Tip 3 : Practice questions with optimized approaches
Tip 1 : Have some application-based projects on your resume.
Tip 2: Do not put false things on your resume.
Tip 3 : Projects should crisp and clear
First round was basically resume shortlisting, and around 80% students were rejected through this
This round had questions primarily from Java and Computer Networks followed by a simple coding question and an SQL query


The given linked list is 1 -> 2 -> 3 -> 2-> 1-> NULL.
It is a palindrome linked list because the given linked list has the same order of elements when traversed forwards and backward.
Can you solve the problem in O(N) time complexity and O(1) space complexity iteratively?
Write a query to output the records in which the name starts with P and ends with K.
This question can be solved using like query
Do final, finally and finalize keywords have the same function?
Explain Garbage Collector in Java
What do you know about JIT Compiler?
Compare between TCP and UDP
Define the 4 different layers of the TCP/IP Reference Model
What is the difference between the ipconfig and the ifconfig?
There was a gap of about 2 hours after 1st interview. In this round, I was asked a single coding question followed by some questions from SQL and Java.



The answer could be very large, output answer %(10 ^ 9 + 7).
There are n – 1 way for element 0 (this explains multiplication with n – 1).
Let 0 be placed at index i. There are now two possibilities, depending on whether or not element i is placed at 0 in return.
i is placed at 0: This case is equivalent to solving the problem for n-2 elements as two elements have just swapped their positions.
i is not placed at 0: This case is equivalent to solving the problem for n-1 elements as now there are n-1 elements, n-1 positions and every element has n-2 choices
How can you perform pattern matching in SQL?
%(Percentage sign) – To match zero or more characters.
_ (Underscore) – To match exactly one character.
Write a query to create a duplicate table with and without data present?
CREATE TABLE DuplicateCustomer AS SELECT * FROM Customers;
Implement Singleton class in Java
It can be done using the fact that we can make the constructor private.

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