Tip 1 :Confidence is the key to excel any interview. Practice more questions and build up your confidence level.
Tip 2 :Understand the concepts first behind each algorithm and try to solve around 20-25 questions for each data structure. Practice the data structure portion and read few interview experiences questions
Tip 3 : In an interview, if you get stuck in any question, don't panic. Try to ask about the constraints and cases from the interviewer and extract hints from it. Interviewers usually help you to reach to a solution.
Tip 1: Keep it short and crisp. Utilise one full page wisely to describe yourself. It should not be more than a page.
Tip 2: Focus on the Projects/Work Experience and Achievements Section.
Timing - Test Link is active for 5 days. It can be taken anytime between that window.
It was conducted on Hackerrank.
Duration - 60 mins
Try to quickly solve the coding question first in around 20 mins and give rest of the time to MCQs. MCQs were of medium level.
Practice the MCQs from codezen. 7-8 questions were similar to those on codezen
Timing - 60 mins
Environment - Google Docs shared
The interviewer from Adobe was interactive and helpful throughout the round.
The Linked Lists, where a1, a2, c1, c2, c3 is the first linked list and b1, b2, b3, c1, c2, c3 is the second linked list, merging at node c1.
Simple approach - Use 2 nested loops. The outer loop will be for each node of the 1st list and inner loop will be for 2nd list.
Optimised Approach -
Get count of the nodes in the first list, let count be c1.
Get count of the nodes in the second list, let count be c2.
Get the difference of counts d = abs(c1 – c2)
Now traverse the bigger list from the first node till d nodes so that from here onwards both the lists have equal no of nodes.
Then we can traverse both the lists in parallel till we come across a common node. (Note that getting a common node is done by comparing the address of the nodes)
Tip 1:I had read the OS concepts from the book Galvin.
Tip 2:Try to give real life examples after explaining the concepts.
It was just discussed at the end.
Tip: Practice 15-20 puzzles from codezen and GFG
Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
Suppose list1 is [2, 133, 12, 12], what is max(list1) in Python?