Adobe

Adobe Software Engineer Onsite Coding Questions

17+ questions from real Adobe Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.

17
Questions
8
Topic Areas
10+
Sources

What does the Adobe Onsite Coding round test?

The Adobe onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.

Top Topics in This Round

Adobe Software Engineer Onsite Coding Questions

Firefly Front-End Interview Experience In-Store Interview The HR will tell you what aspects they'll test when they contact you. It mainly focuses on concepts; just memorize those concepts before the i

Adobe visited our campus for full-time Member of Technical Staff-I (MTS-1)First round consisted of an aptitude test and a coding test.The aptitude test had 45 minutes and ...

Given an array of 2N positive numbers where every number from 1 to N appears exactly twice in the array, find if there is a permutation possible such that for...

LeetCode #49: Group Anagrams. Difficulty: Medium. Topics: Array, Hash Table, String, Sorting. Asked at Adobe in the last 6 months.

#146 LRU Cache

Linked List

LeetCode #146: LRU Cache. Difficulty: Medium. Topics: Hash Table, Linked List, Design, Doubly-Linked List. Asked at Adobe in the last 6 months.

LeetCode #1636: Sort Array by Increasing Frequency. Difficulty: Easy. Topics: Array, Hash Table, Sorting. Asked at Adobe in the last 6 months.

LeetCode #56: Merge Intervals. Difficulty: Medium. Topics: Array, Sorting. Asked at Adobe in the last 6 months.

LeetCode #468: Validate IP Address. Difficulty: Medium. Topics: String. Asked at Adobe in the last 6 months.

LeetCode #5: Longest Palindromic Substring. Difficulty: Medium. Topics: Two Pointers, String, Dynamic Programming. Asked at Adobe in the last 6 months.

#1 Two Sum

Hash Table

LeetCode #1: Two Sum. Difficulty: Easy. Topics: Array, Hash Table. Asked at Adobe in the last 6 months.

#392 Is Subsequence

Dynamic Programming

LeetCode #392: Is Subsequence. Difficulty: Easy. Topics: Two Pointers, String, Dynamic Programming. Asked at Adobe in the last 6 months.

#475 Heaters

Binary Search

LeetCode #475: Heaters. Difficulty: Medium. Topics: Array, Two Pointers, Binary Search, Sorting. Asked at Adobe in the last 6 months.

LeetCode #20: Valid Parentheses. Difficulty: Easy. Topics: String, Stack. Asked at Adobe in the last 6 months.

LeetCode #124: Binary Tree Maximum Path Sum. Difficulty: Hard. Topics: Dynamic Programming, Tree, Depth-First Search, Binary Tree. Asked at Adobe in the last 6 months.

LeetCode #1482: Minimum Number of Days to Make m Bouquets. Difficulty: Medium. Topics: Array, Binary Search. Asked at Adobe in the last 6 months.

LeetCode #983: Minimum Cost For Tickets. Difficulty: Medium. Topics: Array, Dynamic Programming. Asked at Adobe in the last 6 months.

LeetCode #1293: Shortest Path in a Grid with Obstacles Elimination. Difficulty: Hard. Topics: Array, Breadth-First Search, Matrix. Asked at Adobe in the last 6 months.

See All 17 Questions from This Round

Full question text, answer context, and frequency data for subscribers.

Get Access