Problem Statement
Given an array arr[] of size N, generate the sum of every possible subset.
Return all subset sums.
Brute Force Intuition
Every element has only two choices:
Related reading
Subsets II | Backtracking
leetcode.com Problem...
Combination Sum | Backtracking
leetcode.com Problem...
Majority Element II
Given an integer array nums, return all elements that appear more than ⌊n/3⌋ times. Key...
Find the Duplicate Number
Problem Statement Given an array nums containing n + 1 integers where: Each integer is...
Majority Element - I
Given an array of size n, find the element that appears more than n/2 times. ...
Palindrome Partitioning | Backtracking
Problem Statement Given a string s, partition it such that every substring of the...