Search
⌘K

Leetcode 1237. Find Positive Integer Solution for a Given Equation

Given a black-box function f(x, y) that is strictly increasing in both x and y and a target z, return all positive integer pairs (x, y) in the range 1..1000 such that f(x,y) == z. The monotonicity of f lets you efficiently locate solutions without knowing its explicit formula.


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Comments

Your account is free and you can post anonymously if you choose.