Java Interview Question Part 2 Implementation | Sorting of Array Depending on Frequency of Elements

You are given any array of length n.
You have to sort the array elements in descending order of their frequency.
Use of Collections is not allowed

E.g :
Input : [4,3,1,6,4,3,6,4]
Output : [4,4,4,3,3,6,6,1]

Follow on Facebook:

Subscribe to our other channel:
Telusko Hindi :

[health.upgradedbyscience.]

Perfect explanation! I see myself sitting in the next interview and will have a chance this time - just by your help! Thanks a lot!!

[sagarmeena]

need more videos like these...thanks Telusko!

[shivam]

where is the part 1 please give me the link

[dheerajsahu]

We can use hashmap here instead of 2-D array

[narendra]

Hi Navin,
When element is added for first time you are saying default .but where are you mentioning it?

[praveenbi]

Hallo Navin,
int[] array = {2, 4, 2, 2, 3, 6, 9, 9, 9, 9};

int element = 0;
int count = 0;

for( int i = 0 ; i < array.length; i++) {

int tempElement = array[i];
int tempCount= 0;
for(int j = 0; j < array.length; j++) {
if(array[j] == tempElement)
tempCount++;
}
i did up to hear, After that how should i sort them in dependency Bcoz all the frequency values is there in "tempCount++" where should i store them and how should i call them to sort?

I think for this no need of two dimentional "System.out.println(" " + element + "---> " + count);"

[mohammedshafiuddin]

Hi Navin, I like your pet word...."then question arise".

[AA-dljw]

Please make more vedios on java interview questions

[adikittur]

Flaw in your code: else for step 2 missing 1 line!
else
{
row++;
b[row][0]=arr[i];
b[row][1]=1;
//missing!!!!
}

[Adam-gpij]

Could not understand ! we could use hashMap

[praveenbi]

Hallo Navin, Sorry to say, Seriously i didn't understand what you are saying, And i need clear explanation about frequency of elements sorting in dependency i need to know if possible can you please help me

[tagorebanda]

Hi sir,
i am tagore. i am not using sort method.

My without sort method code:

int arr1[] = {9, 4, 2, 8, 1};

for(int a = 0; a<arr1.length; a++) {
for(int b=a; b<arr1.length; b++ ) {
if(arr1[a]>arr1[b])
+ arr1[b] - (arr1[a] = arr1[b]);
}
System.out.print(arr1[a] + " ");
}

[sourabhpothula]

Please try to complete explanation of a problem in one video

[niketkumar]

Please, there are better approaches than this, you could have used BST or hash

[sugyanpatnaik]

Hi Naveen,

The kind of explanation you are using to explain the technique is totally not understandable.
May be you should practice teaching before uploading/recording the video

@Naveen

[shahrukh]

First time I'm disappointed with your video.

[moin]

Very very poor explanation. Please remove this and put a new video. You're clearly under prepared here.