Friday, October 10, 2025
HomeData Modelling & AIAdobe Interview Experience | Set 44 (For MTS-1)

Adobe Interview Experience | Set 44 (For MTS-1)

First round was online for 75 minutes on hackerrank.
3 sections: Aptitude,Output and 2 coding questions. Coding questions:

  1. Given a string find alphabetically first and last substrings which start with vowel and end with constant.
    Solution: neveropen Link
  2. Given a set of votes.Find the candidate with maximum number of votes.

There were 3 F2F rounds at Adobe Campus for candidates who cleared the online round

1.F2F Interview:
Asked about projects.

  1. Write a function to generate a string randomly
  2. OS Concepts in Page Tables and Virtual Memory
    Solution: neveropen Link
  3. In a continuous stream of words check if a duplicate word exists or not
  4. The interviewer was very friendly and was giving good directions of help.
    It was easy to clear this round 🙂

2.F2F Interview:

  1. Difference between process and threads
  2. Write a function to calculate x^n with least complexity
    Solution: neveropen Link
  3. Given a stream of words. Write a function to return K maximum frequently occurring words
  4. Check if one string is a rotation of other
    Solution: neveropen Link
  5. What is architecture of AngularJs. I had mentioned angularJs in my resume
  6. Given an array of pairs (Z,A),(A,F),(G,H),(F,G)
    Construct a chained string out the given pairs. Z-A-F-G-H
    The interviewer was expecting answers to the point.
  7. I had cleared the 2nd round too.

3.F2F Interview:

  1. In a DBMS table in Gender Column M and F are exchanged.
    Write a query to correct the column values.
  2. Implement queue using two stacks
    Solution: neveropen Link
  3. This question appears tough to solve but has very easy logic
    Solution: https://www.geeksforgeeks.org/print-all-combinations-of-balanced-parentheses/
  4. I tried my best but could not answer this question.
    All the questions can be answered with simple logic and presence of mind.
    Complicated solutions leave a negative opinion on the interviewer.

Thank you GeeksForGeeks for providing an amazing platform :). A one stop solution for Geeks!!!!

If you like neveropen and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org. See your article appearing on the neveropen main page and help other Geeks.

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!

RELATED ARTICLES

Most Popular

Dominic
32350 POSTS0 COMMENTS
Milvus
87 POSTS0 COMMENTS
Nango Kala
6718 POSTS0 COMMENTS
Nicole Veronica
11880 POSTS0 COMMENTS
Nokonwaba Nkukhwana
11941 POSTS0 COMMENTS
Shaida Kate Naidoo
6838 POSTS0 COMMENTS
Ted Musemwa
7101 POSTS0 COMMENTS
Thapelo Manthata
6794 POSTS0 COMMENTS
Umr Jansen
6794 POSTS0 COMMENTS