GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — GitHub - threec/leetcode: You have solved 144/144 problems.

BranchesTags
Open more actions menu
 
 

Latest commit

 

History

227 Commits
227 Commits

Folders and files

NameName
Last commit message
Last commit date
3Sum
3Sum
 
 
3SumClosest
3SumClosest
 
 
4Sum
4Sum
 
 
AddBinary
AddBinary
 
 
AddTwoNumbers
AddTwoNumbers
 
 
Anagrams
Anagrams
 
 
BalancedBinaryTree
BalancedBinaryTree
 
 
BestTimetoBuyandSellStock
BestTimetoBuyandSellStock
 
 
BestTimetoBuyandSellStockII
BestTimetoBuyandSellStockII
 
 
BestTimetoBuyandSellStockIII
BestTimetoBuyandSellStockIII
 
 
BinaryTreeInorderTraversal
BinaryTreeInorderTraversal
 
 
BinaryTreeLevelOrderTraversal
BinaryTreeLevelOrderTraversal
 
 
BinaryTreeLevelOrderTraversalII
BinaryTreeLevelOrderTraversalII
 
 
BinaryTreeMaximumPathSum
BinaryTreeMaximumPathSum
 
 
BinaryTreePostorderTraversal
BinaryTreePostorderTraversal
 
 
BinaryTreePreorderTraversal
BinaryTreePreorderTraversal
 
 
BinaryTreeZigzagLevelOrderTraversal
BinaryTreeZigzagLevelOrderTraversal
 
 
ClimbingStairs
ClimbingStairs
 
 
CloneGraph
CloneGraph
 
 
CombinationSum
CombinationSum
 
 
CombinationSumII
CombinationSumII
 
 
Combinations
Combinations
 
 
ConstructBinaryTreefromInorderandPostorderTraversal
ConstructBinaryTreefromInorderandPostorderTraversal
 
 
ConstructBinaryTreefromPreorderandInorderTraversal
ConstructBinaryTreefromPreorderandInorderTraversal
 
 
ContainerWithMostWater
ContainerWithMostWater
 
 
ConvertSortedArraytoBinarySearchTree
ConvertSortedArraytoBinarySearchTree
 
 
ConvertSortedListtoBinarySearchTree
ConvertSortedListtoBinarySearchTree
 
 
CountandSay
CountandSay
 
 
DecodeWays
DecodeWays
 
 
DistinctSubsequences
DistinctSubsequences
 
 
DivideTwoIntegers
DivideTwoIntegers
 
 
EditDistance
EditDistance
 
 
EvaluateReversePolishNotation
EvaluateReversePolishNotation
 
 
FirstMissingPositive
FirstMissingPositive
 
 
FlattenBinaryTreetoLinkedList
FlattenBinaryTreetoLinkedList
 
 
GenerateParentheses
GenerateParentheses
 
 
GrayCode
GrayCode
 
 
ImplementstrStr
ImplementstrStr
 
 
InsertInterval
InsertInterval
 
 
IntegertoRoman
IntegertoRoman
 
 
InterleavingString
InterleavingString
 
 
JumpGame
JumpGame
 
 
JumpGameII
JumpGameII
 
 
LRUCache
LRUCache
 
 
LargestRectangleinHistogram
LargestRectangleinHistogram
 
 
LengthofLastWord
LengthofLastWord
 
 
LetterCombinationsofaPhoneNumber
LetterCombinationsofaPhoneNumber
 
 
LongestCommonPrefix
LongestCommonPrefix
 
 
LongestConsecutiveSequence
LongestConsecutiveSequence
 
 
LongestPalindromicSubstring
LongestPalindromicSubstring
 
 
LongestSubstringWithoutRepeatingCharacters
LongestSubstringWithoutRepeatingCharacters
 
 
LongestValidParentheses
LongestValidParentheses
 
 
MaxPointsOnALine
MaxPointsOnALine
 
 
MaximalRectangle
MaximalRectangle
 
 
MaximumDepthofBinaryTree
MaximumDepthofBinaryTree
 
 
MaximumProductSubarray
MaximumProductSubarray
 
 
MaximumSubarray
MaximumSubarray
 
 
MedianofTwoSortedArrays
MedianofTwoSortedArrays
 
 
MergeIntervals
MergeIntervals
 
 
MergeSortedArray
MergeSortedArray
 
 
MergeTwoSortedLists
MergeTwoSortedLists
 
 
MergekSortedLists
MergekSortedLists
 
 
MinimumDepthofBinaryTree
MinimumDepthofBinaryTree
 
 
MinimumPathSum
MinimumPathSum
 
 
MinimumWindowSubstring
MinimumWindowSubstring
 
 
MultiplyStrings
MultiplyStrings
 
 
N-Queens
N-Queens
 
 
N-QueensII
N-QueensII
 
 
NextPermutation
NextPermutation
 
 
PalindromeNumber
PalindromeNumber
 
 
PalindromePartitioning
PalindromePartitioning
 
 
PalindromePartitioningII
PalindromePartitioningII
 
 
PartitionList
PartitionList
 
 
Pascal'sTriangle
Pascal'sTriangle
 
 
Pascal'sTriangleII
Pascal'sTriangleII
 
 
PathSum
PathSum
 
 
PathSumII
PathSumII
 
 
PermutationSequence
PermutationSequence
 
 
Permutations
Permutations
 
 
PermutationsII
PermutationsII
 
 
PlusOne
PlusOne
 
 
PopulatingNextRightPointersinEachNode
PopulatingNextRightPointersinEachNode
 
 
PopulatingNextRightPointersinEachNodeII
PopulatingNextRightPointersinEachNodeII
 
 
Pow(x, n)
Pow(x, n)
 
 
RecoverBinarySearchTree
RecoverBinarySearchTree
 
 
RegularExpressionMatching
RegularExpressionMatching
 
 
RemoveDuplicatesfromSortedArray
RemoveDuplicatesfromSortedArray
 
 
RemoveDuplicatesfromSortedArrayII
RemoveDuplicatesfromSortedArrayII
 
 
RemoveDuplicatesfromSortedList
RemoveDuplicatesfromSortedList
 
 
RemoveDuplicatesfromSortedListII
RemoveDuplicatesfromSortedListII
 
 
RemoveElement
RemoveElement
 
 
RemoveNthNodeFromEndofList
RemoveNthNodeFromEndofList
 
 
RestoreIPAddresses
RestoreIPAddresses
 
 
ReverseInteger
ReverseInteger
 
 
ReverseLinkedListII
ReverseLinkedListII
 
 
ReverseNodesink-Group
ReverseNodesink-Group
 
 
ReverseWordsInAString
ReverseWordsInAString
 
 
RomantoInteger
RomantoInteger
 
 
RotateImage
RotateImage
 
 
RotateList
RotateList
 
 

Repository files navigation

leetcode Total views

Solution set for LeetCode.

The commit message of each problem stands for it's difficulty index, which means:

  • 1 Easy
  • 2 Normal
  • 3 Medium
  • 4 Hard
  • 5 Much Harder

If you have found any method to optimize those solutions, please feel free to get in touch via [email protected].

LICENSE

No LICENSE, you can use it for any purpose.

About

You have solved 144/144 problems.

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors

Languages

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.