Skip to content
Related Articles

Related Articles

Improve Article
Adobe Interview | Set 8 (Off-Campus)
  • Difficulty Level : Medium
  • Last Updated : 22 May, 2019

Experience : 8 months

First Round :
Held on interview street .Aptitude + technical (standard pattern and questions)

Second Round (f2f):
Started of with the discussion of trees. Like what is a tree/BST ?

Implement insertion in tree (Java).

Discussion on projects.

Search time complexity in BST/ ternary tree.

Link List v/s BST

Third Round (f2f):
Implement a generic binary search algorithm i.e. the input array may contain int, double or structure values.

How does strtok() works. How can you make it thread safe.

Given an array, find number of pairs which equal to a given sum.

Question on singleton pattern.

Fourth Round(f2f) :
A building has n steps. Aperson can take 1,2 or 3 steps. In how many ways can a person reach top of building.

General discussion on cache.

You have a stream of incoming integers. How will you store these numbers and implement following functions : GiveMax(), GiveSecond Max(), Delete Max(), DeleteSecondMax (), Add , Remove an element.

I couldn’t make it beyond this round.However, this was my interview experience.

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready. To complete your preparation from learning a language to DS Algo and many more, please refer Complete Interview Preparation Course. In case you are prepared, test your skills using TCS, Wipro, Amazon and Microsoft Test Serieses.

My Personal Notes arrow_drop_up
Recommended Articles
Page :