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.
Category: 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.
Counting Inversions using Fenwick Tree
Fenwick Trees can efficiently track and count inversions in real-time and even for a continuous stream of data.
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 the Next Lexicographically Greater Permutation
Given an input sequence in the form of an array, find the lexicographically next greater permutation if it exists.
Search a sorted 2D Matrix
This method has the limitation that it will work for only those matrix where the first integer of each row is greater than the last integer of the previous row.
Array Indices with Equal sum | Equal Number of Odd or Even numbers on both sides
Given an array, find the indices where the sum of numbers on the left equals the sum on the right.
Coin Change II – LeetCode Solution [Medium]
You are given an integer array coins representing coins and an integer amount. Return the number of combinations that make up that amount.
Coin Change – LeetCode Solution [Medium]
You are given an integer vector coins[n] representing coins of different denominations and an integer amount representing a total amount of money.