CodePuller

Kadane's Algorithm(Print Sub-Array)

Spoj KNAPSACK Solution

0-1 knapsack(recursively)

Find minimum number of coins that make a given value when use one coin many times

Find minimum number of coins that make a given value when use one coin many times by recursion

Find minimum number of coins that make a given value when use one coin only one by DP

Find minimum number of coins that make a given value when use one coin only one by recursion

Toph Eet Izz Phet! Solution

Inversion Count by BIT

Spoj INVCNT Solution

Inversion Count by BIT

Binary Indexed Tree or Fenwick Tree

Given a array and given a range[l, r], determine the number of elements in the array greater than equal to l and less than equal to r

Order Set

Uva 10344 Solution

Uva 729 Solution

Print all Combination by Backtracking

Print all Combination by Backtracking

LightOJ 1023 Solution

Print all Permutation by Backtracking

Recursion Problem Solve