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...
Browse Tag
how to solve dynamic programming problems
80 Articles
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...
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...
Python Programming – Bellman–Ford Algorithm
Python Programming - Bellman Ford Algorithm - Dynamic Programming Given a graph and source vertex src in graph, find...
Longest Palindromic Substring
Longest Palindromic Substring - Dynamic Programming -Given a string,find the longest substring which is palindrome. For...
Largest Sum Contiguous Subarray
Python Programming - Largest Sum Contiguous Subarray - Dynamic Programming Write program to find the sum of contiguous...
Java Programming – Largest Sum Contiguous Subarray
Java Programming - Largest Sum Contiguous Subarray - Dynamic Programming Write a program to find the sum of contiguous...
C Programming – Ugly Numbers
C Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every...
C++ Programming – Ugly Numbers
C++ Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Every...
Java Programming – Ugly Numbers
Java Programming - Ugly Numbers - Dynamic Programming Ugly numbers are numbers whose only prime factors are 2, 3 or 5. Here...
