Amazon Interview Prep: Data Structures & Algorithms

Course Curriculum

Chapter 1: Easy Problems

Lecture 1: Best Time To Buy And Sell Stocks

Lecture 2: Move Zeroes

Lecture 3: Majority Element

Lecture 4: Linked List Cycle

Lecture 5: Contains Duplicate

Lecture 6: Valid Anagram

Lecture 7: Valid Parenthesis

Lecture 8: Diameter Of Binary Tree

Lecture 9: Maximum Depth Of Binary Tree

Lecture 10: Climbing Stairs

Lecture 11: Min Cost Climbing Stairs

Lecture 12: Number Of 1 Bits

Lecture 13: Missing Number

Lecture 14: Single Number

Lecture 15: Find Middle Of Linked List

Lecture 16: Palindrome Linked Lists

Lecture 17: Reverse Linked List

Lecture 18: Search Insert Position

Lecture 19: Binary Tree InOrder Traversal

Lecture 20: Invert Binary Tree

Lecture 21: Symmetric Tree

Lecture 22: Path Sum

Chapter 2: Medium Problems

Lecture 1: Maximum Sum Subarray

Lecture 2: Maximum Product Subarray

Lecture 3: Add Two Numbers

Lecture 4: Linked List Cycle II

Lecture 5: Intersection Of Two Linked Lists

Lecture 6: Min Stack

Lecture 7: Minimum Add To Make Parenthesis Valid

Lecture 8: Group Anagrams

Lecture 9: Longest Consecutive Sequence

Lecture 10: Kth Largest Element In An Array

Lecture 11: Kth Smallest Element In BST

Lecture 12: Jump Game

Lecture 13: House Robber

Lecture 14: House Robber II

Lecture 15: Coin Change

Lecture 16: Longest Increasing Subsequence

Lecture 17: 0 1 Matrix

Lecture 18: Course Schedule

Lecture 19: Flood Fill

Lecture 20: Network Delay Time

Lecture 21: Combination Sum

Lecture 22: Product Of Arrays Except Self

Lecture 23: Rotate Array

Lecture 24: Sort Colors

Lecture 25: Find the Duplicate Number

Lecture 26: Three Sum – Hash Table

Lecture 27: Search In A Rotated Sorted Array

Lecture 28: Two Sum II – Input Array Is Sorted

Lecture 29: Magnetic Force Between Two Balls

Lecture 30: Binary Tree Level Order Traversal

Lecture 31: Longest Common Subsequence

Lecture 32: Longest Substring Without Repeating Characters

Lecture 33: Partition Equal Subset Sum

Lecture 34: Target Sum

Lecture 35: Number Of Islands

Lecture 36: Surrounded Regions

Lecture 37: Subsets

Lecture 38: Longest Palindromic Substring

Lecture 39: Decode Ways

Lecture 40: Set Matrix Zeroes

Lecture 41: Spiral Matrix

Lecture 42: Validate Binary Search Tree

Lecture 43: Valid Sudoku

Chapter 3: Hard Problems

Lecture 1: Trapping Rain Water

Lecture 2: Sliding Window Maximum

Lecture 3: Find Median from Data Stream

Chapter 4: 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 5: Two Sum – Hash Table

Lecture 1: Two Sum – Java Solution

Lecture 2: Two Sum – Javascript Solution

Lecture 3: Two Sum – C++ Solution

Lecture 4: Two Sum – Python Solution

Chapter 6: Find First And Last Position Of Element In Sorted Array – Binary Search

Lecture 1: Find First And Last Position Of Element In Sorted Array – Java Solution

Lecture 2: Find First And Last Position Of Element In Sorted Array – Javascript Solution

Lecture 3: Find First And Last Position Of Element In Sorted Array – C++ Solution

Lecture 4: Find First And Last Position Of Element In Sorted Array – Python Solution

Chapter 7: Lowest Common Ancestor of a Binary Tree – Trees

Lecture 1: Lowest Common Ancestor of a Binary Tree – Java Solution

Lecture 2: Lowest Common Ancestor of a Binary Tree – Javascript Solution

Lecture 3: Lowest Common Ancestor of a Binary Tree – C++ Solution

Lecture 4: Lowest Common Ancestor of a Binary Tree – Python Solution