# dynamic programming

- 18 April
### Minimum Number of Jumps to reach last Index

If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. 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 […]

- 02 February
### Longest common Subsequence

If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. 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 […]

- 08 December
### Coin Change Problem in java

If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. 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 […]

- 31 October
### Edit Distance Problem

If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. In this post, we will see edit distance problem in java. Sometimes this problem also referred as "String distance replacement in java" Problem Given two strings string1 and string2, String1 is to be converted into […]

- 30 September
### Longest common substring

If you want to practice data structure and algorithm programs, you can go through 100+ data structure and algorithm programs. 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: […]

- 13 August
### Count all paths from top left to bottom right of MxN matrix

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 matrix. You can either move down or right. Solution You can solve this problem using recursion. Recursion [crayon-60082deea838a670975172/] Recursion will […]

- 12 August
### Memoization example in java

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 give you same result? I think Answer will be No. So Memoization ensures that method does not execute more than […]