โ† BNY Mellon questions

Modified Two Sum in O(logn) time and string manipulation

Filed under BNY Mellon

Given a sorted array of integers and a target value, determine if there exists a pair of elements that sum up to the target in O(log n) time complexity.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related BNY Mellon questions

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