DATA STRUCTURE

ALGORITHM
QUESTIONS

Just simplified my experience here…

@himanshu_shekhar16
Hope it goona help you all…
Save this pdf and thanks me later @himanshushekar
 Adobe Interview Process
1.
Phone Screenings
A phone interview with a hiring manager
If you pass the phone screening, you'll have a phone interview for the first round. A
recruiting manager will go over your résumé in further detail, evaluating your leadership
abilities, problem-solving style, and ability to work as part of a team. Prepare to talk about
previous projects you've worked on and describe the process and results.

Technical assessment
Successful candidates will be sent a link to an online technical assessment with up to 65
questions divided into two sections:
o Aptitude and logic (45 questions, with 45 minutes to complete)
o Technical and Coding (15-20 questions, with 75-120 minutes to complete)
o

Onsite Interview
2. Because the whole worldwide workforce is working from home during the pandemic,
Adobe's final-round interviews are being conducted remotely. A typical onsite includes
lodging, daily meal reimbursement, and transportation to headquarters.

These interviews are typically lengthier than off site interviews. Expect 6-8 hours of back-
to-back sessions lasting around 45 minutes each. There will be four rounds of technical
interviews and one final HR round. Each round is an elimination round; if you are
dismissed early, you will not receive an offer.

HR Round
Behavioral and situational interview questions make up the last HR phase. While Adobe
places a premium on cultural fit, behavioural inquiries are often saved for the last round.
They'll want to learn more about you, such as what you value and what kind of employee
you are.
Previously Asked Question

Easy Level

Breadth First Traversal or BFS for a Graph

How to check if two given line segments intersect?

Copy set bits in a range

Count all distinct pairs with difference equal to k

Count Inversions in an array | Set 1 (Using Merge Sort)

Design and Implement Special Stack Data Structure | Added Space Optimized Version

Dynamic Programming | Set 18 (Partition problem)

Equilibrium index of an array

Find length of loop in linked list

Check if a number is Palindrome

Check if a given Binary Tree is SumTree

Count pairs (a, b) whose sum of cubes is N (a^3 + b^3 = N)

Count set bits in an integer

Program for Binary To Decimal Conversion

QuickSort
Find the middle of a given linked list in C and Java

Write an Efficient Function to Convert a Binary Tree into its Mirror Tree

Write one line C function to find whether a no is power of two

Write your own atoi()

Find the Longest Increasing Subsequence in Circular manner

Find the minimum element in a sorted and rotated array

Find next greater number with same set of digits

Implement Stack using Queues

Level order traversal in spiral form

Merge Sort for Linked Lists

Find n'th node from the end of a Linked List

Program for n'th node from the end of a Linked List

Pascal's Triangle

Print Right View of a Binary Tree

Put spaces between words starting with capital letters

Implement Queue using Stacks

Remove duplicates from a sorted linked list

Trapping Rain Water

Write a function to reverse a linked list

Reverse Level Order Traversal

Reverse words in a given string

Root to leaf path sum equal to a given number

Search an element in a sorted and rotated array

Serialize and Deserialize a Binary Tree

Sort a linked list of 0s, 1s and 2s

Sort an array after applying the given equation

Sort an array of 0s, 1s and 2s

Medium Level

A program to check if a binary tree is BST or not

Check if a given array can represent Preorder Traversal of Binary Search Tree

Combinational Sum

Connect nodes at same level

Detect Cycle in a Directed Graph

Detect cycle in an undirected graph

Dynamic Programming | Set 31 (Optimal Strategy for a Game)

Find whether there is path between two cells in matrix

Greedy Algorithms | Set 7 (Dijkstra's shortest path algorithm)

Minimize the maximum difference between the heights

Minimum number of jumps to reach end

Multiply Large Numbers represented as Strings

Nuts & Bolts Problem (Lock & Key problem)

Quickhull Algorithm for Convex Hull

Reverse a Linked List in groups of given size

Given an a

Find length of the largest region in Boolean Matrix

Find next greater number with same set of digits

Find the number of islands | Set 1 (Using DFS)

Find smallest range containing elements from k lists

Find the largest BST subtree in a given Binary Tree | Set 1

Find the largest BST subtree in a given Binary Tree

Maximum difference between node and its ancestor in Binary Tree

Maximum size rectangle binary sub-matrix with all 1s

Maximum size square sub-matrix with all 1s

Merge K sorted linked lists

Merge two BSTs with limited extra space

Merge Overlapping Intervals

Minimum number of jumps to reach end

Minimum Number of Platforms Required for a Railway/Bus Station

 Preparation Tips

1. Before the interview:

o Update your résumé and, in particular, your LinkedIn profile; if possible, include deliverablesand

metrics as real examples of your accomplishments.

o Remember that everything you put on your CV might be used against you, so be sure youknow

what you're doing.

o Spend at least two minutes talking about each point on your resume and mapping your

accomplishments and past experiences to their fundamental values: genuine, extraordinary,

innovative, and involved, as a good practise.

2. For the Interview:

o It's advisable not to try to memorise certain questions, in our opinion. There are no silver bullets in

this world.

o Because firms of this size are continually striving to stay ahead of the curve and try new things,

the questions they ask are constantly changing. The types of ques tions you'll be asked will vary

depending on your team and the hiring manager.

o Instead, work your way through the foundations so you can grasp the underlying principles and

confidently respond to even new types of interview questions.

Curated by: Himanshu Shekhar

LinkedIn: https://www.linkedin.com/in/himanshushekhar16/