## C++ Programming – Print all increasing sequences of length k from first n natural numbers

Given two positive integers n and k, print all increasing sequences of length k such that the elements in every sequence are from first n natural numbers.

## Longest Palindromic Substring

Longest Palindromic Substring – Dynamic Programming -Given a string,find the longest substring which is palindrome. For example, if the given string ing is

## Largest Sum Contiguous Subarray

Python Programming – Largest Sum Contiguous Subarray – Dynamic Programming Write program to find the sum of contiguous subarray within one-dimensional array

## Python Programming – Ugly Numbers

Python Programming – Ugly Numbers – Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5.

## Minimum number of jumps to reach end

Minimum number of jumps to reach end – Dynamic Programming An array of integers where elements represents the max number of steps that can be made forward

## C++ programming Articulation Points (or Cut Vertices) in a Graph

C++ programming Articulation Points (or Cut Vertices) in a Graph – Articulation points represent vulnerabilities in a connected network

## C Programming – Partition Problem

C Programming – Partition Problem – Dynamic Programming Partition problem is to determine whether a given set can be partitioned into two subsets

## Palindrome Partitioning

Palindrome Partitioning – Dynamic Programming a partitioning of the string is a palindrome partitioning if every substring of the partition is a palindrome.

## Python Programming – Floyd Warshall Algorithm

Python Programming – Floyd Warshall Algorithm – Dynamic Programming The Floyd Warshall Algorithm is for solving the All Pairs Shortest Path problem.

## Python Programming – Longest Bitonic Subsequence

Python Programming – Longest Bitonic Subsequence – Dynamic Programming arr[0.n-1] containing positive integers, a subsequence of arr[] is called Bitonic