Count the Ways to Split a Digit String into Primes
Company: Salesforce
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: This question evaluates dynamic programming combined with number theory, specifically counting valid partitions of a digit string under a primality constraint. It tests designing a state-transition recurrence paired with an efficient primality check for large values, a combination commonly used to assess practical algorithmic reasoning in coding interviews.
Read the full Salesforce Software Engineer interview experience this question came from