Subset Sum Problem | Meet in the Middle
Meet in the Middle is used to optimize brute-force solutions for problems where the input size is too large for direct approaches.
Tag: arrays
Partition Equal Subset Sum – LeetCode Solution [Medium]
Given an integer array determine if you can partition the array into two subsets such that the sum of the elements in both subsets is equal.
Two Sum Problem | Two-Pointer Technique
This method involves sorting the array and then using two pointers to identify a pair of numbers whose sum equals the target.
Max of All Subarrays of Size k Using Max Heap in C++
This problem, also referred to as the “sliding window maximum” problem, can be efficiently solved using heaps. We’ve already discussed an O(n) solution.
Finding Permutations that Form the Sum | Coin Change Permutation
Find the number of permutations to form the target sum using the elements of the given array, with repetition allowed.
Find maximum of all subarrays of size k
Given an array of size n and an integer k, we need to find the maximum for each contiguous subarray of size k.