Round 1: Interviewer asked me to choose one of the topics from programming, DS and algorithms. This was a C++ specific drive so I chose programming.
He asked me to write a program where an array is given and we need to print the elements of array in such a order that we get the highest number. Eg – input (23, 234, 3, 231, 56) output- 56323423231
I solved it but he was smart enough to determine the cases in which my code failed, then he told me to improve my logic.
Next he asked me to write a code to determine the number of steps in which a number would become one based on the following conditions:
If number is odd – n=3n+1 and if number is even – n=n/2
In this he wanted to check how i handle the boundary cases and those cases in which my number is always increasing.
Asked a bit about my current work too.
Feedback was positive.
Asked about my graduation percentage and current project.
He gave me a question where he asked me to create a doubly linked list from leafs of a given binary tree in logn complexity.
After 2-3 attempts I achieved the logn complexity. He seemed to be impressed by my approach.
Next he gave me a question where I was given an array and a window size ‘k’ and I need to tell all max element in the different windows possible. For e.g. Suppose array as 10 elements and window size is 5 then I need to print max in 0-5, 1-6, 2-7, 3-8, 4-9 and 5-10 positions.
I solved it and then he asked me to reduce the complexity. I then used a queue of capacity k, and the same was expected by him.
Asked questions on virtual functions and constructor overloading and some OOPS concepts
Feed back – positive
A rat and poisoned milk bottle puzzle, I solved it in 2nd attempt. He was ok with it
He gave me a tree with elements in sorted order when traversed in a BFS style.
He asked me to write a function which would return the node whose data matches the input value .
I took some time and show him the code I wrote, he was not impressed with my logic and complexity and asked me to optimize, I sort of got stuck.
He then gave me 1 more similar question and asked me to optimize the approach.
Feedback – negative.
- Adobe Interview Experience (Adobe for Women)
- Adobe Interview Experience for MTS-1 (1.5 Years Experience)
- Adobe Interview Experience | Computer Scientist (5 yr Experience)
- Adobe Interview Experience | Set 18 (For WBT Profile)
- Adobe Interview Experience | Set 19 (For MTS)
- Adobe Interview Experience | Set 21 for Software Engineer (Fresher)
- Adobe Interview Experience | Set 22 (On-Campus)
- Adobe Interview Experience | Set 23 (1 Year Experienced)
- Adobe Interview Experience | Set 24 (On-Campus for MTS)
- Adobe Interview Experience | Set 25 (On-Campus for MTS-1)
- Adobe Interview Experience | Set 26 (On-Campus for MTS-1)
- Adobe Interview Experience | Set 27 (On-Campus for Internship)
- Adobe Interview Experience | Set 28 (For MTS-2)
- Adobe Interview Experience | Set 29 ( Off-Campus)
- Adobe Interview Experience | Set 30 (Off-Campus For Member Technical Staff)
- Adobe Interview Experience | Set 31
- Adobe Interview Experience | Set 32 (For MTS-1)
- Adobe Interview Experience | Set 33 (On-Campus)
- Adobe Interview Experience | Set 34 (For MTS-1)
- Adobe Interview Experience | Set 36 (Off-Campus Drive)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.