Skip to content

Tag Archives: meet-in-the-middle

Given an array Arr[] of size N, the task is to find the count of subsets of Arr[] that can be partitioned into two non-empty… Read More
Given an N*M (N + M ≤ 40)matrix mat[][], each cell has some value ranging from 0 to 1018 and an integer  K. Find the… Read More
Given a permutation P = p1, p2, …., pn of first n natural numbers (1 ≤ n ≤ 10). One can swap any two consecutive… Read More
Given a set of N integers. Find how many subsets of given array have sum between A and B(inclusive).  Constraints:  1 ≤ N ≤ 34, -2… Read More
Given a set of n integers where n <= 40. Each of them is at most 1012, determine the maximum sum subset having sum less… Read More

Start Your Coding Journey Now!