• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Adobe Interview Questions 8 month Exp

March 19, 2014 by Dhaval Dave

Adobe Interview Questions Set 1

For Experience : 8 months
 
First Round :
Held on interview street Aptitude + Technical (standard pattern and questions)
Check Questions : Adobe C,Aptitude Written Questions Answers

Second Round (f2f): 
Interview Question 1 : Started of with the discussion of trees, Type of Trees and their characteristics, performance etc.
Coding Question : Implement insertion in Binary Tree in Java.
For Solution check :Binary Tree in Java
Interview Question 2 : Discussion on projects.
Search time complexity in Binary Search Tree, Ternary tree etc
In depth discussion over Link List v/s BST etc
Answer :Difference between Linked List and Binary Tree
 
Third Round (f2f):
Interview Question 1: Implement a generic binary search algorithm i.e. the input array may contain int, double or structure values.
Answer : Click Here
Interview Question : 2 How does strtok() works. How can you make it thread safe.
Given an array, find number of pairs which equal to a given sum.
Answer : Given an array A[] and a number x, check for pair in A[] with sum as x
Interview Question : 3 : Question on Singleton pattern.
Most IMP : Study and Understand all Design Patterns properly for  all interviews

 Read : Best Java Books 

Best Book to understand all design pattern for Game, App Design, Data base design and Java Programmers is  :

 
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.
Answer : Click Here
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.
Answer : Click Here

Tips to crack Adobe Interview Questions

I was searching and suggesting people for best sites to get tips and tricks to crack for coding interviews, Where I found very good this material
1. Interview Cake :
Its nominal paid service, but very helpful to crack latest interview questions of any company. We particularly focus on Algorithm and Data Strucutre and easiest programming language like Python,C++ . I would recommend must buy Program.
2. Books

Best Interview Preparation books :

When I was preparing for Adobe and Amazon, I have read several book, sites and blogs to prepare for, out which best site, I have already recommended to you guys.There are plenty of books available for Coding interview, out of which I liked these three at best.

a) Data Structures and Algorithms Made Easy: Data Structures and Algorithmic Puzzles, Fifth Edition ( Ex. Amazon, Microsoft and My Friend) : This book is best for college grads, As this book starts with simple basic fundamentals of data structure and algorithm, and gradually very good and tough questions with explanation this book covers, so basically after completing this book You can think how to use and modify any existing data structure and algorithm for your question.
b) Cracking the Coding interview by Gayle Laakmann McDowell this book is for good coders and for those who understand reuse of exiting data structure properly, This book contains best logical and complex questions on Data Structure and Algorithm.

c) How Would You Move Mount Fuji?: Microsoft’s Cult of the Puzzle — How the World’s Smartest Companies Select the Most Creative Thinkers : This book covers all good puzzles that can be asked as part of interview, when Interviewer wants to see your thinking ability.
3. Interview Tips and Tricks Videos  : If you want to get some more Idea about Process and questions, tips and tricks of Adobe Interview Please visit video below.

 

If you want to share such question , solution  or your experience of any company, Please do share at admin@gohired.in , As sharing is caring
-IF YOU LIKE OUR EFFORT, PLEASE LIKE AND SHARE OUR FB-PAGE AND SITE

Similar Articles

Filed Under: Adobe Interview Questions, Interview Experience

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

strtok()

ADOBE Aptitude C Language Test

Introduction To Number Theory ( Part 1 )

Sort an array according to the order defined by another array

TicTacToe Game As Asked in Flipkart

Search element in a matrix with all rows and columns in sorted order

Cisco Hiring Event 21st – 22nd Feb 2015

Get K Max and Delete K Max in stream of incoming integers

Find min element in Sorted Rotated Array (With Duplicates)

Max Sum in circularly situated Values

SAP Off Campus Hiring_ March 2015 Sample Questions

Count number of ways to reach a given score in a game

Sequence Finder Dynamic Programming

Stock Buy Sell to Maximize Profit

Find the number ABCD such that when multipled by 4 gives DCBA.

Minimum insertions to form a palindrome

1014 Practice Question of New GRE – Princeton

How Radix sort works

Handle duplicates in Binary Search Tree

Given array of 0’s and 1’s. All 0’s are coming first followed by 1’s. find the position of first 1

Longest Increasing Subsequence

Hackerearth : Counting Subarrays

Print vertical sum of all the axis in the given binary tree

Leetcode: Edit Distance

Coin Collection Dynamic Programming

Find the kth number with prime factors 3, 5 and 7

Get Minimum element in O(1) from input numbers or Stack

Binary Tree Isomorphic to each other

Check if an array has duplicate numbers in O(n) time and O(1) space

Sort Stack in place

Copyright © 2025 · Genesis Framework · WordPress · Log in