Tip 1 : Practice Atleast 300 questions on leetcode
Tip 2 : Solve DSA sheets
Tip 3 : Make atleast 2 projects
Tip 1 : Links of projects and profiles should be given
Tip 2 : Single page resume preferred
It was Mcq based test of 90 minutes which tested core computer science topics ,DSA topics like LinkedList and puzzles
My interview was scheduled in the afternoon.The interviewer was very friendly and asked about my resume projects.After that she gave me some easy/medium coding questions



If the given string is: STR = "abcde". You have to print the string "edcba".
Try to solve the problem in O(1) space complexity.



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?



Anagrams are defined as words or names that can be formed by rearranging the letters of another word. Such as "spar" can be formed by rearranging letters of "rasp". Hence, "spar" and "rasp" are anagrams.
'triangle' and 'integral'
'listen' and 'silent'
Since it is a binary problem, there is no partial marking. Marks will only be awarded if you get all the test cases correct.
This was the 3rd round of the process and interviewer was bit strict






Input: ‘M’ = 3, 'N' = 4, ‘mat’ = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]], ‘target’ = 8
Output: true
Explanation: The output should be true as '8' exists in the matrix.

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