Strictly Convex Function Minimum
Find the optimal 1D and 2D coordinates within integer bounds requiring minimal black-box evaluations using a nested binary search. Asked at Uber.
Check more interview questions and experiences about Uber
Find the optimal 1D and 2D coordinates within integer bounds requiring minimal black-box evaluations using a nested binary search. Asked at Uber.
Check more interview questions and experiences about Uber
Please log in to view interview question details