Map sort by its values | Priority Queue | java 8 | Comparator | Lamda | Problem solving

Sorting Hashmap by its values using priority queue:
minHeap algorithm used internally in priority queue.

minheap return first the lowest values from heap(from all elements in queue)
#Time_Complexity:
#Hashmap insertion: O(1)
#PriorityQueue insertion : (log(n))

Overall TC for sorting: O(nlog(n)) n is number of elements in map
Overall Space Complexity: O(n)

#java, #priorityQueue,#comparator,#lamda, #interviewquestion
#collections #data structures #algorithms #leetcode #minHeap
#time_complexity #problem #hashMap_sort_on_values #hashmap
Related searches:
HashMap sorting by its values
HashMap sorting by its values in java 8
Sort Map based on values
Sort Map based on values in java 8
Sort Map using values

[temirlandivine]

Thanks a lot, it helped me to do Huffman encoding!

[leetcode]

Amazing Paaji, cleared all the concepts about lambda functions