| id | name | points |
|---|---|---|
| 1 | twoSum | |
| 8 | stringToIntegerAtoI | |
| 11 | containerWithMostWaters | |
| 15 | threeSum | |
| 17 | letterCombinationsOfAPhoneNumber | |
| 21 | mergeTwoSortedLists | |
| 22 | generateParentheses | |
| 24 | swapNodesInPairs | |
| 25 | reverseNodesInkGroup | |
| 26 | removeDuplicatesFromSortedArray | |
| 32 | longestValidParentheses | |
| 33 | searchInRotatedSortedArray | |
| 45 | jumpGameII | |
| 46 | permutations | |
| 47 | permutationsII | |
| 49 | groupAnagrams | |
| 50 | powxn | |
| 51 | nQueens | |
| 52 | nQueensII | |
| 53 | maximumSubarray | |
| 55 | jumpGame | |
| 56 | mergeIntervals | |
| 58 | lengthOfLastWord | |
| 62 | uniquePaths | |
| 63 | uniquePathsII | |
| 64 | minimumPathSum | |
| 66 | plusOne | |
| 69 | sqrt | |
| 70 | climbingStairs | |
| 72 | editDistance | |
| 74 | searchA2DMatrix | |
| 77 | combinations | |
| 78 | subsets | |
| 85 | maximalRectangle | |
| 88 | mergeSortedArray | |
| 91 | decodeWays | |
| 94 | binaryTreeInorderTraversal | |
| 98 | validateBinarySearchTree | |
| 102 | binaryTreeLevelOrderTraversal | |
| 104 | maximumDepthOfBinaryTree | |
| 105 | constructBinaryTreeFrom | |
| 111 | minimumDepthOfBinaryTree | |
| 115 | distinctSubsequences | |
| 120 | triangle | |
| 121 | bestTimeToBuyAndSellStock | |
| 122 | bestTimeToBuyAndSellStockII | |
| 123 | bestTimeToBuyAndSellStockIII | |
| 126 | wordLadderII | |
| 127 | wordLadder | |
| 130 | surroundedRegions | |
| 141 | linkedListCycle | |
| 142 | linkedListCycleII | |
| 143 | longestCommonSubsequence | |
| 144 | binaryTreePreorderTraversal | |
| 146 | lruCache | |
| 152 | maximumProductSubarray | |
| 153 | findMinimumInRotatedSortedArray | |
| 169 | majorityElement | |
| 188 | bestTimeToBugAndSellStockIV | |
| 189 | rotateArray | |
| 190 | reverseBits | |
| 191 | numberOf1bits | |
| 198 | houseRobber | |
| 200 | numberOfIslands | |
| 206 | reverseLinkedList | |
| 208 | implementTrie | |
| 212 | wordSearchII | |
| 213 | houseRobberII | |
| 221 | maximalSquare | |
| 226 | invertBinaryTree | |
| 231 | powerOfTwo | |
| 236 | lowestCommonAncestorOfABinaryTree | |
| 242 | validAnagram | |
| 283 | moveZeros | |
| 297 | serializeAndDeserializeBinaryTree | |
| 300 | longestIncreasingSubsequence | |
| 309 | bestTimeToBuyAndSellStockWithCooldown | |
| 322 | coinChange | |
| 338 | countingBits | |
| 363 | maxSumOfRectangleNoLargerThanK | |
| 367 | validPerfectSquare | |
| 387 | firstUniqueCharacterInAString | |
| 403 | frogJump | |
| 429 | naryTreeLevelOrderTraveral | |
| 433 | minimumGeneticMutation | |
| 455 | assignCookies | |
| 493 | reversePairs | |
| 509 | fibonacciNumber | |
| 515 | findLargestValueInEachTreeRow | |
| 529 | mineSweeper | |
| 547 | friendCircles | |
| 589 | naryTreePreorderTraversal | |
| 590 | naryTreePostorderTraversal | |
| 709 | toLowerCase | |
| 771 | jewelsAndStones | |
| 714 | bestTimeToBuyAndSellStockWithTransactionFee | |
| 746 | minCostClimbingStairs | |
| 860 | lemonadeChange | |
| 874 | walkingRobotSimulation | |
| 1122 | relativeSortArray |
Join GitHub today
GitHub is home to over 50 million developers working together to host and review code, manage projects, and build software together.
Sign upmaster
Code
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching GitHub Desktop
If nothing happens, download GitHub Desktop and try again.
Launching Xcode
If nothing happens, download Xcode and try again.
Launching Visual Studio
If nothing happens, download the GitHub extension for Visual Studio and try again.
Latest commit
Git stats
Files
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
README.md
About
My leetcode solutions.
Topics
Resources
Releases
No releases published
Packages 0
No packages published

Formed in 2009, the Archive Team (not to be confused with the archive.org Archive-It Team) is a rogue archivist collective dedicated to saving copies of rapidly dying or deleted websites for the sake of history and digital heritage. The group is 100% composed of volunteers and interested parties, and has expanded into a large amount of related projects for saving online and digital history.
