Skip to main content
Back to top
Ctrl
+
K
Introduction
Basics
Lectures
Lecture 1: Introduction
Lecture 2: Data Structure and Dynamic Array
Lecture 3: Set and Sorting
Hashing
Lecture 5: Linear Sorting
Lecture 6: Binary Trees - I
Lecture 7: Binary Trees - II
Lecture 8: Binary Heap
Lecture 9: Breadth-First Search
Lecture 10: Depth-First Search
Lecture 11: Weighted Shortest Path
Lecture 12: The Bellman-Ford Algorithm
Lecture 13: The Dijkstra’s Algorithm
Overview
Convex-optimization
Interior-point Method
Newton Iterative Method
Leetcode
Solutions
0001. Two Sum
0003. Longest Substring without Repeating Characters
0004. Median of Two Sorted Arrays
0005. Longest Palindromic String
0015. Three Sum
0016. Three Sum Closest
0018. Four Sum
0021 Merge Two Sorted Lists
0022 Generate Parentheses
0023 Merge k Sorted Lists
0026 Remove Duplicates
0027 Remove Element
0048 Rotate Image
0054 Spiral Matrix
0056 Merge Intervals
0059 Spiral Matrix II
0076 Minimum Window Substring
0083 Remove Duplicates From Sorted List
0086 Partition List
0092. Reversed Linked List ii
0115 Distinct Subsequences
0123 Best Time to Buy and Sell Stock III
0160 Intersection of Two Linked List
0167. Two Sum II
0189. Rotate Array
0200. Number of islands
0206. Reversed Linked List
0207 Course Schedule
0226. Invert Binary Tree
0236 Lowest Common Ancestor of a Binary Tree
0279 Number Squares
0300 Longest Increaseing Subsequence
0303 Range Sum Query
0304 Range Sum Query - 2D
0323 Number of Connected Component in an Undirected Graph
0344. Reverse String
0354 Russian Doll Envelope
0370 Range Addition
0438 Find All Anagrams in a String
0463. Island Perimeter
0494 Target Sum
0547 Number of Provinces
0567 Minimum Window Substring
0652 Find Duplicate Subtrees
0695. Max Area of Island
0704. Binary Search
0712 Minimum ASCII Delete Sum for Two Strings
0713 Subarray with a product less than k
0733. Flood Fill
0733. Network Delay Time
0797 All Paths From Source to Target
0886 Possible Bipartition
1027 Longest Arithmetic Subsequence
1109 Flight Booking
1288 Remove Covered Intervals
1514 Path With Maximum Probability
1584 Min Cost to Connect All Points
1631 Path With Minimum Effort
1976 Number of Ways to Arrive at Destination
Notes
Algorithm
Backtracking
Big-O Complexity
Graph algorithm
Recursion
Search
Sort
Data Structure
Chapter 1. Array and String
Dynamic Programming II
Chapter 11. Dynamic Programming III
Dynamic Programming IV
Chapter 12. Backtracking
Chapter 2. Singely Linked List
Chapter 3. Stack
Chapter 4. Binary Search Tree
Cahpter 5. Binary Tree
Chapter 6. Binary Search Tree II
Chapter 7: Binary Heap
Chapter 8. Graph
Chapter 9. Dynamic Programming I
Repository
Open issue
.md
.pdf
Lectures
Lectures
#
table of lectures are shown here.
