LeetCode 2089 | Find Target Indices After Sorting Array | 2 Approaches | O(n log n) & O(n)

Today’s LeetCode Problem of the Day — Day 30 In this video, we solve LeetCode 2089: Find Target Indices After Sorting Array using 2 approaches, explained in simple language with an example. 📌 Problem: Given an array nums and a target, return the indices where the target appears after sorting the array in non-decreasing order. ⏱️ Timestamps 00:00 — Approach 1: Sorting the Array — O(n log n) 03:30 — Approach 2: Without Sorting — O(n) If you’re preparing for coding interviews or improving your DSA skills, follow along and try implementing both approaches! 👍 Like the video, comment your approach, and subscribe for more daily LeetCode solutions. #LeetCode #LeetCodePOTD #DSA #CodingInterview #Cpp #ProblemOfTheDay #Day30