Adobe interviews commonly test problem-solving skills through Data Structures and Algorithms (DSA), along with coding fundamentals and optimization. Practicing questions across important DSA topics helps candidates prepare for coding rounds and technical interviews.
- Covers commonly asked Adobe interview questions across major DSA topics.
- Focuses on Arrays, Strings, Linked Lists, Trees, Graphs, Dynamic Programming, and other important concepts.
Arrays
- Two Sum
- Maximum Sum Subarray
- Maximum Product Subarray
- Product of Array Except Self
- Find Missing Number
- Equilibrium Index of an Array
- Find Peak Element
- Sort Array of 0s, 1s and 2s
- Container With Most Water
- Next Permutation
- Merge Intervals
- Search in Rotated Sorted Array
- Longest Consecutive Sequence
- Maximum Number of Subarrays With Bounded Maximum
Strings
- Check if Two Strings are Anagrams
- Longest Substring Without Repeating Characters
- Longest Common Prefix
- Multiply Large Numbers as Strings
- Reverse Words in a String
- String to Integer (atoi)
- Integer to Roman
- Roman to Integer
- Decode String
- Restore IP Addresses
- Valid Palindrome
- First Unique Character in a String
Linked List
- Reverse a Linked List
- Find Middle of a Linked List
- Nth Node from End of Linked List
- Remove Duplicates from a Sorted Linked List
- Detect Cycle in a Linked List
- Delete Node in a Linked List
- Add Two Numbers
- Reverse Linked List in Groups
- Merge K Sorted Linked Lists
- Copy List with Random Pointer
- Reorder List
- Palindrome Linked List
Stack and Queue
- Valid Parentheses
- Next Greater Element
- Min Stack
- Sliding Window Maximum
- Generate Parentheses
- Daily Temperatures
Hashing
- Check if Two Strings are Anagrams
- Group Anagrams
- Longest Consecutive Sequence
- Top K Frequent Elements
- Subarray Sum Equals K
- Contains Duplicate
Binary Search
- Binary Search
- Find Minimum in Sorted Rotated Array
- Search in Rotated Sorted Array
- Find Peak Element
- Median of Two Sorted Arrays
- Sqrt(x)
- Koko Eating Bananas
- Find K Closest Elements
- Single Element in a Sorted Array
Binary Tree and BST
- Check if Binary Tree is a BST
- Binary Tree Level Order Traversal
- Binary Tree Zigzag Level Order Traversal
- Lowest Common Ancestor of a Binary Tree
- Construct Binary Tree from Preorder and Inorder Traversal
- Construct Binary Tree from Inorder and Postorder Traversal
- Serialize and Deserialize Binary Tree
- Binary Tree Maximum Path Sum
- Diameter of Binary Tree
- Cousins in Binary Tree
- Binary Search Tree Iterator
- Count Complete Tree Nodes
- Boundary of Binary Tree
- Trim a Binary Search Tree
Graph
- Detect Cycle in a Directed Graph
- Number of Islands
- Clone Graph
- Course Schedule
- Word Ladder
- Rotting Oranges
- Minimum Knight Moves
Dynamic Programming
- Climbing Stairs
- House Robber
- Coin Change
- Longest Increasing Subsequence
- Decode Ways
- Unique Paths
- Unique Paths II
- Minimum cost path
- Jump Game
- Jump Game III
- Optimal Strategy for a Game
Trie and Advanced String Problems
Greedy and Intervals
Heap and Priority Queue
- Kth Largest Element in an Array
- Kth Largest Element in a Stream
- Find Median from Data Stream
- Merge K Sorted Lists
- Top K Frequent Elements
- Remove Stones to Minimize the Total
- Last Stone Weight
Matrix
- Spiral Matrix
- Set Matrix Zeroes
- Maximal Square
- Game of Life
- Search a 2D Matrix
- Longest Increasing Path in a Matrix
