Pinterest • The world’s catalogue of ideas

Find the longest monotonically increasing subsequence in an array. Java solution for finding length of longest increasing subsequence in an array is provided in code snippet section. Java visualization is provided in algorithm visualization section.

#### Find the length of longest increasing subsequence in an array

ideserve.co.in

Using dynamic progrmming find longest palindromic substring for a string S. Here is a video solution that finds the longest palindromic substring. The algorithm is explained with the help of examples and animations.Java code is provided in Code Snippet Section.

#### Longest Palindromic Substring

ideserve.co.in

Using a KMP's preprocessing find out shortest palindrome. The algorithm is explained with the help of examples and animations. Java code is provided in Code Snippet Section.

#### Shortest Palindrome

ideserve.co.in

Detect if a subset from a given set of N non-negative integers sums upto a given value S.

#### Subset Sum Problem

ideserve.co.in

Using dynamic programming find longest palindromic subsequence for a string S. Here is a video solution that finds the longest palindromic subsequence. The algorithm is explained with the help of examples and animations.Java code is provided in Code Snippet Section.

#### Longest Palindromic Subsequence

ideserve.co.in

Dynamic Programming solution for longest common substring problem The algorithm is explained with the help of examples and animations.Java code is provided in Code Snippet Section.

#### Longest Common Substring

ideserve.co.in

Linear solution for longest increasing subsequence problem - O(n logn). The algorithm is explained with the help of examples and animations. Java code is provided in Code Snippet Section.

#### Longest Increasing Subsequence O(n logn)

ideserve.co.in

Use dynamic programming and find the longest common subsequence between strings S1 and S2. Here is a video solution that implements solution for the longest common subsequence problem. The algorithm is explained with the help of examples and animations.Java code is provided in Code Snippet Section.

#### Longest Common Subsequence

ideserve.co.in

Solution for finding out maximum number of As possible using given four keys - here is a tutorial with video that explains the dynamic programming approach with the proof of correctness.

#### To print maximum number of As using given four keys.

ideserve.co.in

Given a gold mine of n*m dimensions. Each field in this mine contains an integer which is the amount of gold in tons. Initially the miner is in first column but can be at any row i. He can move only (right , right up , right down ) that is from a given cell, the miner can move to the cell diagonally up towards the right or right or diagonally down towards the right. Find out maximum amount of gold he can collect. Java code is given in code snippet section.

ideserve.co.in