Reverse the order of bits in an unsigned integer

Given a set S, compute the powerset of S

Add two decimal strings representing two integers

Generate all the bit patterns from 0 to 2^(n-1) such that successive patterns differ by one bit.

Bellman-Ford – Given a graph G and a source vertex, find the shortest paths from the source src to all vertices. The graph may contain negative edges

Represent unsigned integers with variable length encoding using the continuation bit

Represent an integer with variable length encoding using gamma encoding

Represent an integer with variable length encoding using delta encoding

Jump Stairs – There is a stair with n steps. You can climb either one step or two steps at a time. How many different ways there are to climb the stair?

Compute the average with no division

Max sub-array problem - given an array of integers, compute the largest sum continuous sub array

Integer Knapsack – A knapsack has max capacity C and there are n items each with weight w[i] and value v[i]. Maximize the value in the knapsack without exceeding its max capacity

Edit Distance -– Given two strings, compute the edit distance between them

Neat Print – Given a sequence of words and a max number of words which can be put in a line, print the sequence of words neatly. Assume that no word is split across lines

Eggs Drop – Given k eggs and n floors in a building, find the minimum number of trials required to determine the lowest floor from which an egg can be dropped without getting broken

Jumping Array – Given an array of non-negative numbers, start at the first element and reach the end with a minimum number of jumps. A jump cannot exceed the length contained in the current position.

Dice -– Given n dice, count how many ways to get sum s.

Given n dollars, how many different ways there are to make the change into a set of coins S?

Longest Palindrome String – Given a string, compute the longest palindromic substring

LCS -– Given two strings S1 and S2, find the longest common substring

LCS -– Given two strings S1 and S2, find the longest common substring

String Palindromes -– Given a string, find the minimum number of characters to be inserted for converting the string into a palindrome

Jumping Array – Given an array of non-negative numbers, start at the first element and reach the end with a minimum number of jumps. A jump cannot exceed the length contained in the current position.

Given an array of integers, find the longest increasing subsequence

LCS – Given two strings, find the longest common subsequence

Bridge Matching – n cities are on the northern bank of a river and n cities are on the southern bank. You can build a bridge only between cities with the same number

LBS – Given an array of integers, find the longest bitonic sequence

Box Stacking – Given a set of 3d boxes, compute the largest stack of boxes. A box can be stacked only on top of another box with larger base.

Sum Subset -– Given an array of integers of size n, partition it in such a way that the two subsets have equal sum s