Adobe Interview Questions – Data Structures & Algorithms

Course Curriculum

Chapter 1: Best Time to Buy And Sell A Stock – Arrays

Lecture 1: Best Time to Buy And Sell A Stock – Java Solution

Lecture 2: Best Time to Buy And Sell A Stock – Javascript Solution

Lecture 3: Best Time to Buy And Sell A Stock – C++ Solution

Lecture 4: Best Time to Buy And Sell A Stock – Python Solution

Chapter 2: Maximum Sum Subarray – Arrays

Lecture 1: Maximum Sum Subarray – Java Solution

Lecture 2: Maximum Sum Subarray – Javascript Solution

Lecture 3: Maximum Sum Subarray – C++ Solution

Lecture 4: Maximum Sum Subarray – Python Solution

Chapter 3: Product Of Array Except Self – Arrays

Lecture 1: Product Of Array Except Self – Java Solution

Lecture 2: Product Of Array Except Self – Javascript Solution

Lecture 3: Product Of Array Except Self – C++ Solution

Lecture 4: Product Of Array Except Self – Python Solution

Chapter 4: Trapping Rain Water – Arrays

Lecture 1: Trapping Rain Water – Java Solution

Lecture 2: Trapping Rain Water – Javascript Solution

Lecture 3: Trapping Rain Water – C++ Solution

Lecture 4: Trapping Rain Water – Python Solution

Chapter 5: Search Insert Position – Sorting

Lecture 1: Search Insert Position – Java Solution

Lecture 2: Search Insert Position – Javascript Solution

Lecture 3: Search Insert Position – C++ Solution

Lecture 4: Search Insert Position – Python Solution

Chapter 6: Group Anagrams – Sorting

Lecture 1: Group Anagrams – Java Solution

Lecture 2: Group Anagrams – Javascript Solution

Lecture 3: Group Anagrams – C++ Solution

Lecture 4: Group Anagrams – Python Solution

Chapter 7: Sort Colors – Sorting

Lecture 1: Sort Colors – Java Solution

Lecture 2: Sort Colors – Javascript Solution

Lecture 3: Sort Colors – C++ Solution

Lecture 4: Sort Colors – Python Solution

Chapter 8: Longest Substring Without Repeating Characters – Sliding Window Method

Lecture 1: Longest Substring Without Repeating Characters – Java Solution

Lecture 2: Longest Substring Without Repeating Characters – Javascript Solution

Lecture 3: Longest Substring Without Repeating Characters – C++ Solution

Lecture 4: Longest Substring Without Repeating Characters – Python Solution

Chapter 9: Add Two Numbers – Linked List

Lecture 1: Add Two Numbers – Java Solution

Lecture 2: Add Two Numbers – Javascript Solution

Lecture 3: Add Two Numbers – C++ Solution

Lecture 4: Add Two Numbers – Python Solution

Chapter 10: Find Middle Of The Linked List – Linked List

Lecture 1: Find Middle Of The Linked List – Java Solution

Lecture 2: Find Middle Of The Linked List – Javascript Solution

Lecture 3: Find Middle Of The Linked List – C++ Solution

Lecture 4: Find Middle Of The Linked List – Python Solution

Chapter 11: Intersection Of Two Linked Lists – Linked List

Lecture 1: Intersection Of Two Linked Lists – Java Solution

Lecture 2: Intersection Of Two Linked Lists – Javascript Solution

Lecture 3: Intersection Of Two Linked Lists – C++ Solution

Lecture 4: Intersection Of Two Linked Lists – Python Solution

Chapter 12: Reverse Linked List – Linked List

Lecture 1: Reverse Linked List – Java Solution

Lecture 2: Reverse Linked List – Javascript Solution

Lecture 3: Reverse Linked List – C++ Solution

Lecture 4: Reverse Linked List – Python Solution

Chapter 13: Merge Intervals – Stacks

Lecture 1: Merge Intervals – Java Solution

Lecture 2: Merge Intervals – Javascript Solution

Lecture 3: Merge Intervals – C++ Solution

Lecture 4: Merge Intervals – Python Solution

Chapter 14: Valid Paranthesis – Stacks

Lecture 1: Valid Paranthesis – Java Solution

Lecture 2: Valid Paranthesis – Javascript Solution

Lecture 3: Valid Paranthesis – C++ Solution

Lecture 4: Valid Paranthesis – Python Solution

Chapter 15: Three Sum – Hash Table

Lecture 1: Three Sum – Java Solution

Lecture 2: Three Sum – Javascript Solution

Lecture 3: Three Sum – C++ Solution

Lecture 4: Three Sum – Python Solution

Chapter 16: Binary Tree InOrder Traversal – Binary Trees

Lecture 1: Binary Tree InOrder Traversal – Java Solution

Lecture 2: Binary Tree InOrder Traversal – Javascript Solution

Lecture 3: Binary Tree InOrder Traversal – C++ Solution

Lecture 4: Binary Tree InOrder Traversal – Python Solution

Chapter 17: Symmetric Tree – Binary Trees

Lecture 1: Symmetric Tree – Java Solution

Lecture 2: Symmetric Tree – Javascript Solution

Lecture 3: Symmetric Tree – C++ Solution

Lecture 4: Symmetric Tree – Python Solution

Chapter 18: Kth Largest Element In An Array – Heaps

Lecture 1: Kth Largest Element In An Array – Java Solution

Lecture 2: Kth Largest Element In An Array – Javascript Solution

Lecture 3: Kth Largest Element In An Array – C++ Solution

Lecture 4: Kth Largest Element In An Array – Python Solution

Chapter 19: Coin Change – Dynamic Programming

Lecture 1: Coin Change – Java Solution

Lecture 2: Coin Change – Javascript Solution

Lecture 3: Coin Change – C++ Solution

Lecture 4: Coin Change – Python Solution

Chapter 20: House Robber – Dynamic Programming

Lecture 1: House Robber – Java Solution

Lecture 2: House Robber – Javascript Solution

Lecture 3: House Robber – C++ Solution

Lecture 4: House Robber – Python Solution