# Tag - what is dynamic programming

## C++ Programming – Longest Monotonically Increasing Subsequence Size

Given an array of random numbers, find longest monotonically increasing subsequence (LIS) in the array.If you want to understand the O(NlogN) approach.

## C++ Programming – number of contiguous subsequences

C++ Programming number of contiguous subsequences - Mathematical Algorithms - Given a number as a string, write a function to find the number of substrings

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

C++ Programming - Count number of binary strings without consecutive 1’s - Mathematical Algorithms - Let a[i] be the number of binary strings of length

## C++ Programming – Space and time efficient Binomial Coefficient

C++ Programming - Space and time efficient Binomial Coefficient - Mathematical Algorithms - function that takes two parameters n and k and returns the value

## Java Programming – Space and time efficient Binomial Coefficient

Java Programming Space and time efficient Binomial Coefficient - Mathematical Algorithms - function that takes two parameters n and k and returns the value

## C Programming – Space and time efficient Binomial Coefficient

C Programming - Space and time efficient Binomial Coefficient - Mathematical Algorithms - function that takes two parameters n and k and returns the value

## Greedy Algorithm to find Minimum number of Coins

Greedy Algorithm to find Minimum number of Coins - Greedy Algorithm - Given a value V, if we want to make change for V Rs. and we have infinite supply of each...

X