Relative Sort Array - Leetcode 1122 - Java

Problem Description Given 2 arrays - `arr1` and `arr2`, sort the elements of `arr1` such that the relative ordering of items in `arr1` is the same as in `arr2`. Elements that do not appear in `arr2` should be placed at the end of `arr1` in *ascending* order. Problem: leetcode.com/problems/relative-sort-array/descript… Code link: k5kc.com/cs/algorithms/relative-sort-array-problem…

• #education
• #java
• #leetcode
• #coding
• #coding_challenge
• #sorting
• #hashmap
• #bucketsort