Leetcode 300+! Use java to implement leetcode, the problems include array, backtracking algorithm, binary search, Bit Manipulation, depth first search, design, dynamic programming, greedy algorithm, heap, math, stack, string, tree, trie, two pointers, hash table, linked list, sort, etc. In this project, the file naming format is: problem number _ title name _ difficulty (difficulty = 1, 2, 3)
- 1_TwoSum
- 26_RemoveDuplicatesfromSortedArray_1.java
- 27_RemoveElement_1.java
- 35_SearchInsertPosition_1.java
- 53_MaximumSubarray_1.java
- 66_PlusOne_1.java
- 88_MergeSortedArray_1.java
- 118_PascalsTriangle_1
- 119_PascalTriangleII_1
- 122_BestTimetoBuyandSellStockII_1
- 167_TwoSumII-Inputarrayissorted_1
- 169_MajorityElement_1
- 217_ContainsDuplicate_1
- 219_ContainsDuplicateII_1
- 269_MissingNumber_1
- 280_InsertDeleteGetRandomO(1)_1
- 283_MoveZeroes_1
- 414_ThirdMaximumNumber_1
- 448_FindAllNumbersDisappearedinanArray_1
- 485_MaxConsecutiveOnes_1
- 532_K-diffPairsinanArray_1
- 561_ArrayPartitionI_1
- 566_ReshapetheMatrix_1
- 581_ShortestUnsortedContinuousSubarray_1
- 605_CanPlaceFlowers_1
- 621_TaskScheduler_1
- 643_MaximumAverageSubarrayI_1
- 674_LongestContinuousIncreasingSubsequence_1
- 724_FindPivoIndex_1
- 766_ToeplitzMatrix_1
- 840_MagicSquaresInGrid_1
- 849_MaximizeDistancetoClosestPerson_1
- 867_TransposeMatrix_1
- 888_FairCandySwap_1
- 896_MonotonicArray_1
- 905_SortArrayByParity_1
- 914_XofaKindinaDeckofCards_1
- 922_SortArrayByParityII_1
- 941_ValidMountainArray_1
- 977_SquaresofaSortedArray_1
- 989_AddtoArray-FormofInteger_1
- 1002_FindCommonCharacters_1
- 11_ContainerWithMostWater
- 15_3Sum_2.java
- 16_3SumClosest_2.java
- 18_4Sum_2.java
- 31_NextPermutation_2.java
- 33_SearchinRotatedSortedArray_2.java
- 34_FindFirstandLastPositionofElementinSortedArray_2.java
- 56_MergeIntervals_2.java
- 74_Searcha2DMatrix_2.java
- 75_SortColors_2.java
- 80_RemoveDuplicatesfromSortedArrayII_2.java
- 81_SearchinRotatedSortedArrayII_2.java
- 105_ConstructBinaryTreefromPreorderandInorderTraversal_2.java
- 106_ConstructBinaryTreefromInorderandPostorderTraversal_2
- 153_FindMinimuminRotatedSortedArray_2
- 162_FindPeakElement_2
- 209_MinimumSizeSubarraySum_2
- 287_FindtheDuplicateNumber_2
- 442_FindAllDuplicatesinanArray_2
- 560_SubarraySumEqualsK_2
- 670_MaximumSwap_2
- 974_SubarraySumsDivisiblebyK_2
- 1011_CapacityToShipPackagesWithinDDays_2
- 190_ReverseBits_1
- 191_Numberof1Bits_1
- 371_SumofTwoIntegers_1
- 405_ConvertaNumbertoHexadecimal_1
- 461_HammingDistance_1
- 476_NumberComplement_1
- 693_BinaryNumberwithAlternatingBits_1
- 208_ImplementTrie(PrefixTree)_2
- 211_AddandSearchWord-Datastructuredesign_2
- 380_InsertDeleteGetRandomO(1)_2
- 622_DesignCircularQueue_2
- 641_DesignCircularDeque_2
- 95_UniqueBinarySearchTreesII_2
- 96_UniqueBinarySearchTrees_2
- 264_UglyNumberII_2
- 300_LongestIncreasingSubsequence_2
- 392_IsSubsequence_2
- 763_PartitionLabels_2
- 881_BoatstoSavePeople_2
- 921_MinimumAddtoMakeParenthesesValid_2
- 984_StringWithoutAAAorBBB_2
- 594_LongestHarmoniousSubsequence_1
- 599_MinimumIndexSumofTwoLists_1
- 136_SingleNumber_1
- 205_IsomorphicStrings_1
- 290_WordPattern_1
- 389_FindtheDifference_1
- 409_LongestPalindrome_1
- 438_FindAllAnagramsinaString_1
- 690_EmployeeImportance_1
- 705_DesignHashSet_1
- 706_DesignHashMap_1
- 720_LongestWordinDictionary_1
- 748_ShortestCompletingWord_1
- 771_JewelsandStones_1
- 811_SubdomainVisitCount_1
- 884_UncommonWordsfromTwoSentences_1
- 463_IslandPerimeter_1
- 500_KeyboardRow_1
- 575_DistributeCandies_1
- 953_VerifyinganAlienDictionary_1
- 961_N-RepeatedElementinSize2NArray_1
- 454_4SumII_2
- 36_ValidSudoku_2
- 138_CopyListwithRandomPointer_2
- 187_RepeatedDNASequences_2
- 207_CourseSchedule_2
- 299_BullsandCows_2
- 648_ReplaceWords_2
- 676_ImplementMagicDictionary_2
- 739_DailyTemperatures_2
- 930_BinarySubarraysWithSum_2
- 215_KthLargestElementinanArray_2
- 347_TopKFrequentElements_2
- 373_FindKPairswithSmallestSums_2
- 378_KthSmallestElementinaSortedMatrix_2
- 451_SortCharactersByFrequency_2
- 692_TopKFrequentWords_2
- 767_ReorganizeString_2
- 21_MergeTwoSortedLists_1
- 83_RemoveDuplicatesfromSortedList_1
- 876_MiddleoftheLinkedList_1
- 160_IntersectionofTwoLinkedLists_1
- 203_RemoveLinkedListElements_1
- 206_ReverseLinkedList_1
- 237_DeleteNodeinaLinkedList_1
- 707_DesignLinkedList_1
- 24_SwapNodesinPairs_2
- 82_RemoveDuplicatesfromSortedListII_2
- 92_ReverseLinkedListII_2
- 143_ReorderList_2
- 328_OddEvenLinkedList_2
- 430_FlattenaMultilevelDoublyLinkedList_2
- 445_AddTwoNumbersII_2
- 725_SplitLinkedListinParts_2
- 817_LinkedListComponents_2
- 7_ReverseInteger_1
- 9_PalindromeNumber_1
- 13_RomantoInteger_1
- 67_AddBinary_1
- 69_Sqrt(x)_1
- 202_HappyNumber_1
- 204_CountPrimes_1
- 231_PowerofTwo_1
- 258_AddDigits_1
- 263_UglyNumber_1
- 268_MissingNumber_1
- 326_PowerofThree_1
- 367_ValidPerfectSquare_1
- 441_ArrangingCoins_1
- 507_PerfectNumber_1
- 728_SelfDividingNumbers_1
- 645_SetMismatch_1
- 970_PowerfulIntegers_1
- 2_AddTwoNumbers_2
- 12_IntegertoRoman_2
- 29_DivideTwoIntegers_2
- 43_MultiplyStrings_2
- 50_Pow(x,n)_2
- 60_PermutationSequence_2
- 264_UglyNumberII_2
- 313_SuperUglyNumber_2
- 535_EncodeandDecodeTinyURL_2
- 781_RabbitsinForest_2
- 991_BrokenCalculator_2
- 147_InsertionSortList_2
- 148_SortList_2
- 220_ContainsDuplicateIII_2
- 274_H-Index_2
- 524_LongestWordinDictionarythroughDeleting_2
- 973_KClosestPointstoOrigin_2
- 155_MinStack_1
- 225_ImplementStackusingQueues_1
- 232_ImplementQueueusingStacks_1
- 496_NextGreaterElementI_1
- 682_BaseballGame_1
- 1021_RemoveOutermostParentheses_1
- 1047_RemoveAllAdjacentDuplicatesInString_1
- 150_EvaluateReversePolishNotation_2
- 503_NextGreaterElementII_2
- 735_AsteroidCollision_2
- 946_ValidateStackSequences_2
- 1019_NextGreaterNodeInLinkedList_2
- 13_RomantoInteger_1
- 14_LongestCommonPrefix_1
- 20_ValidParentheses_1
- 28_ImplementstrStr()_1
- 38_CountandSay_1
- 58_LengthofLastWord_1
- 67_AddBinary_1
- 125_ValidPalindrome_1
- 344_ReverseString_1
- 345_ReverseVowelsofaString_1
- 383_RansomNote_1
- 387_.FirstUniqueCharacterinaString_1
- 415_AddStrings_1
- 434_NumberofSegmentsinaString_1
- 443_StringCompression_1
- 520_DetectCapital_1
- 541_ReverseStringII_1
- 551_StudentAttendanceRecordI_1
- 557_ReverseWordsinaStringIII_1
- 657_RobotReturntoOrigin_1
- 680_ValidPalindromeII_1
- 709_ToLowerCase_1
- 788_RotatedDigits_1
- 804_UniqueMorseCodeWords_1
- 819_MostCommonWord_1
- 824_GoatLatin_1
- 859_BuddyStrings_1
- 917_ReverseOnlyLetters_1
- 925_LongPressedName_1
- 929_UniqueEmailAddresses_1
- 3_LongestSubstringWithoutRepeatingCharacters_2
- 6._ZigZagConversion_2
- 12_IntegertoRoman_2
- 43_MultiplyStrings_2
- 49_GroupAnagrams_2
- 71_SimplifyPath_2
- 609_FindDuplicateFileinSystem_2
- 767_ReorganizeString_2
- 856_ScoreofParentheses_2
- 1003_CheckIfWordIsValidAfterSubstitutions_2
- 100_SameTree_1
- 101_SymmetricTree_1
- 104_MaximumDepthofBinaryTree_1
- 107_BinaryTreeLevelOrderTraversalII_1
- 108_ConvertSortedArraytoBinarySearchTree_1
- 110_BalancedBinaryTree_1
- 111_MinimumDepthofBinaryTree_1
- 112_PathSum_1
- 235_LowestCommonAncestorofaBinarySearchTree_1
- 257_BinaryTreePaths_1
- 404_SumofLeftLeaves_1
- 429_N-aryTreeLevelOrderTraversal_1
- 437_PathSumIII_1
- 501_FindModeinBinarySearchTree_1
- 226_InvertBinaryTree_1
- 530_MinimumAbsoluteDifferenceinBST_1
- 538_ConvertBSTtoGreaterTree_1
- 543_DiameterofBinaryTree_1
- 559_MaximumDepthofN-aryTree_1
- 563_BinaryTreeTilt_1
- 572_SubtreeofAnotherTree_1
- 589_N-aryTreePreorderTraversal_1
- 590_N-aryTreePostorderTraversal_1
- 617_MergeTwoBinaryTrees_1
- 637_AverageofLevelsinBinaryTree_1
- 653_TwoSumIV-InputisaBST_1
- 671_SecondMinimumNodeInaBinaryTree_1
- 700_SearchinaBinarySearchTree_1
- 783_MinimumDistanceBetweenBSTNodes_1
- 872_Leaf-SimilarTrees_1
- 897_IncreasingOrderSearchTree_1
- 938_RangeSumofBST_1
- 965_UnivaluedBinaryTree_1
- 993_CousinsinBinaryTree_1
- 1022_SumofRootToLeafBinaryNumbers_1
- 94_BinaryTreeInorderTraversal_2
- 95_UniqueBinarySearchTreesII_2
- 96_UniqueBinarySearchTrees_2
- 98_ValidateBinarySearchTree_2
- 102_BinaryTreeLevelOrderTraversal_2
- 103_BinaryTreeZigzagLevelOrderTraversal_2
- 105_ConstructBinaryTreefromPreorderandInorderTraversal_2
- 106_ConstructBinaryTreefromInorderandPostorderTraversal_2
- 113_PathSumII_2
- 114_FlattenBinaryTreetoLinkedList_2
- 116_PopulatingNextRightPointersinEachNode_2
- 117_PopulatingNextRightPointersinEachNodeII_2
- 129_SumRoottoLeafNumbers_2
- 144_BinaryTreePreorderTraversal_2
- 173_BinarySearchTreeIterator_2
- 199_BinaryTreeRightSideView_2
- 222_CountCompleteTreeNodes_2
- 230_KthSmallestElementinaBST_2
- 236_LowestCommonAncestorofaBinaryTree_2
- 513_FindBottomLeftTreeValue_2
- 515_FindLargestValueinEachTreeRow_2
- 623_AddOneRowtoTree_2
- 662_MaximumWidthofBinaryTree_2
- 701_InsertintoaBinarySearchTree_2
- 1008_ConstructBinarySearchTreefromPreorderTraversal_2