String subsequence/substring problems

Commonly solved by dynamic programming

  1. Longest common subsequence

http://www.geeksforgeeks.org/dynamic-programming-set-4-longest-common-subsequence/

  1. Longest common substring

http://www.geeksforgeeks.org/longest-common-substring/

  1. Longest repeating substring

http://www.geeksforgeeks.org/suffix-tree-application-3-longest-repeated-substring/

  1. Longest repeating subsequence

http://www.geeksforgeeks.org/longest-repeating-subsequence/

  1. Distinct Subsequences

https://leetcode.com/problems/distinct-subsequences/

  1. Longest Palindromic Subsequence

http://www.geeksforgeeks.org/dynamic-programming-set-12-longest-palindromic-subsequence/

  1. Longest Palindromic Substring

http://www.geeksforgeeks.org/longest-palindrome-substring-set-1/