Dynamic Programming: Longest Common Substring

Given two strings, find the length of longest common substring.
For example: Given strings are:  "GeeksForGeeks" and  "GeeksQuiz". The out put should be 5.