Partition Set – partition a multiset S of positive integers into two subsets S1 and S2, such that the sum of the numbers in S1 equals the sum of the numbers in S2

Segment Partition -– Given a segment of integer length n, cut it into different integer parts in such a way to maximize the product of the lengths of all parts

Cutting a Rod – given a rod of length n and a vector of prices for different lengths, cut the rod for maximizing the gain

CONVERTING A DOUBLE LINKED LIST INTO A BST

IMPLEMENTING FINDMIN AND FINDMAX IN A BS

IMPLEMENTING DELETENODE IN A BST

CONVERTING A DOUBLE LINKED LIST INTO A BST

Boolean Parenthesization – given a Boolean expression of and, or, xor, true, false, find the number of ways to parenthesize and evaluate to true

Matrix Parenthesization -- Given a set of m Matrices find the most efficient way of multiplying them

Maximum value contiguous subsequence – given an array of real numbers, find a contiguous subsequence with max sum s

MERGE TWO BALANCED BINARY SEARCH TREES

FIND IF THERE IS A TRIPLET IN A BALANCED BST THAT ADDS TO ZERO

IMPLEMENTING A B-TREE

Stock prices – Given a histogram array of unsigned integers encoding the price of a stock title during the previous year, compute the area for the largest rectangle contained in this histogram

Ship Battle – Given a matrix M and an array V, match the array in the matrix

Max Submatrix 0/1 - Given a matrix consisting only of 0s and 1s, find the maximum size square sub-matrix with all 1s

FINDING THE K-TH ELEMENT IN A BST

Balanced partition – given an array of integers between 0 and M, divide the integers into two sets such that the difference of their sums is minimized

COMPUTING THE DIAMETER OF A BINARY TREE

PRINTING ALL THE KEYS IN A BST WITHIN A GIVEN INTERVAL

IMPLEMENTING AN INORDER VISIT FOR A BINARY TREE

IMPLEMENTING A LEVEL ORDER VISIT FOR A BINARY TREE

CONVERTING A BST INTO A DOUBLE LINKED LIST

CHECKING IF TWO BINARY TREES ARE STRUCTURALLY IDENTICAL

VERIFYING IF A PATH SUM IS EQUAL TO AN INTEGER

PRINTING ALL THE PATHS IN A BINARY TREE

FIND THE MAXIMUM PATH SUM BETWEEN TWO LEAVES OF A BINARY TREE

PRINTING A ZIG-ZAG TRAVERSAL

IMPLEMENTING FIND AND INSERT IN A BINARY SEARCH TREE

IMPLEMENTING A SKIPLIST

PRINTING THE LOWEST COMMON ANCESTOR (LCA)