Interview Problem: Number of Substrings in a String that are Palindromes

Показать описание

2:26 Concept of finding number of substrings in a string that are palindromes.
4:02 Code for the problem.
-------------------------------------------------------------------------------------------
-------------------------------------------------------------------------------------------
Coding Ninjas is one of the leading EdTech company providing India’s Highest rated programming courses in C++, Data Structures and Algorithms, Java, Python, Machine Learning, web development, Data Science, Android Development, Kotlin, React.

-----------------------------------------------------
------------------------------------------------------
Explore more on our social media platforms:

Рекомендации по теме

Комментарии

Join our Coding Ninjas official telegram community here:

CodingNinjasIndia

Hi sir, I am having a doubt that you are considering continuous characters as a substring
If we are choosing character not from continuous positions no of possible substrings can be 2^n -1

tarunkumar-kzxi

Well I am able toh solve the question when you said firstly we want solution and do not think about complexity thankyou bhaiya😊

roshanya

subscribed. Thanks for such a great explanation.

samaryadav

Very easy explanation i could found here. thank u very much.

piyushsharma

Can you please explain, how to get all possible palindrome substring?

moneymoney

public class Solution {
int count = 0;

public int countSubstrings(String s) {
if (s == null || s.length() == 0) return 0;

for (int i = 0; i < s.length(); i++) { // i is the mid point
extendPalindrome(s, i, i); // odd length;
extendPalindrome(s, i, i + 1); // even length
}

return count;
}

private void extendPalindrome(String s, int left, int right) {
while (left >=0 && right < s.length() && s.charAt(left) == s.charAt(right)) {
count++; left--; right++;
}
}
}

check out my solution

joydeeprony

I am afraid it won't work for input strings "aaa" - odd length and "aaaa" - even length

varunejanthkar

In this video, you will learn how to find number of substrings in a string that are palindromes.
2:26 Concept of finding number of a substring in a string that is palindromes.
4:02 Code for the problem

CodingNinjasIndia

Interview Problem: Number of Substrings in a String that are Palindromes

Interview Problem: Number of Substrings in a String that are Palindromes

L4. Number of Distinct Substrings in a String | Trie | C++ | Java

Count number of substrings with exactly k distinct characters | Coding Interview Questions Series

Number of Substrings With Only 1s (Leetcode 1513)

Number of Substrings With Only 1s

number of substrings with only 1s | number of substrings with only 1s leetcode | leetcode1513 medium

Palindromic Substrings - Leetcode 647 - Python

Minimum Window Substring - Airbnb Interview Question - Leetcode 76

Optimal Partition of String - Python Interview Question #shorts #python #coding #programmingtutorial

Count number of substrings with exactly k distinct characters | GeeksforGeeks

Count All Substrings of Length K Which Have Exactly K-1 Distinct Characters | Interview Question

1513. Number of Substrings With Only 1s (Leetcode Medium)

I gave 127 interviews. Top 5 Algorithms they asked me.

Count of Substrings with at-most K Distinct Characters | Hashmap Interview Questions Playlist

Count Substrings with K Distinct Characters | Hashmap Interview Questions

Number of Substrings Containing All Three Characters (LeetCode Problem)

3234. Count the Number of Substrings With Dominant Ones | Weekly Leetcode 408

Check if Substring is Present in a Given String - Java Interview Question

GFG POTD: 05/10/2023 | Count Number of Substrings | Problem of the Day GeeksforGeeks

Number of Substring in A string in Competitive Programming using Java

Count Number of substrings having first and last letter equal | Interview Questions| faad coder

leetcode 2489. Number of Substrings With Fixed Ratio - dict and check

Count Binary Substrings | Live Coding with Explanation | Leetcode - 696

Leetcode 1513 | Number of Substrings with only 1s