deepak-garg
diff --git a/‎Dynamic Programming/647_Palindromic_Substrings.java
Copy file name to clipboard
+22Lines changed: 22 additions & 0 deletions b/‎Dynamic Programming/647_Palindromic_Substrings.java
Copy file name to clipboard
+22Lines changed: 22 additions & 0 deletions
@@ -0,0 +1,22 @@
+class Solution {
+    public int countSubstrings(String s) {
+        if (s == null || s.length() == 0) {
+            return 0;
+        }
+
+        int result = 0, n = s.length();
+        boolean[][] dp = new boolean[n][n];
+
+        for (int i = n - 1; i >= 0; i--) {
+            for (int j = i; j < n; j++) {
+                dp[i][j] = s.charAt(i) == s.charAt(j) && (j - i < 2 || dp[i + 1][j - 1]);
+
+                if (dp[i][j]) {
+                    ++result;
+                }
+            }
+        }
+
+        return result;
+    }
+}