LeetCode #300: Longest Increasing Subsequence
https://leetcode.com/problems/longest-increasing-subsequence/description/ The idea of the solution is to use Dynamic Programming to solve this problem. First, we create a dp…
Author:
LeetCode #139: Word Break
https://leetcode.com/problems/word-break/ To solve this problem, we can use a backtracking approach that checks all possible combinations of substrings that exist…
LeetCode #152: Maximum Product Subarray
https://leetcode.com/problems/maximum-product-subarray/description/ We can solve this problem using Dynamic Programming approach. We will maintain the maximum and minimum subarray product ending…
LeetCode #322: Coin Change
https://leetcode.com/problems/coin-change/ This problem can be solved using dynamic programming. We will use an array dp of length amount+1 to store…
LeetCode #91: Decode Ways
https://leetcode.com/problems/decode-ways/ We can solve this problem by using dynamic programming. Let’s start by considering each character of the string s…
LeetCode #647: Palindromic Substrings
https://leetcode.com/problems/palindromic-substrings/ To solve this problem, we can use the expanding around center approach. We consider each character in the string…
LeetCode #5: Longest Palindromic Substring
https://leetcode.com/problems/longest-palindromic-substring/ The solution to this problem involves the use of a two-pointer approach where we use the center of a…
LeetCode #213: House Robber II
https://leetcode.com/problems/house-robber-ii/ The House Robber II problem is similar to the House Robber problem, except that the houses are arranged in…
LeetCode #198: House Robber
https://leetcode.com/problems/house-robber/ To solve this problem, we will use dynamic programming, where we will create a dp list to store the…
LeetCode #70: Climbing Stairs
https://leetcode.com/problems/climbing-stairs/ To solve this problem, we need to keep track of the number of ways we can climb to reach…