GitHub - tommengdel/Leetcode

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 52 Commits
DoInMSTR		DoInMSTR
.gitattributes		.gitattributes
.gitignore		.gitignore
3Sum.cpp		3Sum.cpp
3SumClosest.cpp		3SumClosest.cpp
4Sum.cpp		4Sum.cpp
AddTwoNumbers.cpp		AddTwoNumbers.cpp
Anagrams.cpp		Anagrams.cpp
BalancedBinaryTree.cpp		BalancedBinaryTree.cpp
BestBuyAndSell.cpp		BestBuyAndSell.cpp
BestBuyAndSell_II.cpp		BestBuyAndSell_II.cpp
BestTimetoBuyandSellStockIII.cpp		BestTimetoBuyandSellStockIII.cpp
BinaryTreeInorder.cpp		BinaryTreeInorder.cpp
BinaryTreeLevelOrder.cpp		BinaryTreeLevelOrder.cpp
BinaryTreeLevelOrderII.cpp		BinaryTreeLevelOrderII.cpp
BinaryTreeMaximumPathSum.cpp		BinaryTreeMaximumPathSum.cpp
BinaryTreeZigzagLevelOrder.cpp		BinaryTreeZigzagLevelOrder.cpp
CombinationSum.cpp		CombinationSum.cpp
CombinationSumII-Solution2.cpp		CombinationSumII-Solution2.cpp
CombinationSumII.cpp		CombinationSumII.cpp
Combinations.cpp		Combinations.cpp
ConstructBinaryTreeFromInorderandPostorder.cpp		ConstructBinaryTreeFromInorderandPostorder.cpp
ConstructBinaryTreeFromPreorderAndInorderTraversal.cpp		ConstructBinaryTreeFromPreorderAndInorderTraversal.cpp
ContainerWithMostWater.cpp		ContainerWithMostWater.cpp
ConvertSortedListToBinarySearchTree.cpp		ConvertSortedListToBinarySearchTree.cpp
ConvertedSortedArrayToBST.cpp		ConvertedSortedArrayToBST.cpp
DecodeWays.cpp		DecodeWays.cpp
DistinctSubsequence.cpp		DistinctSubsequence.cpp
DivideIntegers.cpp		DivideIntegers.cpp
EditDistance.cpp		EditDistance.cpp
FlattenBinaryTreetoLinkedList.cpp		FlattenBinaryTreetoLinkedList.cpp
InsertIntervals.cpp		InsertIntervals.cpp
JumpGameII.cpp		JumpGameII.cpp
LargestRectangleinHistogram.cpp		LargestRectangleinHistogram.cpp
LengthOfLastword.cpp		LengthOfLastword.cpp
LetterCombinationOfaPhoneNumber.cpp		LetterCombinationOfaPhoneNumber.cpp
LevelOrder.cpp		LevelOrder.cpp
LinkedListCycleII.cpp		LinkedListCycleII.cpp
LongestCommonPrefix.cpp		LongestCommonPrefix.cpp
LongestConsecuitiveSequence.cpp		LongestConsecuitiveSequence.cpp
LongestPalindromicSubstring.cpp		LongestPalindromicSubstring.cpp
LongestValidParentheses.cpp		LongestValidParentheses.cpp
MaximalRectangle.cpp		MaximalRectangle.cpp
MaximumDepthofBinaryTree.cpp		MaximumDepthofBinaryTree.cpp
MedianofTwoSortedArray.cpp		MedianofTwoSortedArray.cpp
MergeIntervals.cpp		MergeIntervals.cpp
MergeTwoSortedList.cpp		MergeTwoSortedList.cpp
MinimumDepthofBinaryTree.cpp		MinimumDepthofBinaryTree.cpp
MinimumWindowSubstring-2.cpp		MinimumWindowSubstring-2.cpp
MinimumWindowSubstring.cpp		MinimumWindowSubstring.cpp
NQueenII.cpp		NQueenII.cpp
NextPermutation.cpp		NextPermutation.cpp
PalindromeNumber.cpp		PalindromeNumber.cpp
PalindromePartitioning.cpp		PalindromePartitioning.cpp
PalindromePartitioningII.cpp		PalindromePartitioningII.cpp
PascalTriangle.cpp		PascalTriangle.cpp
PascalTriangleII.cpp		PascalTriangleII.cpp
PathSum.cpp		PathSum.cpp
PathSumII.cpp		PathSumII.cpp
Permutation.cpp		Permutation.cpp
PermutationII.cpp		PermutationII.cpp
PlusOne.cpp		PlusOne.cpp
PlusOne.o		PlusOne.o
PopulatingNextRightPointersInEachNode.cpp		PopulatingNextRightPointersInEachNode.cpp
PopulatingNextRightPointersInEachNodeII.cpp		PopulatingNextRightPointersInEachNodeII.cpp
Pow.cpp		Pow.cpp
Preorder.cpp		Preorder.cpp
ReadMe		ReadMe
RecoverBinarySearchTree.cpp		RecoverBinarySearchTree.cpp
RemoveDuplicatesFromArrayII.cpp		RemoveDuplicatesFromArrayII.cpp
RemoveDuplicatesFromSortedList.cpp		RemoveDuplicatesFromSortedList.cpp
RemoveDuplicatesFromSortedListII.cpp		RemoveDuplicatesFromSortedListII.cpp
ReorderList.cpp		ReorderList.cpp
RestoreIPAdress.cpp		RestoreIPAdress.cpp
ReverseInteger.cpp		ReverseInteger.cpp
RotateList.cpp		RotateList.cpp
SameTree.cpp		SameTree.cpp
ScrambleString.cpp		ScrambleString.cpp
SearchA2DMatrix.cpp		SearchA2DMatrix.cpp
SearchForARange.cpp		SearchForARange.cpp
SearchInRotateArrayII.cpp		SearchInRotateArrayII.cpp
SearchInRotateArrayII.o		SearchInRotateArrayII.o
SetMatrixZeroes.cpp		SetMatrixZeroes.cpp
SimplePath.cpp		SimplePath.cpp
SortColors.cpp		SortColors.cpp
Sqrt.cpp		Sqrt.cpp
Subsets.cpp		Subsets.cpp
SubsetsII.cpp		SubsetsII.cpp
SudokuSolver.cpp		SudokuSolver.cpp
SumRoottoLeafNumbers.cpp		SumRoottoLeafNumbers.cpp
SurroundRegionData		SurroundRegionData
SurrounedRegion.cpp		SurrounedRegion.cpp
SurrounedRegionBFSAndHashSet.cpp		SurrounedRegionBFSAndHashSet.cpp
SurrounedRegionErrordata.cpp		SurrounedRegionErrordata.cpp
SwapNodesInPairs.cpp		SwapNodesInPairs.cpp
SymmetricTree.cpp		SymmetricTree.cpp
TextJustification.cpp		TextJustification.cpp
TrappingRainWater.cpp		TrappingRainWater.cpp
ValidNumber.cpp		ValidNumber.cpp
ValidPalindrome.cpp		ValidPalindrome.cpp

Repository files navigation

1. hard to implement
   Rotate List
   WildCard Matching: Time Limit Exceeded
   ZigZag Conversion
   Longest Palindrome Substring
2. beautiful algorithm
   Jump GameII: I find a good algorithm
   Longest Valid Parentheses!!
   Decode Ways (recursion and Dynamic Programming)
3.Hard Problem
  WildCard Matching (try twice and fail)  Time Limit
  Surrounded Region(Big data- runtime error)
  Subsets
4. Recursion
   Flatten binary Tree to Linked List (Follow UP: If we don't use recursion?)

5 need to print 
  Minimum Window Substring

6 Serious Mistake 
  Median of Two Sorted Array.

7. Backtrack 
   Unique Binary Search Tree
   Word Search 
8 error-prone
  PathSum
  Reverse Linked List II
  Generate Parenthesis
  Construct Binary Tree from inorder and postorder 
9. incorrect 
   WildCard Matching
10 Code Beautiful
   Word Search
   Search the rotated Array II
   Level Order
11 Dynamic Programmin
    minimum path sum(try compress the space)