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
Find Pair With Given Sum
00:00
5 left

Find Pair With Given Sum

EasyPython

Problem

Tinder Discovery may need to identify two candidate scores whose combined value matches a requested target. Given an array of integers and a target sum, return any pair of distinct array elements whose values add up to the target.

Return the pair as a two-element list containing the values, not their indices. The pair may be returned in either order. If no valid pair exists, return an empty list. Do not use the same array element twice, even when its value would satisfy the target with itself.

Formal Specification

Implement find_pair(nums, target), where nums is a list of integers and target is an integer. Return a two-element list [a, b] such that a and b come from different positions in nums and a + b == target, or return [] when no such pair exists. If multiple pairs exist, return any one of them.

Constraints

  • 0 <= nums.length <= 10^5
  • -10^9 <= nums[i] <= 10^9
  • -10^9 <= target <= 10^9
  • Return any valid pair when multiple pairs exist
  • Return [] when no valid pair exists

Function Signature

def find_pair(nums, target):
Interviewer

Your question is Find Pair With Given 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.