Frequency of each element in an integer array | Brute force | JAVA interview question

Frequency of each element in an integer array using Brute force technique. O(n^2)
JAVA interview question
#JAVA

[@myviewyt3332]

Well explained

[@kalpshah2070]

i have doubt related that you have print elements and their frequency for unique elements that not visited but what about that elements that stored in freq[j] how they print?

[@politics2198]

very Awesome explaination.

[@TechnosageLearning]

Thank you!

[@AkashYadav-tc2lo]

very well explained. Thanks, but still i have a confusion on why we have stored visited in arr[j] ??

[@TechnosageLearning]

We have set freq[j] = visited....because we have already updated the count of that element(freq[j]) and we dont want to visit that element again Otherwise same element's frequency will be updated again and again and it wont provide the required result.

[@Riteshpc-c3x]

thanks

[@samdarsh3795]

Well explained mam 👍

[@TechnosageLearning]

Thank you😊

[@rajrawat6376]

How to do it if time complexity O(N) using brute force

[@TechnosageLearning]

kzbin.info/www/bejne/pqu0p359mN-YaaM Checkout this video

[@rajrawat6376]

@@TechnosageLearning yeah i hve checked out this but the concept of has map isn't thought to us yet so i was asking if there was any other way

[@basithnizam]

what will happen if the give array has value of visited that is "-1"

[@yashas1322]

it will not print(exclude)

[@supriya_codes]

which screen recorder u r using??

[@TechnosageLearning]

Default Mac screen capture tool

[@Caped_Crusader7]

why visited = -1?

[@user-bw7ew9lr5l]

same as the code in the internet

[@naushadalam5129]

8 2 0 1 1 1 0 3 1 ans=2 4 1 1 code output=2 4 1 0 how can i handle this case

[@naushadalam5129]

after sorting array