@@ -54,89 +54,89 @@ Languages used: Java and Python
5454
5555### [ Bit Manipulation] ( ./BitManipulation )
5656
57- - [ title ] ( BitManipulation/SingleNumber2 )
58- - [ title ] ( BitManipulation/TotalHammingDistance )
57+ - [ Single Number II ] ( BitManipulation/SingleNumber2 )
58+ - [ Total Hamming Distance ] ( BitManipulation/TotalHammingDistance )
5959
6060### [ Dynamic Programming] ( ./DynamicProgramming )
6161
62- - [ title ] ( DynamicProgramming/ClimbingStairs )
63- - [ title ] ( DynamicProgramming/CountSquareWithOnes )
64- - [ title ] ( DynamicProgramming/HouseRobber )
65- - [ title ] ( DynamicProgramming/LongestIncreasingSubsequence )
66- - [ title ] ( DynamicProgramming/LongestPalindromicSubstring )
67- - [ title ] ( DynamicProgramming/MaximumLengthPairChain )
68- - [ title ] ( DynamicProgramming/NumberOfIslands )
69- - [ title ] ( DynamicProgramming/PalindromicSubstrings )
70- - [ title ] ( DynamicProgramming/PredictWinner )
71- - [ title ] ( DynamicProgramming/ReducingDishes )
72- - [ title ] ( DynamicProgramming/RegexMatching )
73- - [ title ] ( DynamicProgramming/UniquePaths )
62+ - [ Climbing Stairs ] ( DynamicProgramming/ClimbingStairs )
63+ - [ Count Square With Ones ] ( DynamicProgramming/CountSquareWithOnes )
64+ - [ House Robber ] ( DynamicProgramming/HouseRobber )
65+ - [ Longest Increasing Subsequence ] ( DynamicProgramming/LongestIncreasingSubsequence )
66+ - [ Longest Palindromic Substring ] ( DynamicProgramming/LongestPalindromicSubstring )
67+ - [ Maximum Length Pair Chain ] ( DynamicProgramming/MaximumLengthPairChain )
68+ - [ Number Of Islands ] ( DynamicProgramming/NumberOfIslands )
69+ - [ Palindromic Substrings ] ( DynamicProgramming/PalindromicSubstrings )
70+ - [ Predict Winner ] ( DynamicProgramming/PredictWinner )
71+ - [ Reducing Dishes ] ( DynamicProgramming/ReducingDishes )
72+ - [ Regex Matching ] ( DynamicProgramming/RegexMatching )
73+ - [ Unique Paths ] ( DynamicProgramming/UniquePaths )
7474
7575### [ Graph] ( ./Graph )
7676
77- - [ title ] ( Graph/AllPathsFromSrcToTarget )
78- - [ title ] ( Graph/CourseSchedule2 )
79- - [ title ] ( Graph/EscapeLargeMaze )
80- - [ title ] ( Graph/NumToMakeNetworkConnected )
81- - [ title ] ( Graph/ReconstructItinerary )
82- - [ title ] ( Graph/SurroundedRegions )
77+ - [ All Paths From Src To Target ] ( Graph/AllPathsFromSrcToTarget )
78+ - [ Course Schedule II ] ( Graph/CourseSchedule2 )
79+ - [ Escape Large Maze ] ( Graph/EscapeLargeMaze )
80+ - [ Number to Make Network Connected ] ( Graph/NumToMakeNetworkConnected )
81+ - [ Reconstruct Itinerary ] ( Graph/ReconstructItinerary )
82+ - [ Surrounded Regions ] ( Graph/SurroundedRegions )
8383
8484### [ Greedy] ( ./Greedy )
8585
86- - [ title ] ( Greedy/AssignCookies )
87- - [ title ] ( Greedy/CarPooling )
88- - [ title ] ( Greedy/MaximizeSumAfterKNegations )
89- - [ title ] ( Greedy/MaximumScoreWords )
90- - [ title ] ( Greedy/ScoreAfterFlippingMatrix )
86+ - [ Assign Cookies ] ( Greedy/AssignCookies )
87+ - [ Car Pooling ] ( Greedy/CarPooling )
88+ - [ Maximize Sum after K Negations ] ( Greedy/MaximizeSumAfterKNegations )
89+ - [ Maximum Score Words ] ( Greedy/MaximumScoreWords )
90+ - [ Score After Flipping Matrix ] ( Greedy/ScoreAfterFlippingMatrix )
9191
9292### [ LinkedList] ( ./LinkedList )
9393
94- - [ title ] ( LinkedList/DesignLinkedList )
95- - [ title ] ( LinkedList/LinkedListCycle2 )
96- - [ title ] ( LinkedList/ReverseLinkedList2 )
97- - [ title ] ( LinkedList/SwapNodesInPairs )
94+ - [ Design Linked List ] ( LinkedList/DesignLinkedList )
95+ - [ Linked List Cycle II ] ( LinkedList/LinkedListCycle2 )
96+ - [ Reverse Linked List II ] ( LinkedList/ReverseLinkedList2 )
97+ - [ Swap Nodes in Pairs ] ( LinkedList/SwapNodesInPairs )
9898
9999### [ Math] ( ./Math )
100100
101- - [ title ] ( Math/FindMinNumFibNumSumK )
102- - [ title ] ( Math/HappyNumber )
103- - [ title ] ( Math/MaximumSwap )
104- - [ title ] ( Math/PerfectSquares )
105- - [ title ] ( Math/SqrtX )
101+ - [ Find the Minimum Number of Fibonacci Numbers Whose Sum Is K ] ( Math/FindMinNumFibNumSumK )
102+ - [ Happy Number ] ( Math/HappyNumber )
103+ - [ Maximum Swap ] ( Math/MaximumSwap )
104+ - [ Perfect Squares ] ( Math/PerfectSquares )
105+ - [ Square Root X ] ( Math/SqrtX )
106106
107107### [ Recursion] ( ./Recursion )
108108
109- - [ title ] ( Recursion/Combinations )
110- - [ title ] ( Recursion/Permutations )
111- - [ title ] ( Recursion/Permutations2 )
112- - [ title ] ( Recursion/PermutationSequence )
109+ - [ Combinations ] ( Recursion/Combinations )
110+ - [ Permutations ] ( Recursion/Permutations )
111+ - [ Permutations II ] ( Recursion/Permutations2 )
112+ - [ Permutation Sequence ] ( Recursion/PermutationSequence )
113113
114114### [ Stack] ( ./Stack )
115115
116- - [ title ] ( Stack/AsteroidCollision )
117- - [ title ] ( Stack/BackspaceStringCompare )
118- - [ title ] ( Stack/MinimumAddtoMakeParenthesesValid )
119- - [ title ] ( Stack/ReverseSubstringsBetweenParentheses )
116+ - [ Asteroid Collision ] ( Stack/AsteroidCollision )
117+ - [ Backspace String Compare ] ( Stack/BackspaceStringCompare )
118+ - [ Minimum Add to Make Parentheses Valid ] ( Stack/MinimumAddtoMakeParenthesesValid )
119+ - [ Reverse Substrings Between Parentheses ] ( Stack/ReverseSubstringsBetweenParentheses )
120120
121121### [ String] ( ./String )
122122
123- - [ title ] ( String/IsomorphicStrings )
124- - [ title ] ( String/LongestCommonPrefix )
125- - [ title ] ( String/MinStepsToMakeTwoStringsAnagram )
126- - [ title ] ( String/RearrangeWordsInSentence )
127- - [ title ] ( String/StringMatchingInArray )
123+ - [ Isomorphic Strings ] ( String/IsomorphicStrings )
124+ - [ Longest Common Prefix ] ( String/LongestCommonPrefix )
125+ - [ Minimum Steps to Make Two Strings Anagram ] ( String/MinStepsToMakeTwoStringsAnagram )
126+ - [ Rearrange Words in Sentence ] ( String/RearrangeWordsInSentence )
127+ - [ String Matching in Array ] ( String/StringMatchingInArray )
128128
129129### [ Tree] ( ./Tree )
130130
131- - [ title ] ( Tree/AllElementsInTwoBSTs )
132- - [ title ] ( Tree/BinaryPostorder )
133- - [ title ] ( Tree/CheckValidTreeGivenEdges )
134- - [ title ] ( Tree/ConstructBinaryTree )
135- - [ title ] ( Tree/DistributeCoinsInBinaryTree )
136- - [ title ] ( Tree/InvertBinaryTree )
137- - [ title ] ( Tree/MergeTwoBinaryTrees )
138- - [ title ] ( Tree/NaryTreePostorderTraversal )
139- - [ title ] ( Tree/SerializeAndDeserializeBinaryTree )
131+ - [ All Elements in Two BSTs ] ( Tree/AllElementsInTwoBSTs )
132+ - [ Binary Postorder ] ( Tree/BinaryPostorder )
133+ - [ Check Valid Tree Given Edges ] ( Tree/CheckValidTreeGivenEdges )
134+ - [ Construct Binary Tree ] ( Tree/ConstructBinaryTree )
135+ - [ Distribute Coins in Binary Tree ] ( Tree/DistributeCoinsInBinaryTree )
136+ - [ Invert Binary Tree ] ( Tree/InvertBinaryTree )
137+ - [ Merge Two Binary Trees ] ( Tree/MergeTwoBinaryTrees )
138+ - [ N-ary Tree Postorder Traversal ] ( Tree/NaryTreePostorderTraversal )
139+ - [ Serialize and Deserialize Binary Tree ] ( Tree/SerializeAndDeserializeBinaryTree )
140140
141141### [ Others] ( ./Others )
142142
0 commit comments