Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

Adobe interview questions – Computer Scientist

  • Difficulty Level : Hard
  • Last Updated : 26 Aug, 2021

First Round

  1. A doubly linked list having exactly one of the node pointing to a random node in list, correct the doubly linked list.
  2. Build a Hashmap like data structure which can scale up and down – interviewer was looking for a method where we dont have to rehash all items in map upon increasing the size, can use consistent hashing with buckets


Second Round

Hey geek! It's time to become a success story instead of reading them. Check out our most renowned DSA Self Paced Course, now at a student-friendly price and become industry ready. And if you are looking for a more complete interview preparation resource, check out Complete Interview Preparation Course that will prepare you for the SDE role of your dreams!

Feeling prepared enough for your interview? Test your skills with our Test Series that will help you prepare for top companies like Amazon, Microsoft, TCS, Wipro, Google and many more!

  1. Difference between Semahore and Mutex, ACID properties
  2. The next larger palindromic number of a given number
  3. Given array of arrivals and departure times, find the max no. of available car at any moment
    Solution : just merge arrivals and departure time in an array and maintain arrival or departure flag for each time, now sort the merged array and for every arrival increase the count, and for every departure decrease the count and maintain max count.


Third Round

  1. there is a circle, A flight with full capacity x can travel upto half way of circle. How many extra flight you would need to help the first flight to complete the circle. You can use as many flight as you want. Any helping flight must have enough fuel to come back to origin i.e a flight can travel only 1/4 of the circle and come back. Flight can go in any direction and can be reused. (answer is 2).
  2. producer and consumer using wait and notify, production ready code.


Fourth Round

  1. current projects, how does kafka work?
  2. spiral printing of matrix
  3. a robot either can climb one step or two step, so, find out how many ways he can climb n step. – f(n) = f(n-1) + f(n-2)
  4. Write database pool class which will make sure connection is acquired and released upon execution of query.
My Personal Notes arrow_drop_up
Recommended Articles
Page :