Tutorialspoint.dev
Welcome To Tutorialspoint.dev
Officially launched 18th May 2019
Arrays Dynamic Programming Adobe

Subset Sum Problem DP-25

Given a set of non-negative integers, and a value sum, determine if there is a subset of the given set with sum equal to given sum. Example: Input: set[] = {3, 34, ...
Backtracking Adobe Amazon

Subset Sum Backtracking-4

Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up to a given number K. We are considering the set contains no...
Java Java-lang package Java

Java.lang.Character.Subset Class in Java

Character.Subset Class represents particular subsets of the Unicode(standards using hexadecimal values to express characters – 16bit) character set. The subset...
Arrays Hash Searching

Find whether an array is subset of another array Added Method 3

Given two arrays: arr1[0..m-1] and arr2[0..n-1]. Find whether arr2[] is a subset of arr1[] or not. Both the arrays are not in sorted order. It may be assumed that ele...
Backtracking Adobe Amazon

Subset Sum Backtracking-4

Subset sum problem is to find subset of elements that are selected from a given set whose sum adds up to a given number K. We are considering the set contains no...
Arrays Backtracking subset

Backtracking to find all subsets

Given a set of positive integers, find all its subsets. Examples: Input : 1 2 3 Output : // this space denotes null element. 1 1 2 1 2...
Backtracking Microsoft Microsoft

Partition of a set into K subsets with equal sum

Given an integer array of N elements, the task is to divide this array into K non-empty subsets such that the sum of elements in every subset is same. All elements of...
Backtracking Combinatorial Amazon

Find all distinct subsets of a given set

Given a set of positive integers, find all its subsets. The set can contain duplicate elements, so any repeated subset should be considered only once in the output. E...
Dynamic Programming Adobe Amazon

Subset Sum Problem in O(sum) space

Given an array of non-negative integers and a value sum, determine if there is a subset of the given set with sum equal to given sum. Examples: Input : arr[] = {4, 1,...
Arrays Dynamic Programming subset

Perfect Sum Problem (Print all subsets with given sum)

Given an array of integers and a sum, the task is to print all subsets of given array with sum equal to given sum. Examples: Input : arr[] = {2, 3, 5, 6, 8, 10} ...

Subscribe to Our Newsletter