class Solution {

    public int longestSubsequenceInSubString(String x, String y) {
        int n = x.length();
        int m = y.length();

        int[][] dp = new int[n + 1][m + 1];
        int maxLength = 0;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {

                if (Character.toLowerCase(x.charAt(i - 1)) == Character.toLowerCase(y.charAt(j - 1))) {
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                } else {
                    dp[i][j] = 0;
                }

                if (dp[i][j] > maxLength) {
                    maxLength = dp[i][j];
                }
            }
        }

        return maxLength;
    }
}