Search⌘ K
AI Features

Solution: Find Target Indices After Sorting Array

Explore how to solve the problem of finding all indices where a target value appears after sorting an array. Learn to implement sorting combined with a linear search to efficiently collect these indices, while understanding the algorithm's time and space complexity.

Statement

You are given a 0-indexed array of positive integers, nums, and a value, target. The target represents an index ii 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:

  • ...