WWorkday·DSASDE-2Onsite – Coding 1
Greedy String / Binary Search Problem
Problem
A greedy string-construction or a binary-search-on-answer problem (e.g., smallest feasible value satisfying a monotonic predicate).
Example
binary search the minimum capacity to ship packages within D days
Constraints
- Monotonic feasibility check
Approach
Identify the monotonic predicate; binary search the boundary. Explain the check function.
added 6 days ago