Introduction
A knapsack is a bag with straps, usually carried by soldiers to help them take their valuables or things which they might need during their journey. The 0/1 knapsack problem is a very famous interview problem. The problem statement is as follows:
Given a set of items, each of which is associated with some weight and value. Find the subset of items which can be carried into the knapsack with weight limit W. It is required that the cumulative value of the items in the knapsack is maximum value possible.
In simple words, it asks you to pick certain items from the set of items ...

Read More
# Author: dharam

## Solving 0/1 Knapsack problem using Recursion

Introduction
A knapsack is a bag with straps, usually carried by soldiers to help them take their valuables or things which they might need during their journey. The 0/1 knapsack problem is a very famous interview problem. The problem statement is as follows:
Given a set of items, each of which is associated with some weight and value. Find the subset of items which can be carried in a knapsack of capacity W (where W is the weight). It is required that the cumulative value of the items in the knapsack is maximum value possible.
In simple words, it asks you to pick certain items from the...

Read More
## Find Interleaving Strings using Dynamic Programming

Introduction
This problem is already discussed in the post here. This post attempts to solve the same using the dynamic programming approach. Here is a brief description of the problem. Given three strings A, B and C such that A is "ab", B is "ade" and C is "adabe" find if C is an interleaving of A and B or not.
Interleaving means constructing the third string C using the characters of A and B such that the characters in A and B preserve their relative ordering in C. In the above example C is an interleaving of A and B.
Approach to Find Interleaving Strings using Dynamic Programming
How ...

Read More
## Build Balanced Binary Search Tree from Array

Introduction
This post describes the algorithm to build binary search tree from array of sorted elements. However, this technique can be used to build balanced binary search tree from array. A balanced binary tree is a binary tree which has minimum height.
To know more about various aspects of a binary search tree, please visit my previous posts.
What does balanced means?
In this post as we are trying to build a BST, we will assume the input to be a sorted array. In case, we are just building a binary tree, we can take any array as an input. Let me explain the process with the help of a ...

Read More
## Solving Sudoku using Backtracking

Introduction
This post is the continuation of the backtracking series. Sudoku can be solved using multiple algorithms based on Neural Networks and Genetic Algorithms by doing exhaustive searches in the solution space. However, here we are focusing on solving Sudoku using backtracking algorithm.
For people who are unaware of the Sudoku puzzle, please check out Wikipedia for details. For a brief description read below:
A Sudoku puzzle is a 9 * 9 grid.
Few cells in the grid contain random numbers between 1 and 9 (both inclusive)
A fully solved Sudoku must contain numbers through 1-...

Read More