Teach on Udemy

Turn what you know into an opportunity and reach millions around the world.

Learn More

Your cart is empty.

Keep shopping

Coding Interview Bootcamp: Algorithms (Java, Python, C++)

Name: Coding Interview Bootcamp: Algorithms (Java, Python, C++)
Rating: 4.6 (51 reviews)

Get ready in a Month + Help from Google/Facebook Interviewer with 1000+ coding questions experience

Created byCodeMan Liu

Last updated 4/2022

English

What you'll learn

Systematically prepare coding interview
Proficient in important data structures/algorithms
Be ready for majority of tech companies interview

Course content

10 sections • 174 lectures • 12h 59m total length

Read Me0:27
Introduction to coding interviews37:20
Introduction to this coding course syllabus and my background
The reasons why this course will help you get an offer as a software engineer
How to prepare for a coding interview
How to get a good review for your coding interview
Some real coding questions and the right way to approach a solution
【Code】 Longest Palindromic Substring Solution2:45
Longest Palindromic Substring Solutions
【Code】 strStr Solution1:53

Prior knowledge about Binary Search10:13
Binary Search Template7:08
【Code】 Binary Search Template0:52
Related Problems5:50
【Code】 First Position of Target Solution1:04
【Code】 Last Position of Target Solution1:04
Binary Search on Index AABB Model9:39
【Code】 First Bad Version Solution1:10
【Code】 Find K Closest Elements Solution1:49
Exponential backoff4:02
【Code】 Search in a Big Sorted Array Solution1:27
More AABB Related Questions16:43
【Code】 Find Minimum in Rotated Sorted Array Solution0:59
【Code】 Max Number in Mountain Sequence Solution1:08
【Code】 Search 2D Matrix Solution1:21
【Code】 Search 2D Matrix II Solution1:15
【Code】 Smallest Rectangle Enclosing Black Pixels Solution3:05
Half-half Model9:32
【Code】 Find Peak Element Solution1:23
【Code】 Search in Rotated Sorted Array Solution1:22
More O(logN) questions13:23
【Code】 Fast Power/Pow(x, n) Solution1:43
【Code】 Minimize Max Distance to Gas Station Solution1:12
Some Suggestions3:10
Three Step Flip1:44

Preparation for this Chapter12:50
【Code】 Intersection of Two Linked Lists Solution1:34
【Code】 Linked List Cycle Solution1:05
【Code】 Linked List Cycle II Solution1:26
【Code】 Two Sum Solution2:03
【Code】 Quick Sort and Merge Sort1:51
Move Zeros6:01
【Code】 Move Zeroes Solution0:36
Minimum Window Substring6:54
【Code】 Minimum Window Substring Solution1:50
Valid Palindrome3:46
【Code】 Valid Palindrome Solution0:49
Two Sum and Related Questions12:58
【Code】 Two Sum Data structure design Solution1:26
【Code】 Two Sum Input Array is Sorted Solution1:10
【Code】 3 Sum - Solution1:21
【Code】 Two Sum Less Than K Solution0:46
【Code】 Valid Triangle Number Solution1:04
【Code】 3Sum Smaller Solution0:49
【Code】 3 Sum Closest Solution1:37
【Code】 4Sum Solution1:31
Two Pointers Partition17:40
【Code】 Partition Array into Disjoint Intervals Solution0:47
【Code】 Quick Select Solution1:28
【Code】 Sort Array by Parity Solution0:38
【Code】 Sort Colors Solution2:30

Introduction to BFS and Topological Sorting5:01
Level Order Traversal3:38
【Code】 Binary Tree Level Order Traversal Solutions0:50
Serialization and Deserialization7:05
【Code】 Serialize and Deserialize Binary Tree Solutions2:56
Other Binary Tree BFS Questions4:35
【Code】 Binary Tree Level Order Traversal II Solution0:32
【Code】 Binary Tree Zigzag Level Order Traversal Solution1:08
【Code】 Binary Tree Vertical Order Traversal Solution0:59
BFS in Graph14:07
【Code】 Clone Graph Solution2:03
【Code】 Word Ladder Solution1:49
BFS in Matrix10:35
【Code】 Number of Islands Solution2:00
【Code】 Minimum Knight Moves Solution0:56
Topological Sorting11:12
【Code】 Course Schedule II Solution1:52
【Code】 Alien Dictionary Solution2:33
【Code】 Graph Valid Tree Solution1:40
【Code】 Number of Connected Components in an Undirected Graph Solution1:21
【Code】 Sequence Reconstruction Solution1:53
【Code】 Rotting Oranges Solution2:12
【Code】 Shortest Distance from All Buildings Solution3:11
Conclusion1:17

Preparation for This Chapter1:33
【Code】 Maximum Average Subtree Solution2:12
【Code】 Invert Binary Tree Solution0:44
【Code】 Validate Binary Search Tree Solution1:14
【Code】Minimum Sum Subtree Solution1:27
Introduction to Binary Tree based DFS3:09
Minimum Sum Subtree7:12
【Code】Minimum Sun Subtree Solution1:45
Binary Tree Paths and LCA8:28
【Code】Binary Tree Paths Solution1:08
【Code】LCA & LCA II Solutions2:26
Flatten Binary Tree to Linked List10:21
【Code】Flatten Binary Tree to Linked List Solution0:59
BST intro3:55
Kth Smallest Element in a BST8:18
【Code】Kth Smallest Element in a BST Solution2:17
Binary Tree In-order, Pre-order, Post-order Traversal11:49
【Code】Inorder, Preorder, Postorder Traversal Solutions2:40
BST Iterator and BST Successor7:47
【Code】Binary Search Tree Iterator Solution1:20
【Code】Inorder Successor in BST Solution1:16
Closest Binary Search Tree Value12:33
【Code】Closest Binary Search Tree Value Solution1:49
【Code】Closest Binary Search Tree Value II Solution1:03
【Code】Insert into a Binary Search Tree Solution0:56
【Code】Delete Node in a BST Solution1:06

