Identifying the upper bound pattern

The upper bound algorithm is another very versatile algorithm that can solve a wide variety of search problems and is especially useful on non-decreasing arrays where there are repetitions. In most cases, the upper bound algorithm solves subproblems within a larger, more complex problem to make the overall solution more efficient. These are generally easy or medium problems where we must apply the upper bound algorithm one or more times or leverage its constraints to our benefit. 

If the problem statement or its solution follows the generic template below, it can be solved by applying the upper bound algorithm.