Palindromic Substrings | LeetCode 647
00:07 :Introduction
00:42 : Detailed Problem Explanation
02:00 : Solution Approach Explanation
04:20 : Code it up
10:44 : Time Complexity
Given a string, your task is to count how many palindromic substrings in this string.
The substrings with different start indexes or end indexes are counted as different substrings even they consist of same characters.
Example 1:
Input: "abc"
Output: 3
Explanation: Three palindromic strings: "a", "b", "c".
Link : https://leetcode.com/problems/palindr...
#competitiveprogramming #interview #interviewquestion
#coding #leetcode #programmer #tech #software #leetcode #programmingisfun