Time: 482 ms (30.32%), Space: 11.1 MB (60.87%) - LeetHub

JanaSabuj · JanaSabuj · commit 4e5ef450aa59 · 2022-08-09T22:15:51.000+05:30
diff --git a/5-longest-palindromic-substring/5-longest-palindromic-substring.cpp b/5-longest-palindromic-substring/5-longest-palindromic-substring.cpp
@@ -5,12 +5,6 @@ class Solution {
         int dp[n][n];// dp[i][j] = 1 if str[i][j] is a palindrome
                     //           = 0, otherwise
 
-        for(int i = 0; i < n; i++) {
-            for(int j = 0; j < n; j++) {
-                dp[i][j] = 0;
-            }
-        }
-
         // 1 len
         for(int i = 0; i < n; i++) {
             dp[i][i] = 1;
