Adobe | Mts 2 | Selected | Noida
Recruiter reached out to me and she scheduled interview for next week .
Total there were 4 rounds .
Round 1:
- Find minimum number of jumps needed to reach at last index ,and starting index will be 0 and if you are at ith index you can jump to any index in right side of range of (ar[i]+i ). Later he modified question so now elements in array can be negative as well and in that case we can move left side .(Minumum Jump Array Problem)
- Merge sorted linked lists.
Round 2 :
1)Find anagrams
2)Rotten Oranges
3)25 horse puzzle for which i was able to tell approach only as time was less.
Round 3 :
He asked few theortical questions about languages which i mentioned over resume in which i was able to answer few
Then he asked 2 coding problems
- Find the inorder predecssor in binary tree when TreeNode has (left,right and parent pointer)
- Find the triplet so that a[i]<a[j]<a[k] and i<j<k .
Round 4:
This was hiring manger round ,he asked about past projects and my tech expertise as well my expectations as mts2 from adobe
after long discussion
- He asked me a puzzle which i wasn't able to answer correctly but had almost similar approach .
- Then he asked me a DP (Medium to hard ) level problem which i was able to solve similar like (Wildcard Pattern Matching problem from leetcode).
Overall exeperience was good .
Other Offers:
https://leetcode.com/discuss/interview-experience/2904264/AJIO-or-SDE-2or-Benglaru
https://leetcode.com/discuss/interview-experience/2904302/Et-Money(Times-Group)-or-SE-2-or-Gurgaon
