LeetCode/Dynamic_Programming at master · wisdompeak/LeetCode · GitHub

History

Name		Name	Last commit message	Last commit date
parent directory ..
010.Regular-Expression-Matching		010.Regular-Expression-Matching
044.Wildcard-Matching		044.Wildcard-Matching
053.Maximum-Subarray		053.Maximum-Subarray
072.Edit-Distance		072.Edit-Distance
091.Decode-Ways		091.Decode-Ways
096.Unique-Binary-Search-Trees		096.Unique-Binary-Search-Trees
097.Interleaving-String		097.Interleaving-String
1000.Minimum-Cost-to-Merge-Stones		1000.Minimum-Cost-to-Merge-Stones
1027.Longest-Arithmetic-Sequence		1027.Longest-Arithmetic-Sequence
1035.Uncrossed-Lines		1035.Uncrossed-Lines
1039.Minimum-Score-Triangulation-of-Polygon		1039.Minimum-Score-Triangulation-of-Polygon
1043.Partition-Array-for-Maximum-Sum		1043.Partition-Array-for-Maximum-Sum
1049.Last-Stone-Weight-II		1049.Last-Stone-Weight-II
1092.Shortest-Common-Supersequence		1092.Shortest-Common-Supersequence
1105.Filling-Bookcase-Shelves		1105.Filling-Bookcase-Shelves
1125.Smallest-Sufficient-Team		1125.Smallest-Sufficient-Team
1130.Minimum-Cost-Tree-From-Leaf-Values		1130.Minimum-Cost-Tree-From-Leaf-Values
1143.Longest-Common-Subsequence		1143.Longest-Common-Subsequence
115.Distinct-Subsequences		115.Distinct-Subsequences
1186.Maximum-Subarray-Sum-with-One-Deletion		1186.Maximum-Subarray-Sum-with-One-Deletion
1187.Make-Array-Strictly-Increasing		1187.Make-Array-Strictly-Increasing
120.Triangle		120.Triangle
1216.Valid-Palindrome-III		1216.Valid-Palindrome-III
1223.Dice-Roll-Simulation		1223.Dice-Roll-Simulation
123.Best-Time-to-Buy-and-Sell-Stock-III		123.Best-Time-to-Buy-and-Sell-Stock-III
1246.Palindrome-Removal		1246.Palindrome-Removal
1259.Handshakes-That-Don't-Cross		1259.Handshakes-That-Don't-Cross
1262.Greatest-Sum-Divisible-by-Three		1262.Greatest-Sum-Divisible-by-Three
1269.Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps		1269.Number-of-Ways-to-Stay-in-the-Same-Place-After-Some-Steps
1277.Count-Square-Submatrices-with-All-Ones		1277.Count-Square-Submatrices-with-All-Ones
1278.Palindrome-Partitioning-III		1278.Palindrome-Partitioning-III
1289.Minimum-Falling-Path-Sum-II		1289.Minimum-Falling-Path-Sum-II
1301.Number-of-Paths-with-Max-Score		1301.Number-of-Paths-with-Max-Score
131.Palindrome-Partitioning		131.Palindrome-Partitioning
1312.Minimum-Insertion-Steps-to-Make-a-String-Palindrome		1312.Minimum-Insertion-Steps-to-Make-a-String-Palindrome
1316.Distinct-Echo-Substrings		1316.Distinct-Echo-Substrings
132.Palindrome-Partitioning-II		132.Palindrome-Partitioning-II
1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers		1320.Minimum-Distance-to-Type-a-Word-Using-Two-Fingers
1335.Minimum-Difficulty-of-a-Job-Schedule		1335.Minimum-Difficulty-of-a-Job-Schedule
1349.Maximum-Students-Taking-Exam		1349.Maximum-Students-Taking-Exam
1363.Largest-Multiple-of-Three		1363.Largest-Multiple-of-Three
1388.Pizza-With-3n-Slices		1388.Pizza-With-3n-Slices
1411.Number-of-Ways-to-Paint-N×3-Grid		1411.Number-of-Ways-to-Paint-N×3-Grid
1416.Restore-The-Array		1416.Restore-The-Array
1419.Minimum-Number-of-Frogs-Croaking		1419.Minimum-Number-of-Frogs-Croaking
1420.Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons		1420.Build-Array-Where-You-Can-Find-The-Maximum-Exactly-K-Comparisons
1434.Number-of-Ways-to-Wear-Different-Hats-to-Each-Other		1434.Number-of-Ways-to-Wear-Different-Hats-to-Each-Other
1449.Form-Largest-Integer-With-Digits-That-Add-up-to-Target		1449.Form-Largest-Integer-With-Digits-That-Add-up-to-Target
1458.Max-Dot-Product-of-Two-Subsequences		1458.Max-Dot-Product-of-Two-Subsequences
1463.Cherry-Pickup-II		1463.Cherry-Pickup-II
1473.Paint-House-III		1473.Paint-House-III
1478.Allocate-Mailboxes		1478.Allocate-Mailboxes
1494.Parallel-Courses-II		1494.Parallel-Courses-II
152.Maximum-Product-Subarray		152.Maximum-Product-Subarray
1531.String-Compression-II		1531.String-Compression-II
1546.Maximum-Number-of-Non-Overlapping-Subarrays-With-Sum-Equals-Target		1546.Maximum-Number-of-Non-Overlapping-Subarrays-With-Sum-Equals-Target
1547.Minimum-Cost-to-Cut-a-Stick		1547.Minimum-Cost-to-Cut-a-Stick
1548.The-Most-Similar-Path-in-a-Graph		1548.The-Most-Similar-Path-in-a-Graph
1563.Stone-Game-V		1563.Stone-Game-V
1575.Count-All-Possible-Routes		1575.Count-All-Possible-Routes
1594.Maximum-Non-Negative-Product-in-a-Matrix		1594.Maximum-Non-Negative-Product-in-a-Matrix
1595.Minimum-Cost-to-Connect-Two-Groups-of-Points		1595.Minimum-Cost-to-Connect-Two-Groups-of-Points
1621.Number-of-Sets-of-K-Non-Overlapping-Line-Segments		1621.Number-of-Sets-of-K-Non-Overlapping-Line-Segments
1626.Best-Team-With-No-Conflicts		1626.Best-Team-With-No-Conflicts
1638.Count-Substrings-That-Differ-by-One-Character		1638.Count-Substrings-That-Differ-by-One-Character
1639.Number-of-Ways-to-Form-a-Target-String-Given-a-Dictionary		1639.Number-of-Ways-to-Form-a-Target-String-Given-a-Dictionary
1655.Distribute-Repeating-Integers		1655.Distribute-Repeating-Integers
1659.Maximize-Grid-Happiness		1659.Maximize-Grid-Happiness
1681.Minimum-Incompatibility		1681.Minimum-Incompatibility
1682.Longest-Palindromic-Subsequence-II		1682.Longest-Palindromic-Subsequence-II
1690.Stone-Game-VII		1690.Stone-Game-VII
1691.Maximum-Height-by-Stacking-Cuboids		1691.Maximum-Height-by-Stacking-Cuboids
1692.Count-Ways-to-Distribute-Candies		1692.Count-Ways-to-Distribute-Candies
1723.Find-Minimum-Time-to-Finish-All-Jobs		1723.Find-Minimum-Time-to-Finish-All-Jobs
174.Dungeon-Game		174.Dungeon-Game
1745.Palindrome-Partitioning-IV		1745.Palindrome-Partitioning-IV
1746.Maximum-Subarray-Sum-After-One-Operation		1746.Maximum-Subarray-Sum-After-One-Operation
1770.Maximum-Score-from-Performing-Multiplication-Operations		1770.Maximum-Score-from-Performing-Multiplication-Operations
1771.Maximize-Palindrome-Length-From-Subsequences		1771.Maximize-Palindrome-Length-From-Subsequences
1787.Make-the-XOR-of-All-Segments-Equal-to-Zero		1787.Make-the-XOR-of-All-Segments-Equal-to-Zero
1799.Maximize-Score-After-N-Operations		1799.Maximize-Score-After-N-Operations
1824.Minimum-Sideway-Jumps		1824.Minimum-Sideway-Jumps
1839.Longest-Substring-Of-All-Vowels-in-Order		1839.Longest-Substring-Of-All-Vowels-in-Order
1872.Stone-Game-VIII		1872.Stone-Game-VIII
188.Best-Time-to-Buy-and-Sell-Stock-IV		188.Best-Time-to-Buy-and-Sell-Stock-IV
1883.Minimum-Skips-to-Arrive-at-Meeting-On-Time		1883.Minimum-Skips-to-Arrive-at-Meeting-On-Time
1884.Egg-Drop-With-2-Eggs-and-N-Floors		1884.Egg-Drop-With-2-Eggs-and-N-Floors
1900.The-Earliest-and-Latest-Rounds-Where-Players-Compete		1900.The-Earliest-and-Latest-Rounds-Where-Players-Compete
1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing		1909.Remove-One-Element-to-Make-the-Array-Strictly-Increasing
1931.Painting-a-Grid-With-Three-Different-Colors		1931.Painting-a-Grid-With-Three-Different-Colors
1937.Maximum-Number-of-Points-with-Cost		1937.Maximum-Number-of-Points-with-Cost
1947.Maximum-Compatibility-Score-Sum		1947.Maximum-Compatibility-Score-Sum
1955.Count-Number-of-Special-Subsequences		1955.Count-Number-of-Special-Subsequences
1959.minimum-total-space-wasted-with-k-resizing-operations		1959.minimum-total-space-wasted-with-k-resizing-operations
1977.Number-of-Ways-to-Separate-Numbers		1977.Number-of-Ways-to-Separate-Numbers
198.House-Robber		198.House-Robber
1981.Minimize-the-Difference-Between-Target-and-Chosen-Elements		1981.Minimize-the-Difference-Between-Target-and-Chosen-Elements
1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Tasks		1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Tasks
1987.Number-of-Unique-Good-Subsequences		1987.Number-of-Unique-Good-Subsequences
1994.The-Number-of-Good-Subsets		1994.The-Number-of-Good-Subsets

LeetCode/Dynamic_Programming at master · wisdompeak/LeetCode · GitHub

Expand file tree

Breadcrumbs

Dynamic_Programming

Directory actions

More options

Directory actions

More options

Latest commit

History

Breadcrumbs

Dynamic_Programming

Folders and files

parent directory