GitHub - helloboyn/Leetcode-Plan: Study plan code Solution

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 156 Commits
23AugustLeetCode		23AugustLeetCode
Algorithm		Algorithm
Data Structure		Data Structure
Dynamic Programming		Dynamic Programming
Graph Theory		Graph Theory
LeetCode 75		LeetCode 75
Placement Series		Placement Series
Programming Skills		Programming Skills
1.1 733. Flood Fill C++		1.1 733. Flood Fill C++
1.2 200. Number of Islands C++		1.2 200. Number of Islands C++
10.1 1129. Shortest Path with Alternating Colors		10.1 1129. Shortest Path with Alternating Colors
10.2 1466. Reorder Routes to Make All Paths Lead to the City Zero		10.2 1466. Reorder Routes to Make All Paths Lead to the City Zero
10.3 847. Shortest Path Visiting All Nodes		10.3 847. Shortest Path Visiting All Nodes
11.1 1306. Jump Game III		11.1 1306. Jump Game III
11.2 1654. Minimum Jumps to Reach Home		11.2 1654. Minimum Jumps to Reach Home
11.3 365. Water and Jug Problem		11.3 365. Water and Jug Problem
12.1 433. Minimum Genetic Mutation		12.1 433. Minimum Genetic Mutation
12.2 752. Open the Lock		12.2 752. Open the Lock
12.3 127. Word Ladder		12.3 127. Word Ladder
13.1 997. Find the Town Judge		13.1 997. Find the Town Judge
13.2 1557. Minimum Number of Vertices to Reach All Nodes		13.2 1557. Minimum Number of Vertices to Reach All Nodes
14.1 1615. Maximal Network Rank		14.1 1615. Maximal Network Rank
14.2 886. Possible Bipartition		14.2 886. Possible Bipartition
14.3 785. Is Graph Bipartite?		14.3 785. Is Graph Bipartite?
2.1 695. Max Area of Island C++		2.1 695. Max Area of Island C++
2.2 1254. Number of Closed Islands C++		2.2 1254. Number of Closed Islands C++
3.1 1020. Number of Enclaves C++		3.1 1020. Number of Enclaves C++
3.2 1905. Count Sub Islands C++		3.2 1905. Count Sub Islands C++
4.1 1162. As Far from Land as Possible C++		4.1 1162. As Far from Land as Possible C++
4.2 417. Pacific Atlantic Water Flow C++		4.2 417. Pacific Atlantic Water Flow C++
5.1 1091. Shortest Path in Binary Matrix C++		5.1 1091. Shortest Path in Binary Matrix C++
5.2 542. 01 Matrix C++		5.2 542. 01 Matrix C++
6.1 934. Shortest Bridge		6.1 934. Shortest Bridge
6.2 1926. Nearest Exit from Entrance in Maze		6.2 1926. Nearest Exit from Entrance in Maze
7.1 797. All Paths From Source to Target		7.1 797. All Paths From Source to Target
7.2 841. Keys and Rooms		7.2 841. Keys and Rooms
8.1 547. Number of Provinces		8.1 547. Number of Provinces
8.2 1319. Number of Operations to Make Network Connected		8.2 1319. Number of Operations to Make Network Connected
9.1 1376. Time Needed to Inform All Employees		9.1 1376. Time Needed to Inform All Employees
9.2 802. Find Eventual Safe States		9.2 802. Find Eventual Safe States