Name		Name	Last commit message	Last commit date
1-Two Sum.cpp		1-Two Sum.cpp
10-Regular Expression Matching (Memoization).cpp		10-Regular Expression Matching (Memoization).cpp
100-Same Tree.cpp		100-Same Tree.cpp
101-Symmetric Tree.cpp		101-Symmetric Tree.cpp
102-Binary Tree Level Order Traversal.cpp		102-Binary Tree Level Order Traversal.cpp
103-Binary Tree Zigzag Level Order Traversal (O(n) BFS).cpp		103-Binary Tree Zigzag Level Order Traversal (O(n) BFS).cpp
103-Binary Tree Zigzag Level Order Traversal (O(n) List DFS).cpp		103-Binary Tree Zigzag Level Order Traversal (O(n) List DFS).cpp
103-Binary Tree Zigzag Level Order Traversal (O(n^2) DFS).cpp		103-Binary Tree Zigzag Level Order Traversal (O(n^2) DFS).cpp
104-Maximum Depth of Binary Tree.cpp		104-Maximum Depth of Binary Tree.cpp
105-Construct Binary Tree from Preorder and Inorder Traversal.cpp		105-Construct Binary Tree from Preorder and Inorder Traversal.cpp
1055-Shortest Way to Form String.cpp		1055-Shortest Way to Form String.cpp
1055-Shortest Way to Form String_2.cpp		1055-Shortest Way to Form String_2.cpp
1056-Confusing Number.cpp		1056-Confusing Number.cpp
1057-Campus Bikes.cpp		1057-Campus Bikes.cpp
1059-All Paths from Source Lead to Destination.cpp		1059-All Paths from Source Lead to Destination.cpp
106-Construct Binary Tree from Inorder and Postorder Traversal.cpp		106-Construct Binary Tree from Inorder and Postorder Traversal.cpp
1066-Campus Bikes II.cpp		1066-Campus Bikes II.cpp
107-Binary Tree Level Order Traversal II.cpp		107-Binary Tree Level Order Traversal II.cpp
108-Convert Sorted Array to Binary 搜索 Tree.cpp		108-Convert Sorted Array to Binary 搜索 Tree.cpp
1087-Brace Expansion.cpp		1087-Brace Expansion.cpp
1088-Confusing Number II.cpp		1088-Confusing Number II.cpp
109-Convert Sorted List to Binary 搜索 Tree.cpp		109-Convert Sorted List to Binary 搜索 Tree.cpp
11-Container With Most Water (O(1) space).cpp		11-Container With Most Water (O(1) space).cpp
110-Balanced Binary Tree (Height Match O(n) space).cpp		110-Balanced Binary Tree (Height Match O(n) space).cpp
110-Balanced Binary Tree.cpp		110-Balanced Binary Tree.cpp
111-Minimum Depth of Binary Tree.cpp		111-Minimum Depth of Binary Tree.cpp
1118-Number of Days in a Month.cpp		1118-Number of Days in a Month.cpp
1119-Remove Vowels from a String.cpp		1119-Remove Vowels from a String.cpp
112-Path Sum.cpp		112-Path Sum.cpp
1120-Maximum Average Subtree.cpp		1120-Maximum Average Subtree.cpp
1120-Maximum Average Subtree_2.cpp		1120-Maximum Average Subtree_2.cpp
1121-Divide Array Into Increasing Sequences.cpp		1121-Divide Array Into Increasing Sequences.cpp
113-Path Sum II.cpp		113-Path Sum II.cpp
1136-Parallel Courses.cpp		1136-Parallel Courses.cpp
114-Flatten Binary Tree to Linked List.cpp		114-Flatten Binary Tree to Linked List.cpp
115-Distinct Subsequences (Tabulation space optimized).cpp		115-Distinct Subsequences (Tabulation space optimized).cpp
115-Distinct Subsequences (Tabulation).cpp		115-Distinct Subsequences (Tabulation).cpp
1150-Check If a Number Is Majority Element in a Sorted Array.cpp		1150-Check If a Number Is Majority Element in a Sorted Array.cpp
1151-Minimum Swaps to Group All 1's Together.cpp		1151-Minimum Swaps to Group All 1's Together.cpp
1153-String Transforms Into Another String.cpp		1153-String Transforms Into Another String.cpp
116-Populating Next Right Pointers in Each Node.cpp		116-Populating Next Right Pointers in Each Node.cpp
1165-Single-Row Keyboard.cpp		1165-Single-Row Keyboard.cpp
1166-Design File System.cpp		1166-Design File System.cpp
1167-Minimum Cost to Connect Sticks.cpp		1167-Minimum Cost to Connect Sticks.cpp
1168-Optimize Water Distribution in a Village.cpp		1168-Optimize Water Distribution in a Village.cpp
117-Populating Next Right Pointers in Each Node II.cpp		117-Populating Next Right Pointers in Each Node II.cpp
118-Pascal's Triangle.cpp		118-Pascal's Triangle.cpp
1180-Count Substrings with Only One Distinct Letter.cpp		1180-Count Substrings with Only One Distinct Letter.cpp
1181-Before and After Puzzle.cpp		1181-Before and After Puzzle.cpp
1182-Shortest Distance to Target Color (O(n + m x log(n))).cpp		1182-Shortest Distance to Target Color (O(n + m x log(n))).cpp
1182-Shortest Distance to Target Color (O(n + m)).cpp		1182-Shortest Distance to Target Color (O(n + m)).cpp
1183-Maximum Number of Ones.cpp		1183-Maximum Number of Ones.cpp
119-Pascal's Triangle II.cpp		119-Pascal's Triangle II.cpp
1196-How Many Apples Can You Put into the Basket.cpp		1196-How Many Apples Can You Put into the Basket.cpp
1197-Minimum Knight Moves.cpp		1197-Minimum Knight Moves.cpp
1198-Find Smallest Common Element in All Rows (O(mn)).cpp		1198-Find Smallest Common Element in All Rows (O(mn)).cpp
1198-Find Smallest Common Element in All Rows (O(mn^2)).cpp		1198-Find Smallest Common Element in All Rows (O(mn^2)).cpp
12-Integer to Roman.cpp		12-Integer to Roman.cpp
120-Triangle (Memoization).cpp		120-Triangle (Memoization).cpp
120-Triangle (Tabulation).cpp		120-Triangle (Tabulation).cpp
120-Triangle(Tabulation space optimized).cpp		120-Triangle(Tabulation space optimized).cpp
121-Best Time to Buy and Sell Stock.cpp		121-Best Time to Buy and Sell Stock.cpp
1213-Intersection of Three Sorted Arrays.cpp		1213-Intersection of Three Sorted Arrays.cpp
1214-Two Sum BSTs.cpp		1214-Two Sum BSTs.cpp
1215-Stepping Numbers (BFS).cpp		1215-Stepping Numbers (BFS).cpp
1215-Stepping Numbers (DFS).cpp		1215-Stepping Numbers (DFS).cpp
1216-Valid Palindrome III.cpp		1216-Valid Palindrome III.cpp
122-Best Time to Buy and Sell Stock II.cpp		122-Best Time to Buy and Sell Stock II.cpp
1228-Missing Number In Arithmetic Progression.cpp		1228-Missing Number In Arithmetic Progression.cpp
1229-Meeting Scheduler.cpp		1229-Meeting Scheduler.cpp
123-Best Time to Buy and Sell Stock III.cpp		123-Best Time to Buy and Sell Stock III.cpp
1230-Toss Strange Coins.cpp		1230-Toss Strange Coins.cpp
1231-Divide Chocolate.cpp		1231-Divide Chocolate.cpp
124-Binary Tree Maximum Path Sum.cpp		124-Binary Tree Maximum Path Sum.cpp
1243-Array Transformation.cpp		1243-Array Transformation.cpp
1244-Design A Leaderboard.cpp		1244-Design A Leaderboard.cpp
1245-Tree Diameter.cpp		1245-Tree Diameter.cpp
1246-Palindrome Removal.cpp		1246-Palindrome Removal.cpp
125-Valid Palindrome.cpp		125-Valid Palindrome.cpp
1256-Encode Number (Recursive).cpp		1256-Encode Number (Recursive).cpp
1256-Encode Number.cpp		1256-Encode Number.cpp
1257-Smallest Common Region.cpp		1257-Smallest Common Region.cpp
1257-Smallest Common Region_2.cpp		1257-Smallest Common Region_2.cpp
1258-Synonymous Sentences.cpp		1258-Synonymous Sentences.cpp
1259-Handshakes That Don't Cross.cpp		1259-Handshakes That Don't Cross.cpp
126-Word Ladder II (BFS).cpp		126-Word Ladder II (BFS).cpp
126-Word Ladder II (Bi-Directional BFS).cpp		126-Word Ladder II (Bi-Directional BFS).cpp
127-Word Ladder (BFS).cpp		127-Word Ladder (BFS).cpp
127-Word Ladder (Bi-Directional BFS).cpp		127-Word Ladder (Bi-Directional BFS).cpp
1271-Hexspeak.cpp		1271-Hexspeak.cpp
1272-Remove Interval.cpp		1272-Remove Interval.cpp
1273-Delete Tree Nodes.cpp		1273-Delete Tree Nodes.cpp
1274-Number of Ships in a Rectangle.cpp		1274-Number of Ships in a Rectangle.cpp
128-Longest Consecutive Sequence.cpp		128-Longest Consecutive Sequence.cpp
1286-Iterator for Combination.cpp		1286-Iterator for Combination.cpp
1287-Element Appearing More Than 25% In Sorted Array.cpp		1287-Element Appearing More Than 25% In Sorted Array.cpp
1288-Remove Covered Intervals.cpp		1288-Remove Covered Intervals.cpp
1289-Minimum Falling Path Sum II (O(1) space).cpp		1289-Minimum Falling Path Sum II (O(1) space).cpp
1289-Minimum Falling Path Sum II (O(mn) space).cpp		1289-Minimum Falling Path Sum II (O(mn) space).cpp
129-Sum Root to Leaf Numbers.cpp		129-Sum Root to Leaf Numbers.cpp

仓库 files navigation

LeetCode

Curated list of my solutions to LeetCode Problems.

关于

My solutions to LeetCode Problems

Report repository

发布

包

贡献者

Languages