GitHub - raiden-02/LeetCode: my leetcode solutions

Branches Tags

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

About

Uh oh!

Releases

Packages

Languages

Name		Name	Last commit message	Last commit date
Latest commit History 1,265 Commits
Sorry, we had to truncate this directory to 1,000 files. 5 entries were omitted from the list.
1146. Snapshot Array		1146. Snapshot Array
1. Two Sum.cpp		1. Two Sum.cpp
10. Regular Expression Matching		10. Regular Expression Matching
1004. Max Consecutive Ones III		1004. Max Consecutive Ones III
1007. Minimum Domino Rotations For Equal Row		1007. Minimum Domino Rotations For Equal Row
1008. Construct Binary Search Tree from Preorder Traversal		1008. Construct Binary Search Tree from Preorder Traversal
101. Symmetric Tree		101. Symmetric Tree
1010. Pairs of Songs With Total Durations Divisible by 60		1010. Pairs of Songs With Total Durations Divisible by 60
1011. Capacity To Ship Packages Within D Days		1011. Capacity To Ship Packages Within D Days
1013. Partition Array Into Three Parts With Equal Sum		1013. Partition Array Into Three Parts With Equal Sum
1015. Smallest Integer Divisible by K		1015. Smallest Integer Divisible by K
102. Binary Tree Level Order Traversal		102. Binary Tree Level Order Traversal
1020. Number of Enclaves		1020. Number of Enclaves
1022. Sum of Root To Leaf Binary Numbers		1022. Sum of Root To Leaf Binary Numbers
1026. Maximum Difference Between Node and Ancestor.cpp		1026. Maximum Difference Between Node and Ancestor.cpp
1029. Two City Scheduling.cpp		1029. Two City Scheduling.cpp
103. Binary Tree Zigzag Level Order Traversal		103. Binary Tree Zigzag Level Order Traversal
1033. Moving Stones Until Consecutive.cpp		1033. Moving Stones Until Consecutive.cpp
1035. Uncrossed Lines.cpp		1035. Uncrossed Lines.cpp
104. Maximum Depth of Binary Tree		104. Maximum Depth of Binary Tree
1041. Robot Bounded In Circle		1041. Robot Bounded In Circle
1043. Partition Array for Maximum Sum.cpp		1043. Partition Array for Maximum Sum.cpp
1043. Partition Array for Maximum Sum.py		1043. Partition Array for Maximum Sum.py
1046. Last Stone Weight		1046. Last Stone Weight
1047. Remove All Adjacent Duplicates In String		1047. Remove All Adjacent Duplicates In String
1048. Longest String Chain		1048. Longest String Chain
105. Construct Binary Tree from Preorder and Inorder Traversal		105. Construct Binary Tree from Preorder and Inorder Traversal
1055. Shortest Way to Form String		1055. Shortest Way to Form String
1058. Minimize Rounding Error to Meet Target		1058. Minimize Rounding Error to Meet Target
1059. All Paths from Source Lead to Destination		1059. All Paths from Source Lead to Destination
106. Construct Binary Tree from Inorder and Postorder Traversal		106. Construct Binary Tree from Inorder and Postorder Traversal
1061. Lexicographically Smallest Equivalent String		1061. Lexicographically Smallest Equivalent String
1064. Fixed Point		1064. Fixed Point
1071. Greatest Common Divisor of Strings		1071. Greatest Common Divisor of Strings
1074. Number of Submatrices That Sum to Target		1074. Number of Submatrices That Sum to Target
108. Convert Sorted Array to Binary Search Tree		108. Convert Sorted Array to Binary Search Tree
1081. Smallest Subsequence of Distinct Characters		1081. Smallest Subsequence of Distinct Characters
1086. High Five		1086. High Five
1087. Brace Expansion		1087. Brace Expansion
109. Convert Sorted List to Binary Search Tree.cpp		109. Convert Sorted List to Binary Search Tree.cpp
109. Convert Sorted List to Binary Search Tree.js		109. Convert Sorted List to Binary Search Tree.js
1091. Shortest Path in Binary Matrix.cpp		1091. Shortest Path in Binary Matrix.cpp
1094. Car Pooling		1094. Car Pooling
1096. Brace Expansion II		1096. Brace Expansion II
11. Container With Most Water		11. Container With Most Water
110. Balanced Binary Tree		110. Balanced Binary Tree
1102. Path With Maximum Minimum Value		1102. Path With Maximum Minimum Value
1105. Filling Bookcase Shelves		1105. Filling Bookcase Shelves
112. Path Sum		112. Path Sum
1120. Maximum Average Subtree		1120. Maximum Average Subtree
1129. Shortest Path with Alternating Colors		1129. Shortest Path with Alternating Colors
113. Path Sum II		113. Path Sum II
1133. Largest Unique Number		1133. Largest Unique Number
1134. Armstrong Number		1134. Armstrong Number
1135. Connecting Cities With Minimum Cost		1135. Connecting Cities With Minimum Cost
1136. Parallel Courses		1136. Parallel Courses
1137. N-th Tribonacci Number		1137. N-th Tribonacci Number
1137. N-th Tribonacci Number.py		1137. N-th Tribonacci Number.py
114. Flatten Binary Tree to Linked List		114. Flatten Binary Tree to Linked List
1140. Stone Game II		1140. Stone Game II
1143. Longest Common Subsequence.cpp		1143. Longest Common Subsequence.cpp
1143. Longest Common Subsequence.py		1143. Longest Common Subsequence.py
115. Distinct Subsequences		115. Distinct Subsequences
1151. Minimum Swaps to Group All 1's Together		1151. Minimum Swaps to Group All 1's Together
1155. Number of Dice Rolls With Target Sum.cpp		1155. Number of Dice Rolls With Target Sum.cpp
116. Populating Next Right Pointers in Each Node		116. Populating Next Right Pointers in Each Node
1160. Find Words That Can Be Formed by Characters.cpp		1160. Find Words That Can Be Formed by Characters.cpp
1161. Maximum Level Sum of a Binary Tree.ts		1161. Maximum Level Sum of a Binary Tree.ts
1162. As Far from Land as Possible		1162. As Far from Land as Possible
1163. Last Substring in Lexicographical Order		1163. Last Substring in Lexicographical Order
1165. Single-Row Keyboard		1165. Single-Row Keyboard
1166. Design File System.cpp		1166. Design File System.cpp
1167. Minimum Cost to Connect Sticks		1167. Minimum Cost to Connect Sticks
1178. Number of Valid Words for Each Puzzle		1178. Number of Valid Words for Each Puzzle
118. Pascal's Triangle		118. Pascal's Triangle
1182. Shortest Distance to Target Color		1182. Shortest Distance to Target Color
1187. Make Array Strictly Increasing.cpp		1187. Make Array Strictly Increasing.cpp
1189. Maximum Number of Balloons		1189. Maximum Number of Balloons
1192. Critical Connections in a Network		1192. Critical Connections in a Network
1197. Minimum Knight Moves		1197. Minimum Knight Moves
1198. Find Smallest Common Element in All Rows		1198. Find Smallest Common Element in All Rows
12. Integer to Roman		12. Integer to Roman
120. Triangle		120. Triangle
1202. Smallest String With Swaps		1202. Smallest String With Swaps
1207. Unique Number of Occurrences.cpp		1207. Unique Number of Occurrences.cpp
1209. Remove All Adjacent Duplicates in String II		1209. Remove All Adjacent Duplicates in String II
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
1215. Stepping Numbers		1215. Stepping Numbers
1218. Longest Arithmetic Subsequence of Given Difference		1218. Longest Arithmetic Subsequence of Given Difference
122. Best Time to Buy and Sell Stock II		122. Best Time to Buy and Sell Stock II
1220. Count Vowels Permutation		1220. Count Vowels Permutation
1228. Missing Number In Arithmetic Progression		1228. Missing Number In Arithmetic Progression
1229. Meeting Scheduler		1229. Meeting Scheduler
1232. Check If It Is a Straight Line.ts		1232. Check If It Is a Straight Line.ts
1235. Maximum Profit in Job Scheduling.cpp		1235. Maximum Profit in Job Scheduling.cpp
1235. Maximum Profit in Job Scheduling.py		1235. Maximum Profit in Job Scheduling.py
1239. Maximum Length of a Concatenated String with Unique Characters		1239. Maximum Length of a Concatenated String with Unique Characters
124. Binary Tree Maximum Path Sum		124. Binary Tree Maximum Path Sum
1245. Tree Diameter		1245. Tree Diameter
1249. Minimum Remove to Make Valid Parentheses.cpp		1249. Minimum Remove to Make Valid Parentheses.cpp

raiden-02/LeetCode

Folders and files

Latest commit

History

About

Topics

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages