Find Target Indices After Sorting Array - Problem
Find Target Indices After Sorting Array
You are given a
A target index is an index
Goal: Return a list of target indices after sorting
Example: If
You are given a
0-indexed integer array nums and a target element target. Your task is to find all positions where the target appears after sorting the array in non-decreasing order.A target index is an index
i such that nums[i] == target in the sorted array.Goal: Return a list of target indices after sorting
nums in ascending order. If no target indices exist, return an empty list. The returned list must be sorted in increasing order.Example: If
nums = [1,2,5,2,3] and target = 2, after sorting we get [1,2,2,3,5], so target appears at indices [1,2]. Input & Output
example_1.py — Basic Case
$
Input:
nums = [1,2,5,2,3], target = 2
›
Output:
[1,2]
💡 Note:
After sorting, nums becomes [1,2,2,3,5]. The target 2 appears at indices 1 and 2.
example_2.py — Target Not Found
$
Input:
nums = [1,2,5,2,3], target = 4
›
Output:
[]
💡 Note:
After sorting, nums becomes [1,2,2,3,5]. The target 4 does not appear in the array, so return empty list.
example_3.py — Single Element
$
Input:
nums = [1], target = 1
›
Output:
[0]
💡 Note:
The array has only one element equal to target, so it appears at index 0 after sorting.
Constraints
- 1 ≤ nums.length ≤ 100
- 1 ≤ nums[i] ≤ 100
- 1 ≤ target ≤ 100
Visualization
Tap to expand
Understanding the Visualization
1
Count Books
Count how many books have smaller IDs and how many match target ID
2
Calculate Positions
Books with smaller IDs come first, followed by target books
3
Generate Result
Create consecutive positions starting from the calculated starting point
Key Takeaway
🎯 Key Insight: The position of target elements in a sorted array can be calculated mathematically by counting smaller and equal elements, eliminating the need for actual sorting!
💡
Explanation
AI Ready
💡 Suggestion
Tab
to accept
Esc
to dismiss
// Output will appear here after running code