Dataford
Interview QuestionsInterview GuidesExperiencesCoaching
New
Pricing
Get started
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
Validate Input Against Known Attacks
00:00
5 left

Validate Input Against Known Attacks

HardPython

Problem

CookUnity services receive user-controlled text through surfaces such as account forms and delivery instructions. Implement a detector that identifies whether an input string contains any known attack signature.

Use case-insensitive matching. The detector must return True if at least one non-empty signature appears as a contiguous substring of the input, and False otherwise. Matching is literal: do not interpret regular expressions, decode encodings, or remove punctuation.

Formal Specification

Implement contains_attack(user_input, attack_signatures).

  • user_input is a string.
  • attack_signatures is a list of non-empty strings.
  • Return a boolean.
  • A signature matches if signature.lower() occurs within user_input.lower().

Your solution should efficiently search for many signatures in one input. Aim for time proportional to the input length, the total signature length, and the output construction cost, rather than rescanning the input independently for every signature.

Constraints

  • 1 <= len(user_input) <= 10^6
  • 1 <= len(attack_signatures) <= 10^4
  • The total number of signature characters is at most 2 * 10^5
  • Every signature is non-empty
  • Matching is literal and case-insensitive

Function Signature

def contains_attack(user_input, attack_signatures):
Interviewer

Your question is Validate Input Against Known Attacks. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

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.