You are given a 0-indexed array of positive integers, nums, and a value, target. The target represents an index $i$ in the array such that nums[i] == target.

Your task is to return a list of indexes of nums where the value equals target after sorting the array in nondecreasing order. If no such indexes exist, return an empty list. Ensure the returned list is sorted in increasing order.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $1 \leq$ nums[i], target $\leq 100$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.