Describe an algorithm that locates the last occurrence of the smallest element in a finite list of integers, where the integers in the list arc not necessarily distinct.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.