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...
#heap
Articles tagged with #heap
LeetCode Daily Challenge-1498. Number of Subsequences That Satisfy the Given Sum Condition(Med)
Mastering Two-Pointer Technique with Combinatorics: From O(2^n) to O(n log n)
Jul 3, 20253 min read1
LeetCode Daily Challenge-2099. Find Subsequence of Length K With the Largest Sum(Easy)
Mastering the Art of Greedy Selection While Preserving Order
Jul 3, 20254 min read6