1122. Relative Sort Array | sorting | leetcode daily challenge | DSA | shashwat tiwari | Hindi

[@RohitKumar-dz8dh]

Thanks 😊

[@dibakarbera1971]

excellent explanation sir

[@thenikhildaiya.]

Mene aapki kal ki leetcode daily problem waali video se counting sort wala solution dekha.
And aaj waali problem se relate kar paya and solved it on my own😊
And my approach and solution were almost same as yours.
Thank You!

[@ankitraj4179]

Java Code :
class Solution {
public int[] relativeSortArray(int[] arr1, int[] arr2) {
int n1 = arr1.length ;
int n2 = arr2.length ;
Arrays.sort(arr1) ;
HashMap map = new HashMap() ;
for(int i = 0 ; i 0) {
arr1[k] = key;
k++;
count--;
}
}
return arr1 ;
}
}

[@ankitraj4179]

Java Code (Optimized)
class Solution {
public int[] relativeSortArray(int[] arr1, int[] arr2) {
int n1 = arr1.length , n2 = arr2.length ;
int Max = Integer.MIN_VALUE ;
for(int i = 0 ; i< n1 ; i++){
Max = Math.max(Max,arr1[i]) ;
}
int[] count = new int[Max+1] ;
for(int i = 0 ; i

[@mr.nishantawasthi4402]

Sir ab to bata dijiye ki tree series k baad kya padhne wale hai please 🙏