You are given a set of positive integers and an integer S, you need to find out whether there exists a non-empty subset with sum

# Category: Arrays

Practice problems related to Arrays

## 0-1 Knapsack problem (DP-07)

We are given a set of items, each item is associated with a weight and a value. We need to determine the number of each

## Pots of gold (DP-06)

There are two players A and B and some pots containing gold arranged in a line each containing some number of gold coins. At any

## Rod cutting problem (DP-02)

You are given a rod of length N units along with an array that contains the prices of all pieces of size smaller than N

## Maximum Sum SubArray – Kadane’s Algorithm (DP-01)

Given an array which can contain both positive and negative integers, find the length of the subarray which has the maximum sum. Sample Input: [