30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

Leetcode 730. Count Different Palindromic Subsequences

Count the number of distinct non-empty palindromic subsequences in a string (n ≤ 1000, alphabet {a,b,c,d}), returning the result modulo 1e9+7. The core challenge is using interval dynamic programming with careful deduplication of subsequences to avoid overcounting repeated characters.

Asked at:

Salesforce

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early May, 2025

Salesforce

Senior

Write a function to count how many palindromic substrings there are in a certain string

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 730. Count Different Palindromic Subsequences

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact