#
dynamic programming Archive

In this post, we will see how to find Minimum Number of Jumps to reach last Index. Problem Given an array A of positive integers possibly zeroes, every index indicating the maximum length of a …

Given two Strings A and B. Find the length of the Longest Common Subsequence (LCS) of the given Strings. Subsequence can contain any number of characters of a string including zero or all (subsequence containing …

In this post, we will see about Coin Change problem in java. Problem Given an Amount to be paid and the currencies to pay with. There is infinite supply of every currency using combination of …

In this post, we will see edit distance problem in java Problem Given two strings string1 and string2, String1 is to be converted into String2 with the given operations available in the minimum number of …

In this post, we will see how to find the longest common substring in java. Program Given two String, find longest common substring. For example: String 1: Java2blog String 2: CoreJavaTutorial Longest common subString is: …

In this post, we will see about how to count all paths from top left to bottom right of MxN matrix. Problem We need to count all paths from top left to bottom right of MxN …

In this tutorial, we will see about Memoization example in java. Let me start with the question. Would you like to do same task again and again when you know that it is going to …