Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.
Tip 1 : Add projects and Internships if you have done any and add only those things which you really know.
The round consisted of mcqs and 1 coding question.
Topics: Trees(5), semaphores(3), deadlocks(5) and algorithms(6)
I simply used hashing to solve this problem by checking the frequency of characters in both strings.
I have done this question earlier so just use already built algorithm which traverses the number from the back.
I simply started from 0,0 point and if the robot again reaches to 0,0 point then motion is circular. I explained my whole approach on paper to the interviewer.
Simply gave the interviewer, DFS based approach by visiting adjacent connected components and counting the number of islands. The interviewer was satisfied with my approach.
I told him proper algorithm with code on paper to the interviewer. He asked me to dry run the algorithm which I did by taking an example of stack.
I used Level order approach to solve this question and the interviewer was quite satisfied with my approach and he was happy with my response.
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the result of 4 % 2?