1122. Relative Sort Array | LeetCode Solution

In this video, I solve LeetCode Problem 1122 — Relative Sort Array using an easy and beginner-friendly approach in C++. 📌 Problem Statement: Given two arrays arr1 and arr2, the elements of arr2 are distinct, and all elements in arr2 are also present in arr1. Sort the elements of arr1 such that: The relative ordering of elements that appear in arr2 matches the order in arr2. Elements not present in arr2 are placed at the end in ascending order. 🔹 Example 1: Input: arr1 = [2,3,1,3,2,4,6,7,9,2,19] arr2 = [2,1,4,3,9,6] Output: [2,2,2,1,4,3,3,9,6,7,19] Explanation: Elements present in arr2 are arranged according to its order, while the remaining elements are sorted and placed at the end. 🔹 Example 2: Input: arr1 = [28,6,22,8,44,17] arr2 = [22,28,8,6] Output: [22,28,8,6,17,44] Explanation: The elements from arr2 appear first in the required order, followed by the remaining elements in ascending order. 💡 In this solution, we will: Use Frequency Counting (Hash Map) Preserve the order defined by arr2 Sort the remaining elements separately Achieve an efficient solution Write clean and optimized C++ code 🚀 Perfect for beginners practicing: Arrays, Hashing, Counting Sort, Sorting, LeetCode Easy Problems, C++ DSA Preparation If you found this video helpful, make sure to Like 👍, Share 📤, and Subscribe 🔔 for more coding and DSA content! Problem-Specific Tags