Welcome to Day 15 of the DSA Coding Challenge:

Today's Goals (Dynamic Programming continued) :

Question 1: Palindromic Substrings: Given a string s, return the number of palindromic substrings in it.

A string is a palindrome when it reads the same backward as forward.

A substring is a contiguous sequence of characters within the string. You will not be given an empty string.

Question 2: Longest Palindromic Substring: Given a string s, return the longest palindromic substring in s.

Question 3: Longest Palindromic Subsequence: Given a string s, find the longest palindromic subsequence's length in s. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

All the best !