Skip to navigation
Skip to navigation
Skip to search form
Skip to login form
Skip to footer
Skip to main content
Accessibility options
Accessibility profiles
Visual impairment
Seizure and epileptic
Color vision deficiency
ADHD
Learning
Content adjustments
Readable font
Highlight titles
Highlight links
Stop animations
Text size
+
+ +
+ + +
Line height
+
+ +
+ + +
Text spacing
+
+ +
+ + +
Color adjustments
Dark contrast
Light contrast
High contrast
High saturation
Low saturation
Monochrome
Orientation adjustments
Reading guide
Reading Mask
Big black cursor
Big white cursor
Email: it@huph.edu.vn
Email: it@huph.edu.vn
Các khóa học
Đổi giao diện
Giao diện cũ
Giao diện mới
Learning AI
Machine Learning cơ bản
en
English
Technology
Programing Language
DSA In Python Course Prerequisites and Top 130 Leetcode Problems for MAANG
0 students
Last updated
Jan 2025
Enrol now
Overview
Course content
Instructors
About the course
Show more...
Course content
Sections:
25
•
Activities:
0
•
Resources:
220
Expand all
Section 1
1 - Course Introduction
1 How to get started with Leetcode
Section 2
2 - Time & Space Complexity
1 Introduction to Time Space Complexity
2 What is Big O Notation
3 Checking if Big O Notation is acceptable in Interviews
4 Calculating Time Complexity Part 1
5 Calculating Time Complexity Part 2
6 Myths About Time Complexity
7 Calculating Time Complexity Of Recursive Algorithm
8 Introduction to Space Complexity
9 Space Complexity Example 1
10 Space Complexity Example 2
Section 3
3 - Arrays & Lists In Python
1 What are arrays and why are they so fast
2 What are some drawbacks of using arrays
3 How do resizable arrays work
4 Using Lists In Python
5 Advanced List Operators Part 1
6 Advanced List Operators Part 2
7 Leetcode 485 Max Consecutive Ones Python
8 Leetcode 121 Best Time To Buy And Sell Stock Python
9 Leetcode 238 Product Of Array Except Self Python
10 Leetcode 189 Rotate Array Python
11 Leetcode 53 Maximum Sum Subarray Python
12 Leetcode 152 Maximum Product Subarray Python
13 Leetcode 36 Valid Sudoku Python
Section 4
4 - Sorting
1 Introduction To Sorting
2 Bubble Sort Theory
3 Bubble Sort Implementation
4 Selection Sort Theory
5 Selection Sort Implementation
6 Insertion Sort Theory
7 Insertion Sort Implementation
8 Merge Sort Part 1 How to merge two sorted arrays
9 Merge Sort Part 2 Merge Two Sorted Arrays Implementation
10 Merge Sort Part 3 Merge Sort Theory
11 Merge Sort Part 4 Implementation
12 Quick Sort Part 1 Partitioning Algorithm Theory
13 Quick Sort Part 2 Partitioning Algorithm Implementation
14 Quick Sort Part 3 Understanding How Quick Sort Works
15 Quick Sort Part 4 Quick Sort Implementation
16 Counting Sort Part 1 How does counting sort work and its importance
17 Counting Sort Part 2 Implementation
18 Leetcode 283 Move Zeroes Python
19 Leetcode 169 Majority Element Python
20 Leetcode 75 Sort Colors Python
Section 5
5 - Linked Lists
1 Drawback Of Arrays
2 What is Linked List
3 Linked List Basic Implementation
4 Linked List Insert At Top
5 Linked List Insert At End
6 Linked List Insert In Middle
7 Linked List Delete At Top
8 Linked List Delete At End Part 1
9 Linked List Delete At End Part 2
10 Practice Problem 1 Intersection Of Two Linked Lists
11 Practice Problem 2 Merge Two Sorted Lists
12 Practice Problem 4 Reverse Linked List
13 Practice Problem 5 Palindrome Linked List
14 Practice Problem 6 Linked List Cycle II
15 Practice Problem 7 Find Middle Of The Linked List
16 Practice Problem 8 Remove Nth Node From End Of List
17 Practice Problem 9 Add Two Numbers
Section 6
6 - Hash Table
1 Introduction to Hash Table
2 How does Hash Table Work
3 Hash Table Collision Resolution
4 Types Of Hash Tables
5 Unordered Hash Table In Python
6 Ordered Hash Table In Python
7 Practice Problem 1 Two Sum
8 Practice Problem 2 Three Sum
9 Practice Problem 3 Longest Consecutive Sequence
10 Practice Problem 4 Contains Duplicate
11 Practice Problem 5 Valid Anagram
Section 7
7 - Stacks Theory + Practice Problems
1 Introduction To Stacks
2 Using Stacks In Python Part 1
3 Using Stacks In Python Part 2
4 Practice Problem 1 Valid Paranthesis
5 Practice Problem 2 Min Stack
6 Practice Problem 3 Merge Intervals
7 Practice Problem 4 Next Greater Element II
8 Practice Problem 5 Evaluate Reverse Polish Notation
Section 8
8 - Queue
1 Introduction To Queue
2 Using Deque As a Queue In Python
Section 9
9 - Array Pattern #1 - Sliding Window Method Theory + Practice Problems
1 Practice Problem 1 Longest Substring Without Repeating Characters
2 Leetcode 239 Sliding Window Maximum Python
Section 10
10 - Array Pattern #2 - Two Pointer Method Theory + Practice Problems
1 Leetcode 167 Two Sum II Input Array Is Sorted Python
2 Leetcode 42 Trapping Rain Water Python
3 Leetcode 11 Container With Most Water Python
4 Practice Problem Valid Palindrome
Section 11
11 - Array Pattern #3 - Math & Geometry Practice Problems
1 Leetcode 73 Set Matrix Zeroes Python
2 Leetcode 54 Spiral Matrix Python
Section 12
12 - Binary Search
1 Introduction To Binary Search
2 Binary Search Implementation
Section 13
13 - Binary Search Pattern #1 - Binary Search Over Sorted Arrays
1 Leetcode 34 Find First And Last Position Of Element In Sorted Array Python
2 Leetcode 153 Find Minimum In Rotated Sorted Array Python
3 Leetcode 35 Search Insert Position Python
Section 14
14 - Binary Search Pattern #2 - Binary Search Over Range
1 Leetcode 875 Koko Eating Bananas Python
2 Leetcode 1552 Magnetic Force Between Two Balls Python
Section 15
15 - Binary Search Pattern #3 - Rotated Sorted Arrays
1 Leetcode 33 Search In A Rotated Sorted Array Python
Section 16
16 - Binary Trees
1 Introduction to Binary Trees
2 Terms Related To Trees
3 Tree Traversal Part 1
4 Tree Traversal Part 2
5 Leetcode 94 Binary Tree InOrder Traversal Python
6 Leetcode 101 Symmetric Tree Python
7 Leetcode 104 Maximum Depth Of Binary Tree Python
8 Leetcode 226 Invert Binary Tree Python
9 Leetcode 543 Diameter Of A Binary Tree Python
10 Leetcode 102 Binary Tree Level Order Traversal Python
11 Leetcode 112 Path Sum Python
12 Leetcode 113 Path Sum II Python
13 Leetcode 993 Cousins In Binary Tree Python
14 Leetcode 1161 Maximum Level Sum Of Binary Tree Python
15 Leetcode 100 Same Tree Python
16 Leetcode 105 Construct Binary Tree From PreOrder And InOrder Traversal Python
17 Leetcode 572 Subtree Of Another Tree Python
18 Leetcode 110 Balanced Binary Tree Python
19 Leetcode 199 Binary Tree Right Side View Python
20 Leetcode 1448 Count Good Nodes In Binary Tree Python
21 Leetcode 404 Sum Of Left Leaves Python
Section 17
17 - Heaps Theory + Practice Problems
1 Introduction To Heaps
2 Implementation Of Heaps
3 Insertion In Heaps
4 Deletion In Heaps
5 Practice Problem 1 Kth Largest Element In An Array
6 Practice Problem 2 Find Median From Data Stream
7 Practice Problem 3 Kth Largest Element In Stream
Section 18
18 - Binary Search Tree
1 Introduction To Binary Search Tree
2 Height Balanced BST
3 Inserting A New Node In Binary Search Tree
4 Inorder Successor And Predecessor In BST
5 Deleting An Existing Node From Binary Search Tree
6 Leetcode 230 Kth Smallest Element In BST Python
7 Leetcode 98 Validate Binary Search Tree Python
8 Leetcode 235 Lowest Common Ancestor Of A Binary Search Tree Python
Section 19
19 - Dynamic Programming
1 Introduction to Dynamic Programming
2 Practice Problem 1 Climbing Stairs
3 Practice Problem 2 Jump Game
4 Practice Problem 3 Coin Change
5 Practice Problem 4 Target Sum
6 Practice Problem 5 Longest Common Subsequence
7 Practice Problem 6 House Robber
8 Practice Problem 7 Longest Increasing Subsequence
9 Practice Problem 8 Partition Equal Subset Sum
10 Practice Problem 9 0 1 Matrix
11 Practice Problem 10 Integer Replacement
12 Practice Problem 11 Edit Distance
13 Practice Problem 12 Decode Ways
14 Practice Problem 13 House Robber II
15 Practice Problem 14 Min Cost Climbing Stairs
16 Practice Problem 15 Longest Palindromic Substring
Section 20
20 - Disjoint Set Data Structure And Union Find Algorithms
1 Introduction To Disjoint Set Data Structure
2 Understanding Disjoint Set Data Structure
3 Union By Rank Optimization
4 Disjoint Set Data Structure Python Implementation
5 Path Compression Optimization
6 Path Compression Optimization Implementation
Section 21
21 - Graphs
1 What are Graphs
2 Directed vs Undirected Graphs
3 Weighted vs Unweighted Graphs
4 Terms Of Graphs Part 1
5 Types Of Graphs Part 1
6 Types Of Graphs Part 2
7 Implementing Graphs Part 1
8 Implementing Graphs Part 2
9 Implementing Graphs Part 3
10 Adjacency Matrix Implementation
11 Adjacency List Implementation
12 Introduction To Traversals
13 BFS Working
14 BFS Implementation
15 BFS Property 1
16 BFS Over Binary Weighted Graphs
17 Introduction to DFS
18 DFS Iterative Implementation
19 DFS Recursive Implementation
20 DFS Important Properties
21 Cycle Detection Part 1
22 Cycle Detection Part 2
23 Cycle Detection Part 3
24 Cycle Detection Implementation
25 What is topological sorting
26 Topological Sorting Example 1
27 Single Source Shortest Path Problem
28 Dijkstras lgorithm
29 Dijkstras Algorithm Implementation
30 Introduction To Bellman Ford Algorithm
31 Bellman Ford Algorithm Working
32 Bellman Ford Algorithm Implementation
33 Introduction To Minimum Spanning Tree
34 Prims Algorithm
35 Prims Algorithm Implementation
36 Practice Problem 1 Course Schedule
37 Practice Problem 2 Number Of Islands
38 Practice Problem 3 Find The Town Judge
39 Practice Problem 4 Surrounded Regions
40 Practice Problem 5 Number Of Enclaves
41 Practice Problem 6 Network Delay Time
42 Practice Problem 7 Flood Fill
Section 22
22 - Bit Manipulation
1 Introduction to Bitwise Operators
2 Common Bitwise Operators
3 Leetcode 136 Single Number Python
4 Leetcode 338 Counting Bits Python
5 Leetcode 287 Find The Duplicate Number Python
6 Leetcode 29 Divide Two Integers Python
7 Leetcode 268 Missing Number Python
8 Leetcode 191 Number Of 1 Bits Python
9 Leetcode 7 Reverse Integer Python
Section 23
23 - Recursion & Backtracking
1 Introduction to Backtracking
2 Leetcode 39 Combination Sum Python
3 Leetcode 78 Subsets Python
4 Leetcode 51 N Queens Python
Section 24
24 - Strings
1 Practice Problem 1 Minimum Add To Make Paranthesis Valid
2 Practice Problem 2 Group Anagrams
Section 25
25 - Advanced Data Structures - Segment Tree
1 Introduction To Range Sum Query Problem
2 Introduction To Segment Tree Building A Segment Tree
3 Answering Queries Using Segment Tree
4 Segment Tree Updating Values
5 Segment Tree Build Function Implementation
6 Segment Tree Query Function Implementation
7 Segment Tree Update Function Implementation
Instructors
Enrolment options
DSA In Python Course Prerequisites and Top 130 Leetcode Problems for MAANG
Course modified date:
22 Jan 2025
Enrolled students:
There are no students enrolled in this course.
Guests cannot access this course. Please log in.
Continue
Enrol now
This course includes
Resources
Share this course
Scroll to top
×
Close
×
Close