I've noticed that there is a type of question which asks to minimize/maximize a value given a conditional.

Either DP can be used to solve these problems or binary search. The question is, how would you immediately distinguish which one you need to use? Especially at first glance, these questions tend to have a monotonically increasing condition function

I would only notice after trying to create the condition function for binary search and then realizing it's quite complicated. This is not an ideal approach. I've wasted more time than what I believe is needed. Also, what if I just didn't think of the best condition function?

Here are some examples:
https://leetcode.com/problems/koko-eating-bananas/
https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/
https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule/
https://leetcode.com/problems/allocate-mailboxes/

Thanks!