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
Experiences
Practice
Mock InterviewsTimed interview simulations with feedbackCoaching1:1 coaching with people at your target companiesSuccess 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
Build my plan
Size-3 Subarray Sum
00:00
5 left

Size-3 Subarray Sum

EasyPython

Problem

HouseCanary processes ordered property-market measurements, such as daily valuation adjustments. Given an integer array nums and a target integer, determine whether any contiguous subarray of exactly three elements has a sum equal to the target.

The subarray must contain consecutive elements, and elements cannot be reordered or skipped. Return True as soon as a matching window is found; otherwise return False.

Formal Specification

Implement has_three_sum(nums, target).

  • Input: nums, a list of integers, and target, an integer.
  • Output: A boolean. Return True if there exists an index i such that nums[i] + nums[i + 1] + nums[i + 2] == target; otherwise return False.
  • Use a single left-to-right pass when possible. Do not modify nums.

Constraints

  • 0 <= len(nums) <= 100000
  • -10^9 <= nums[i] <= 10^9
  • -10^9 <= target <= 10^9
  • A valid subarray must contain exactly three consecutive elements
  • Return False when len(nums) < 3

Function Signature

def has_three_sum(nums, target):
Interviewer

Your question is Size-3 Subarray Sum. 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.
CodePython 3
Sign up free to run your codeLog inLn 2
Run your code to see test output here.