## Optimal Binary Search Tree – How to Solve Using Dynamic Programming

Optimal Binary Search Tree - What it is? Optimal Binary Search Tree extends the concept of Binary searc tree. Binary Search Tree (BST) is a nonlinear data structure which is used in many scientific ap [...]

By |2021-11-25T18:41:04+05:30November 25, 2021|Categories: Algorithm||0 Comments

## Multistage Graph Problem using Dynamic Programming

Multistage Graph Multistage Graph problem is defined as follow: Multistage graph G = (V, E, W) is a weighted directed graph in which vertices are partitioned into k â‰¥ 2 disjoint sub sets V = {V1, V2, [...]

By |2021-11-25T11:36:48+05:30November 25, 2021|Categories: Algorithm||0 Comments

## Knapsack Problem using Dynamic Programming

In this article, we will discuss how to solve Knapsack Problem using Dynamic Programming. We have already discussed how to solve knapsack problem using greedy approach. Knapsack Problem using Dynamic [...]

By |2021-11-23T17:22:31+05:30November 23, 2021|Categories: Algorithm||0 Comments

## Making Change Problem using Dynamic Programming

Making Change Problem - What is it ? Making Change problem is to find change for a given amount using a minimum number of coins from a set of denominations.Explanation : If we are given a set of denom [...]

By |2021-11-08T16:35:29+05:30November 8, 2021|Categories: Algorithm||0 Comments

## Binomial Coefficient using Dynamic Programming

Computing binomial coefficient is very fundamental problem of mathematics and computer science. Binomial coefficient C(n, k) defines coefficient of the term xn in the expansion of (1 + x)n. C(n, k) al [...]

By |2021-11-07T18:22:51+05:30November 7, 2021|Categories: Algorithm||0 Comments

## Dynamic Programming Vs Greedy Algorithm

Dynamic Programming Vs Greedy Algorithm In this article we will talk about Dynamic Programming Vs Greedy Algorithm. Both the methods are used to solve the optimization problems. Finding of best soluti [...]

By |2021-11-07T18:19:33+05:30November 4, 2021|Categories: Algorithm||0 Comments

## Divide and Conquer Vs Dynamic Programming

Divide and Conquer Vs Dynamic Programming This article talks about Divide and Conquer Vs Dynamic Programming, approaches for problem solving. As we know, divide and conquer is general problem solving [...]

By |2021-11-07T16:23:55+05:30November 3, 2021|Categories: Algorithm||0 Comments