Preparation for This Chapter2:54
Introduction to Combination based DFS5:18
Combination Sum16:32
【Code】Combination Sum Solution1:36
【Code】Combination Sum II Solution1:23
【Code】Combination Sum III Solution1:01
Palindrome Partitioning5:45
【Code】Palindrome Partitioning Solution0:58
Wildcard Matching/Regular Expression Matching19:46
【Code】Wildcard Matching/Regular Expression Matching Solution4:39
Word Break II2:53
【Code】Word Break II Solution1:17

Preparation for This Chapter4:07
Introduction to Permutation based DFS4:08
Permutations & Permutations II7:35
N Queens12:01
【Code】N Queens Solution1:44
Letter Combinations of a Phone Number12:41
【Code】Letter Combinations of a Phone Number Solution1:12
Word Pattern II8:58
【Code】Word Pattern II Solution1:32
Word Ladder II12:00
【Code】Word Ladder II Solution2:50
Word Search II10:12
【Code】Word Search II Solution3:19

Preparation for This Chapter0:12
Introduction to Data Structure 17:32
Queue & Stack9:11
【Code】Moving Average from Data Stream Solution0:37
Hash & LRU Cache20:22
【Code】LRU Cache Solution2:54
Insert Delete GetRandom O(1)11:53
【Code】Insert Delete GetRandom O(1) Solution3:21
First Unique Character - Data Stream7:35
【Code】First Unique Character in a String Solution1:10
【Code】Group Anagrams Solution0:46
【Code】Copy List with Random Pointer Solution1:13
【Code】Subarray Sum Equals K Solution0:44
【Code】Longest Consecutive Sequence Solution0:45
Ugly NumberII10:27
【Code】Ugly Number II Solution1:21
【Code】Merge k Sorted Lists Solution3:43
Merge K Sorted Lists8:37
Kth Largest Element II7:53
【Code】Kth Largest Element II Solution0:52
【Code】Top K Frequent Elements Solution2:18
【Code】Find Median from Data Stream Solution1:17
【Code】Kth Smallest Element in a Sorted Matrix Solution1:42

Preparation for This Chapter2:11
Introduction to Data Structure 21:46
Merge Sorted Arrays/Intervals15:48
【Code】Merge Sorted Array Solution0:55
【Code】Merge Intervals Solution1:04
【Code】Merge K Sorted Interval Lists Solution1:30
Intersection of Arrays14:53
【Code】Intersection of Two Arrays Solutions2:10
【Code】Intersection of K Arrays Solution0:58
Sparse Matrix and Best Time to Sell Stock13:56
【Code】Sparse Matrix Multiplication Solution1:31
【Code】Best Time to Buy and Sell Stock Solution0:49
Prefix Sum/Matrix related questions15:28
【Code】Number of Submatrices That Sum to Target Solution1:10
【Code】Max Sum of Rectangle No Larger Than K1:36
Median of Two Sorted Arrays11:27
【Code】Median of Two Sorted Arrays Solution1:54
Union Find15:58
【Code】Number of Islands II Solution2:18
【Code】Graph Valid Tree Solution1:41

Requirements

Any one of programming languages

Description

-- This course will help you systematically prepare for a coding interview in a short amount of time(Questions Classification + Solution Templates + Coding Style)

-- The price for this course is relatively low. Because this course is aimed to help people get an offer during the pandemic

-- You will know the key algorithms/date structures for most tech companies coding interview

-- You will know what kind of questions you must practice and what questions you can ignore.

-- You will know how will your interviewer rate your performance (I have interviewed more than 100 candidates).

-- In each chapter, we will cover 10 - 15 questions in our videos. During our class, I will pick one of the most popular languages Java as our sample solution to the questions. In addition, I will also share all solutions to those questions in Python and C++. Language is not important, our logic and our algorithms are more critical.

-- I will also share the link to questions on LeetCode so that you can practice by yourself.

-- At the end of each chapter, there are some reading materials. Please read them carefully, they will help you build a deeper understanding of our coding questions.

Who this course is for:

College Student, Junior or Senior Software Engineers who want to find a new job in a short amount of time

Coding Interview Bootcamp: Algorithms (Java, Python, C++)

What you'll learn

Explore related topics

Course content

Chap 01 Introduction to Coding Interviews4 lectures • 42min

Chap 02 Binary Search and O(logn) Algorithms25 lectures • 1hr 42min

Chap 03 Two Pointers26 lectures • 1hr 27min

Chap 04 BFS and Topological Sorting24 lectures • 1hr 25min

Chap 05 Binary Tree based DFS26 lectures • 1hr 39min

Chap 06 Combination based DFS12 lectures • 1hr 4min

Chap 07 Permutation based DFS13 lectures • 1hr 22min

Chap 08 Data Structure 123 lectures • 1hr 46min

Chap 09 Data Structure 220 lectures • 1hr 49min

Bonus Chapter1 lecture • 2min

Requirements

Description

Who this course is for: