Business
Jobs
  • About Us
  • Solutions
    • Job Postings
      Post your job and receive qualified candidates in 48h.
    • Candidate Assessments
      500+ technical and psychological tests, plus anti-fraud.
    • Headhunting
      Tailor-made executive search from start to finish.
    • Payroll + EOR
      Payroll dispersal and EOR across 15+ LATAM countries.
  • Pricing
  • Jobs

0

105
Views
how to solve this function in O(N) time complexity instead of O(N^2)? or how can i improve time complexity?

I have An array . I want pairs such that their sum is closest to 54. I know how to solve it. But solution that i know is taking O(N^2) time complexity. is there a way to get sum of all value pairs in O(N) in javascript?

let arr = [20 , 30, 18, 40 , 22]
const x = 54

output (30,22)
about 4 years ago · Juan Pablo Isaza
Answer question
Find remote jobs

Discover the new way to find a job!

Top jobs
Top job categories
Business
Post vacancy Pricing Sales
Legal
Terms and conditions Privacy policy
© 2026 PeakU Inc. All Rights Reserved.
Andres GPT
Show me some job opportunities
There's an error!