## Cpp Programming – Count of n digit numbers whose sum of digits equals to given sum

C++ Programming – Count of n digit numbers whose sum of digits equals to given sum – Dynamic Programming Given two integers ‘n’ and ‘sum’, find count of all

## Java Programming – Count of n digit numbers whose sum of digits equals to given sum

Java Programming – Count of n digit numbers whose sum of digits equals to given sum – Dynamic Programming Given two integers ‘n’ and ‘sum’, find count

Mobile Numeric Keypad Problem – Dynamic Programming Given the mobile numeric keypad. You can only press buttons that are up, left, right or down

## Minimum Cost Polygon Triangulation

Minimum Cost Polygon Triangulation – Dynamic Programming A triangulation of a convex polygon is formed by drawing diagonals between non-adjacent vertices

## C Programming – Count ways to reach the n’th stair

C Programming – Count ways to reach the n’th stair – Dynamic Programming There are n stairs, a person standing at the bottom wants to reach the top.

## Java Programming – Count ways to reach the n’th stair

Java Programming – Count ways to reach the n’th stair – Dynamic Programming There are n stairs, a person standing at the bottom wants to reach the top.

## Boolean Parenthesization Problem

Boolean Parenthesization Problem – Dynamic Programming Count the number of ways we can parenthesize the expression so that the value of expression

## Java Programming – Count number of binary strings without consecutive 1’s

Java Programming – Count number of binary strings without consecutive 1’s – Dynamic Programming Positive integer, count all possible distinct binary string

## C Programming – Maximum sum rectangle in a 2D matrix

C Programming – Maximum sum rectangle in a 2D matrix – Dynamic Programming Given a 2D array, find the maximum sum subarray in it.For example,

## Maximum sum rectangle in a 2D matrix

Java Programming – Maximum sum rectangle in a 2D matrix – Dynamic Programming – Given a 2D array, find the maximum sum subarray in it. For example