LeetCode in Java: Algorithms Coding Interview Questions

Course Curriculum

Chapter 1: Introduction

Lecture 1: Introduction

Chapter 2: Intergers

Lecture 1: FizzBuzz (LeetCode 412) [Asked by LinkedIn]

Lecture 2: Single Number (LeetCode 136) [Asked by Amazon]

Lecture 3: Palindrome Number (LeetCode 9) [Asked by Facebook/Bloomberg]

Lecture 4: Factorial Trailing Zeroes (LeetCode 172) [Asked by Microsoft]

Lecture 5: Reverse Integer (LeetCode 7) [Asked by Facebook]

Lecture 6: Pow(x, n) (LeetCode 50) [Asked by Facebook/Amazon/LinkedIn]

Lecture 7: Roman to Integer (LeetCode #13) [Asked by Google]

Lecture 8: Integer to Roman (LeetCode #12) [Asked by Amazon]

Chapter 3: Strings

Lecture 1: Reverse String (LeetCode 344) [Asked by MicroSoft/Uber]

Lecture 2: Longest Common Prefix (LeetCode 14) [Asked by Facebook]

Lecture 3: Repeated DNA Sequences (LeetCode 187) [Asked by Google]

Lecture 4: Valid Anagram (LeetCode 242) [Asked by Facebook]

Lecture 5: Longest Palindromic Substring (LeetCode 5) [Asked by Facebook]

Lecture 6: Longest Substring without Repeating Characters (LeetCode 3) [Asked by Google]

Lecture 7: Reverse Words in a String (LeetCode 151) [Asked by Facebook/Amazon]

Lecture 8: Integer to English Words (LeetCode 273) [Facebook, Microsoft]

Chapter 4: Binary Search

Lecture 1: Binary Search (LeetCode 704) [Asked by Infosys,Oracle]

Lecture 2: Search in Rotated Sorted Array (LeetCode 33) [Asked by Facebook]

Lecture 3: Find Minimum in Rotated Sorted Array (LeetCode 153) [Asked by Facebook]

Chapter 5: Arrays

Lecture 1: Two Sum (LeetCode 1) [Asked by Google]

Lecture 2: Move Zeroes (LeetCode 283) [Asked by Facebook]

Lecture 3: Best Time to Buy And Sell Stock(LeetCode 121) [Asked by Facebook/Microsoft]

Lecture 4: Ransom Note (LeetCode 383) [Asked by Amazon]

Lecture 5: Contains Duplicate (LeetCode 217) [Asked by Google]

Lecture 6: Length of Last Word (LeetCode 58) [Asked by Amazon]

Lecture 7: Best Time to Buy and Sell Stock II (LeetCode 122) [Asked by Google]

Lecture 8: Rotate Array (LeetCode 189) [Asked by Microsoft]

Lecture 9: Jump Game (LeetCode 55) [Asked by Google]

Lecture 10: Product of Array Except Self (LeetCode 238) [Asked by Facebook]

Lecture 11: Sequential Digits (LeetCode 1291) [Asked by Facebook]

Lecture 12: Find All Disappeared Numbers in an Array (LeetCode 448) [Asked by Google]

Lecture 13: Find All Duplicates Numbers in an Array (Leetcode 442) [Asked by Facebook]

Lecture 14: First Missing Positive (LeetCode 41) [Asked by Microsoft]

Lecture 15: Next Permutation (LeetCode 31) [Asked by Google]

Lecture 16: Largest Subarray With 0 Sum [Asked by Microsoft]

Lecture 17: Subarray Product Less than K (LeetCode 713) [Asked by Goldman Sachs]

Lecture 18: K-Diff Pairs in an Array (LeetCode 532) [Asked by Amazon]

Chapter 6: Two Pointers

Lecture 1: Two Sum II – Input Array Is Sorted (LeetCode 167) [Asked by Amazon]

Lecture 2: Is Subsequence (LeetCode 392) [Asked by Google]

Lecture 3: Remove Duplicates from Sorted Array (LeetCode 26) [Asked by Facebook/Microsoft]

Lecture 4: Sort Colors (LeetCode 75) [Asked by Facebook]

Lecture 5: Valid Palindrome (LeetCode 125) [Asked by Facebook]

Lecture 6: Merge Sorted Array (LeetCode 88) [Asked by Microsoft]

Lecture 7: 3 Sum (LeetCode 15) [Asked by Facebook]

Chapter 7: Stacks and Queues

Lecture 1: Valid Parentheses (LeetCode 20) [Facebook]

Lecture 2: Asteroid Collisions (LeetCode 735) [Asked by Lyft]

Lecture 3: Longest Valid Parentheses (LeetCode 32) [Asked by Google]

Lecture 4: Decode String (LeetCode 394) [Asked by Google]

Lecture 5: Largest Rectangle in Histogram (LeetCode 84) [Asked by Google]

Chapter 8: Famous Algorithm

Lecture 1: Kaden's Algorithm (Maximum Subarray :: LeetCode 53) [Asked by Google]

Lecture 2: Boyer-Moore Voting Algorithm (Majority Element- LeetCode 169) [Asked by Amazon]

Chapter 9: Sorting Algorithms

Lecture 1: Merge Sort Algorithm [Asked by Amazon, Microsoft]

Lecture 2: Count Inversions — Using Merge Sort [Asked by Amazon, Microsoft]

Lecture 3: Quick Sort Algorithm [Asked by Amazon, Microsoft]

Lecture 4: Kth Largest/Smallest — Quick Select (LeetCode 215) [Asked by Google, Microsoft]

Lecture 5: [OLD] Quick Sort ::Sort an Array (LeetCode 912)

Chapter 10: 2D Arrays / Matrix

Lecture 1: Set Matrix Zeroes (LeetCode 73) [Asked by Facebook]

Lecture 2: Range Sum Query 2D – Immutable (LeetCode 304) [Asked by Amazon]

Lecture 3: Where Will the Ball Fall (LeetCode 1706) [Asked by Amzon]

Lecture 4: Rotate Image (LeetCode 48) [Asked by Microsoft]

Chapter 11: Linked List

Lecture 1: Middle of the Linked List (LeetCode 876) [Asked by Microsoft]

Lecture 2: Delete Node in a Linked List (LeetCode 237) [Asked by Amazon,Microsoft]

Lecture 3: Merge Two Sorted Lists (LeetCode 21) [Asked by Microsoft]

Lecture 4: Reverse Linked List ::4 Ways:: (LeetCode 206) [Asked by Google, Facebook]

Lecture 5: Reverse Nodes in k-group (LeetCode 25) [Asked by Microsoft]

Lecture 6: Remove Duplicates from Sorted List ::O(N):: (LeetCode 83) [Asked by Microsoft]

Lecture 7: Remove Duplicates from Sorted List ::O(1):: (LeetCode 83) [Asked by Microsoft]

Lecture 8: Rotate List (LeetCode 61) [Asked by Microsoft]

Lecture 9: Reorder List (LeetCode 143) [Asked by Amazon,LinkedIn,Microsoft]

Lecture 10: Palindrome Linked List (LeetCode 234) [Asked by Microsoft]

Chapter 12: Binary Tree

Lecture 1: Code (Resource)

Lecture 2: Tree Traversal Techniques (Level Order, Zigzag, Preorder, Inorder, Postorder)

Lecture 3: Level Order Traversal Binary Tree (LeetCode 102) [Asked by Amazon, Microsoft]

Lecture 4: Binary Tree Zigzag Level Order Traversal (LeetCode 103) [Asked by Microsoft]

Lecture 5: Binary Tree Preorder Traversal (LeetCode 144) [Asked by Microsoft]

Lecture 6: Binary Tree Inorder Traversal (LeetCode 94) [Asked by Microsoft]

Lecture 7: Binary Tree Post Order Traversal (LeetCode 145) [Asked by Microsoft]

Lecture 8: [Morris Traversal] Preorder Traversal (LeetCode 144) [Asked by Microsoft]