Leetcode 2478. Number of Beautiful Partitions

Count the number of ways to split string s into k contiguous substrings (each length ≥ minLength) such that every substring starts with a prime digit (2,3,5,7) and ends with a non-prime digit, returning the count modulo 1e9+7. This is typically solved with dynamic programming over positions and remaining parts (n ≤ 1000) using precomputed valid cut positions to enforce the start/end and length constraints.

Question Timeline

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

Company

Level

Region

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 2478. Number of Beautiful Partitions

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact