From e5adce3a52c41fe5fb5be1c1cd2a36476f4e8fe7 Mon Sep 17 00:00:00 2001
From: Saurav Kumar Dubey <37882053+sauravkdubey@users.noreply.github.com>
Date: Fri, 11 Oct 2019 15:22:02 +0530
Subject: [PATCH] 647.c

Palindromic substring using dynamic programming
---
 leetcode/src/647.c | 23 +++++++++++++++++++++++
 1 file changed, 23 insertions(+)
 create mode 100644 leetcode/src/647.c

diff --git a/leetcode/src/647.c b/leetcode/src/647.c
new file mode 100644
index 000000000..d78d24391
--- /dev/null
+++ b/leetcode/src/647.c
@@ -0,0 +1,23 @@
+
+/* Author : Saurav Dubey */
+
+
+int countSubstrings(char* s) {
+    int len = strlen(s);
+    int i;
+    int count = 0;
+    for( i=0; i<len; i++){
+        // cases handled for both odd and even lenghted Palindrome
+
+        count += countPalin(s, i, i, len);
+        if(i!=len-1)
+            count += countPalin(s, i, i+1, len);
+    }
+    return count;
+}
+int countPalin(char *s, int head, int tail, int len){
+    int ret = (s[head]==s[tail])? 1:0 ;
+    if( ret && head-1>=0 && tail+1<len)
+        ret += countPalin(s, head-1, tail+1, len);
+    return ret;
+}