LeetCode Daily Challenge-2163: Minimum Difference in Sums After Removal of Elements(Hard, Java, DP+priorityQueue+greedy)
TC O(n log n) SC O(n) using minHeap, maxHeap and DP
Jul 18, 20256 min read2
Command Palette
Search for a command to run...
#dynamic-programming
Articles tagged with #dynamic-programming
LeetCode 3202. Find the Maximum Length of Valid Subsequence II - DP(Med, Java, O(kn))
Find subsequence where (nums[i] + nums[i+1]) % k is the same for all pairs
Jul 17, 20255 min read4
LeetCode 3201 Find the Maximum Length of Valid Subsequence I(Med, Java, O(n))
Find subsequence where (nums[i] + nums[i+1]) % 2 is the same for all pairs
Jul 16, 20252 min read8
LeetCode 516 Longest Palindromic Subsequence(Med, Java, O(n²))
Problem Description LeetCode 516 Longest Palindromic Subsequence The "Longest Palindromic Subsequence" problem asks you to find the length of the longest subsequence in a given string that reads the same forward and backward. Key Points: A subsequ...
Jul 14, 20254 min read2
LeetCode 486 Predict the Winner - DP score difference(Med, Java, O(n²))
Problem Description The "Predict the Winner" problem is a classic game theory problem where two players (Player 1 and Player 2) take turns picking numbers from either end of an array. Both players play optimally to maximize their own score. The goal ...
Jul 14, 20253 min read2
LeetCode 416 Partition Equal Subset Sum - Four solutions(Med, Java, O(n sum))
0. DP Complexity: O(n × sum) time, O(sum) space Best for: General case, clean implementation Core Logic Explained for (int num : nums) { for (int currSum = targetSum; currSum >= num; currSum--) { dp[currSum] = dp[currSum] || dp[currSum ...
Jul 13, 20257 min read1