Adobe Interview Experience for MTS-2

Round 1 : online test (75mins)

    15 apti LR questions
    5 c++ questions
    2 coding questios

  1. Given list of names and votes… output the winner with maximum votes( I used hashmap).
  2. Consider a string, s = “abc”. An alphabetically-ordered sequence of substrings of s would be {“a”, “ab”, “abc”, “b”, “bc”, “c”}. If we reduce this sequence to only those substrings that start with a vowel and end with a consonant, we’re left with {“ab”, “abc”}. The alphabetically first element in this reduced list is “ab”, and the alphabetically last element is “abc”. As a reminder:
    Vowels: a, e, i, o, and u.
    Consonants: b, c, d, f, g, h, j, k, l, m, n, p, q, r, s, t, v, w, x, y, and z.

    Complete the findSubstrings function in your editor. It has 1 parameter: a string, s, consisting of lowercase English letters (a ? z). The function must find the substrings of s that start with a vowel and end with a consonant, then print the alphabetically first and alphabetically last of these substrings.

    Input Format
    The locked stub code in your editor reads a single string, s, from stdin and passes it to your function.

    Constraints
    3 ? length of s ? 5 × 105

    Output Format
    Your function must print two lines of output denoting the alphabetically first and last substrings of s that start with a vowel and end with a consonant. Print the alphabetically first qualifying substring on the first line, and the alphabetically last qualifying substring on the second line.

    Sample Input 1
    aba
    
    Sample Output 1
    ab
    ab

Round 2 : (technical)

    Intro and company projects

  1. Reverse a stack without using other stack(code it)
  2. Connect all nodes at same level tree(code it)
  3. Difference between semaphores and mutex locks
  4. Implement producer consumer using semaphores(proper code)
  5. Temp objects created by complier discussion
  6. Why argument of Constructor is constant(again related to temp objects)
  7. Why destructor needs to be virtual
  8. How to implement virtual constructor
  9. Smart pointer implementation

Round 3 :(technical)

    Intro and company projects

  1. Given an array of positive nos and negative nos bring all negative nos to end of array. (code)
  2. Celebrity problem stack implementation (code)
  3. Egg droping dynamic programming question.
  4. Parking lot high level system design.
  5. Some c++ questions and os questions

Round 4 : (Managerial Round)

    Intro and college and company projects(detail discussion)

    1. what is dll
    2. what is use of driver in system
    3. what happens to private public etc access specifiers when code is complied.
    4. implement a dequeue using 2 stacks(code)
    5. Swap two nodes in a linked list.. dont swap data (code)
    6. Implement isSubstring method using kmp(code)
    7. argument list initialization in C++ (wanted to check the order in which initialization takes place)
    8. Size of union and struct in c++
    9. Given a function foo() that returns integers from 1 to 5 with equal probability, write a function that returns integers from 1 to 7 with equal probability using foo() only. Minimize the number of calls to foo() method. Also, use of any other library function is not allowed and no floating point arithmetic allowed.

    Some other C++ questions were also asked

Round 5: (Director Round)

  1. College and company project.
  2. Why looking for change, why adobe.
  3. Challenging work done so far
  4. Design Nearby app.(more discussion on Data Structure used)
  5. Design tiny URL.

Round 6 : (Team manager)

  1. Company project in detail
  2. College project
  3. Why adobe
  4. Asked about cloud as he was from cloud team
  5. Gave details about kind of work is done in their team.


Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.