Dataford
Popular roles
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Browse
Browse All RolesEvery role hub, from analyst to MLBrowse All CompaniesCompany-specific interview loopsAll Interview GuidesThe full guide library
Top questions by role
Software EngineerData AnalystData ScientistData EngineerBusiness AnalystAI EngineerMachine Learning EngineerProduct Manager
Top questions by skill
SQLPythonStatisticsMachine LearningA/B TestingSystem DesignGenerative AIProduct SenseMetricsBehavioral
Browse all questions →Try a mock interview
ExperiencesCoaching
New
Practice
Mock InterviewsTimed interview simulations with feedbackSuccess PathYour 6-week structured planModulesCurated lessons by topicWebinarsTalks from ex-Big Tech data leadsPlaygroundA free-form scratch editor
Learn
BlogInterview strategy and career adviceTech Job Market ReportHiring trends across data and AI rolesFor UniversitiesDataford for career centersAbout DatafordWho we are and how we build
Pricing
Get started
Count Strings with Exactly K Pattern Occurrences
00:00
5 left

Count Strings with Exactly K Pattern Occurrences

HardPython

Problem

Rakuten Payment validates compact symbol sequences generated by payment-processing components. Given a string length, alphabet size, pattern, and target occurrence count, compute how many strings contain the pattern exactly k times.

Occurrences may overlap. For example, "aaa" contains "aa" twice, at positions 0 and 1.

Return the count modulo mod.

Formal Specification

Implement count_strings(n, alphabet_size, pattern, k, mod):

  • n is the required string length.
  • The alphabet consists of the first alphabet_size lowercase English letters: a, b, ..., starting from a.
  • pattern is a non-empty lowercase string using only characters in that alphabet.
  • Count strings of length exactly n whose number of occurrences of pattern is exactly k.
  • Return an integer in [0, mod - 1].

Use an efficient algorithm. Enumerating all alphabet_size ** n strings is infeasible.

Constraints

  • 1 <= n <= 5000
  • 1 <= alphabet_size <= 26
  • 1 <= len(pattern) <= 50
  • 0 <= k <= 50
  • pattern uses only the first alphabet_size lowercase letters
  • 10^7 <= mod <= 10^9 + 7

Function Signature

def count_strings(n, alphabet_size, pattern, k, mod):
Interviewer

Whenever you're ready, walk me through your approach or go straight to the code. The requirements are in the Question tab.

You need to log in / sign up to run or submit.
Code
Sign up free to run your codeLog inLn 2
Run your code to see test output here.