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: Competitive Programming
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.
Fenwick Tree (Binary Indexed Tree)
Fenwick Tree’s efficiency, combined with its relatively simple implementation, makes it useful in competitive programming and applications that involve dynamic sum queries and updates.
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 All Subsequences of a String Using Python | Iterative vs Recursive
Subsequences derived from strings by deleting some or no characters without changing order, are crucial in fields like bioinformatics, data mining, and cryptography.
Understanding Linearity of Expectation
Linearity of expectation is a powerful concept in probability theory that simplifies the calculation of expected values in probabilistic experiments.
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.
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.