Tip 1 : Sharpen your Computer Science fundamentals for interviews.
Tip 2 : Practice a lot of data structure questions from easy to medium.
Tip 3 : Make at least 2 good projects to mention on your resume on the tech stack you like.
Tip 1 : Mention your coding profile in which you practice.
Tip 2 : Mention your Projects and achievements.
Tip 3 : Keep your resume clear and concise and Be honest.
Easy to medium level Data Structures and Algorithm questions. Questions related to Operating Systems, Database Management Systems, Computer Networks may also be asked. It is important for candidates to be very good at Computer Science Fundamentals in order to ace this interview.



If the given array is [4, 2, 9] then you should print "3 5 6 7 8". As all these elements lie in the range but not present in the array.
Tip 1 : The length of the array is n-1. So, the sum of all n elements i.e. sum of numbers from 1 to n can be calculated using the formula n*(n+1)/2. Now find the sum of all the elements in the array and subtract it from the sum of the first n natural numbers, it will give us the value of the missing element.
SQL query to find second highest salary.
Tip 1 : gO THROUGH BASIC concepts of sql and their syntax
He asked me questions on python fundamentals like, difference between Set, List, Tuple, Dictionary. Questions on lambda functions.
Questions on Agile Methodology.
Question on Azure DevOps portal. What is cloud computing.



‘S’ = racecar
The reverse of ‘S’ is: racecar
Since ‘S’ is equal to its reverse. So ‘S’ is a palindrome.
Hence output will be 1.
1. Take a string from the user.
2. Pass the string as an argument to a recursive function.
3. In the function, if the length of the string is less than 1, return True.
4. If the last letter is equal to the first letter, recursively call the function with the argument as the sliced list with the first character and last character removed else return False.
5. Use an if statement if check if the returned value is True of False and print the final result.
6. Exit.

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