JobsJob TrackerJob alerts

SurveySparrow ยท 11 questions

All 11Coding 6Low-Level Design 1Behavioral 2
  • Build a library management system websiteLow-Level Design
  • Merge two sorted arraysCoding
  • Check whether a string is a palindromeCoding
  • Find a pair whose values add up to n in O(n) timeCoding
  • Rotate an arrayCoding
  • Inheritance and ACID properties
  • Questions on the take-home assignmentBehavioral
  • Explain how networking works in the real world
  • Why SurveySparrow and where do you see yourself in five yearsBehavioral
  • Block vs Inline Elements and Centering a DivCoding
  • React UseEffect, Hooks, and Component TypesCoding
โ† SurveySparrow questions
  1. Interview questions
  2. SurveySparrow
  3. Find a pair whose values add up to n in O(n) time
Coding

Find a pair whose values add up to n in O(n) time

Filed under SurveySparrow

The question

The candidate was asked to find a pair of elements whose sum equals n, with O(n) time complexity.

No write-up yet. Related questions below have one.

Related SurveySparrow questions

  • Block vs Inline Elements and Centering a Div
  • React UseEffect, Hooks, and Component Types
โ† Check whether a string is a palindromeRotate an array โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.