All nearest smaller values

The "All Nearest Smaller Values" problem typically refers to a common computational challenge in data structures and algorithms. The goal is to find, for every element in an array, the nearest smaller element that precedes it. If no such element exists, you can represent that with a sentinel value such as `None` or `-1`. ### Explanation 1. **Input**: An array or list of integers.