Posts

Minimum Edit Distance

Minimum Edit Distance By Recursion

Longest Palindromic Subsequence Print

Longest Palindromic Subsequence

LightOJ 1232 Solution

LightOJ 1231 Solution

LightOJ 1094 Solution

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

String Hashing

Inversion Count by BIT

Spoj INVCNT Solution

Inversion Count by BIT

Binary Indexed Tree or Fenwick Tree