Name		Name	Last commit message	Last commit date
Latest commit History 993 Commits
1. Two Sum		1. Two Sum
1007. Minimum Domino Rotations For Equal Row		1007. Minimum Domino Rotations For Equal Row
1022. Sum of Root To Leaf Binary Numbers		1022. Sum of Root To Leaf Binary Numbers
1026. Maximum Difference Between Node and Ancestor		1026. Maximum Difference Between Node and Ancestor
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		1043. Partition Array for Maximum Sum
1048. Longest String Chain		1048. Longest String Chain
106. Construct Binary Tree from Inorder and Postorder Traversal		106. Construct Binary Tree from Inorder and Postorder Traversal
1094. Car Pooling		1094. Car Pooling
1095. Find in Mountain Array		1095. Find in Mountain Array
11. Container With Most Water		11. Container With Most Water
1122. Relative Sort Array		1122. Relative Sort Array
1137. N-th Tribonacci Number		1137. N-th Tribonacci Number
1143. Longest Common Subsequence		1143. Longest Common Subsequence
1155. Number of Dice Rolls With Target Sum		1155. Number of Dice Rolls With Target Sum
1160. Find Words That Can Be Formed by Characters		1160. Find Words That Can Be Formed by Characters
1174. Immediate Food Delivery II		1174. Immediate Food Delivery II
118. Pascal's Triangle		118. Pascal's Triangle
119. Pascal's Triangle II		119. Pascal's Triangle II
1190. Reverse Substrings Between Each Pair of Parentheses		1190. Reverse Substrings Between Each Pair of Parentheses
1202. Smallest String With Swaps		1202. Smallest String With Swaps
1207. Unique Number of Occurrences		1207. Unique Number of Occurrences
1208. Get Equal Substrings Within Budget		1208. Get Equal Substrings Within Budget
121. Best Time to Buy and Sell Stock		121. Best Time to Buy and Sell Stock
1220. Count Vowels Permutation		1220. Count Vowels Permutation
1233. Remove Sub-Folders from the Filesystem		1233. Remove Sub-Folders from the Filesystem
1235. Maximum Profit in Job Scheduling		1235. Maximum Profit in Job Scheduling
1239. Maximum Length of a Concatenated String with Unique Characters		1239. Maximum Length of a Concatenated String with Unique Characters
1248. Count Number of Nice Subarrays		1248. Count Number of Nice Subarrays
1249. Minimum Remove to Make Valid Parentheses		1249. Minimum Remove to Make Valid Parentheses
1255. Maximum Score Words Formed by Letters		1255. Maximum Score Words Formed by Letters
1260. Shift 2D Grid		1260. Shift 2D Grid
1266. Minimum Time Visiting All Points		1266. Minimum Time Visiting All Points
1269. Number of Ways to Stay in the Same Place After Some Steps		1269. Number of Ways to Stay in the Same Place After Some Steps
1277. Count Square Submatrices with All Ones		1277. Count Square Submatrices with All Ones
1280. Students and Examinations		1280. Students and Examinations
1287. Element Appearing More Than 25% In Sorted Array		1287. Element Appearing More Than 25% In Sorted Array
1288. Remove Covered Intervals		1288. Remove Covered Intervals
129. Sum Root to Leaf Numbers		129. Sum Root to Leaf Numbers
1291. Sequential Digits		1291. Sequential Digits
1305. All Elements in Two Binary Search Trees		1305. All Elements in Two Binary Search Trees
131. Palindrome Partitioning		131. Palindrome Partitioning
1325. Delete Leaves With a Given Value		1325. Delete Leaves With a Given Value
134. Gas Station		134. Gas Station
1342. Number of Steps to Reduce a Number to Zero		1342. Number of Steps to Reduce a Number to Zero
1347. Minimum Number of Steps to Make Two Strings Anagram		1347. Minimum Number of Steps to Make Two Strings Anagram
1351. Count Negative Numbers in a Sorted Matrix		1351. Count Negative Numbers in a Sorted Matrix
1356. Sort Integers by The Number of 1 Bits		1356. Sort Integers by The Number of 1 Bits
1359. Count All Valid Pickup and Delivery Options		1359. Count All Valid Pickup and Delivery Options
136. Single Number		136. Single Number
1361. Validate Binary Tree Nodes		1361. Validate Binary Tree Nodes
1367. Linked List in Binary Tree		1367. Linked List in Binary Tree
1371. Find the Longest Substring Containing Vowels in Even Counts		1371. Find the Longest Substring Containing Vowels in Even Counts
138. Copy List with Random Pointer		138. Copy List with Random Pointer
1383. Maximum Performance of a Team		1383. Maximum Performance of a Team
1394. Find Lucky Integer in an Array		1394. Find Lucky Integer in an Array
1405. Longest Happy String		1405. Longest Happy String
1408. String Matching in an Array		1408. String Matching in an Array
1416. Restore The Array		1416. Restore The Array
142. Linked List Cycle II		142. Linked List Cycle II
1420. Build Array Where You Can Find The Maximum Exactly K Comparisons		1420. Build Array Where You Can Find The Maximum Exactly K Comparisons
1422. Maximum Score After Splitting a String		1422. Maximum Score After Splitting a String
1424. Diagonal Traverse II		1424. Diagonal Traverse II
143. Reorder List		143. Reorder List
1431. Kids With the Greatest Number of Candies		1431. Kids With the Greatest Number of Candies
144. Binary Tree Preorder Traversal		144. Binary Tree Preorder Traversal
1441. Build an Array With Stack Operations		1441. Build an Array With Stack Operations
145. Binary Tree Postorder Traversal		145. Binary Tree Postorder Traversal
1457. Pseudo-Palindromic Paths in a Binary Tree		1457. Pseudo-Palindromic Paths in a Binary Tree
1458. Max Dot Product of Two Subsequences		1458. Max Dot Product of Two Subsequences
1463. Cherry Pickup II		1463. Cherry Pickup II
1464. Maximum Product of Two Elements in an Array		1464. Maximum Product of Two Elements in an Array
1481. Least Number of Unique Integers after K Removals		1481. Least Number of Unique Integers after K Removals
1482. Minimum Number of Days to Make m Bouquets		1482. Minimum Number of Days to Make m Bouquets
1488. Avoid Flood in The City		1488. Avoid Flood in The City
1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree		1489. Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
1496. Path Crossing		1496. Path Crossing
15. 3Sum		15. 3Sum
150. Evaluate Reverse Polish Notation		150. Evaluate Reverse Polish Notation
1502. Can Make Arithmetic Progression From Sequence		1502. Can Make Arithmetic Progression From Sequence
1503. Last Moment Before All Ants Fall Out of a Plank		1503. Last Moment Before All Ants Fall Out of a Plank
151. Reverse Words in a String		151. Reverse Words in a String
1510. Stone Game IV'		1510. Stone Game IV'
1512. Number of Good Pairs		1512. Number of Good Pairs
1514. Path with Maximum Probability		1514. Path with Maximum Probability
1531. String Compression II		1531. String Compression II
1534. Count Good Triplets		1534. Count Good Triplets
1544. Make The String Great		1544. Make The String Great
1545. Find Kth Bit in Nth Binary String		1545. Find Kth Bit in Nth Binary String
1561. Maximum Number of Coins You Can Get		1561. Maximum Number of Coins You Can Get
1578. Minimum Time to Make Rope Colorful		1578. Minimum Time to Make Rope Colorful
1579. Remove Max Number of Edges to Keep Graph Fully Traversable		1579. Remove Max Number of Edges to Keep Graph Fully Traversable
1582. Special Positions in a Binary Matrix		1582. Special Positions in a Binary Matrix
1584. Min Cost to Connect All Points		1584. Min Cost to Connect All Points
1590. Make Sum Divisible by P		1590. Make Sum Divisible by P
16. 3Sum Closest		16. 3Sum Closest
1608. Special Array With X Elements Greater Than or Equal X		1608. Special Array With X Elements Greater Than or Equal X
1609. Even Odd Tree		1609. Even Odd Tree
1614. Maximum Nesting Depth of the Parentheses		1614. Maximum Nesting Depth of the Parentheses

Folders and files

Latest commit

History

Repository files navigation

Leetcode

About

Topics

Resources

Stars

Watchers

Forks

Releases

Packages

Used by

Contributors

Languages