Similar Topics

Web Technologies32.1K+ articles

DSA20.4K+ articles

Python19.6K+ articles

Experiences15.8K+ articles

Interview Experiences14.5K+ articles

School Learning11.1K+ articles

JavaScript9.9K+ articles

Java9.4K+ articles

Matrix744+ articles

Backtracking157+ articles

meet-in-the-middle

5 posts

Count of Subsets that can be partitioned into two non empty sets with equal Sum

Last Updated: 23 July 2025

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 groups having equal sum.Examples:Input: Arr[] ...read more

Geeks Premier League

Geeks-Premier-League-2022

meet-in-the-middle

Count of Possible paths of given Matrix having Bitwise XOR equal to K

Last Updated: 23 July 2025

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 count of all possible paths such that bitwise XOR of el...read more

meet-in-the-middle

Shortest Path using Meet In The Middle

Last Updated: 11 July 2025

Given a permutation P = p1, p2, ...., pn of first n natural numbers (1 ? n ? 10). One can swap any two consecutive elements pi and pi + 1 (1 ? i n). The task is to find t...read more

article_image

Technical Scripter 2018

meet-in-the-middle

Subsets having Sum between A and B

Last Updated: 11 July 2025

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 * 107 ? arri ? 2 * 107-5 * 108 ? A, B ? 5 * 1...read more

Technical Scripter

meet-in-the-middle

Meet in the middle

Last Updated: 25 June 2024

Given a set of n integers where n = 40. Each of them is at most 1012, determine the maximum sum subset having sum less than or equal S where S = 1018.Example:Input : set[...read more

meet-in-the-middle