Скачать или смотреть Game With String - HashMap, Heap

Problem Overview
The challenge involves minimizing the value of a given string by removing exactly `k` characters.
The string is composed of lowercase letters, and its value is calculated as the sum of the squares of the frequencies of each distinct character.
Example: For the string "aabc", removing two 'a's gives a frequency of {b: 1, c: 1}, leading to a total value of 2 (1² + 1²).

Data Structures Used
A HashMap is employed to keep track of character frequencies, where keys are characters and values are their respective counts.
A Priority Queue (or max heap) is used to efficiently retrieve and manage the characters based on their frequencies, allowing for quick access to the character with the highest frequency for removal.
The priority queue requires a custom comparator to ensure it sorts entries based on frequency in descending order.

Algorithm Steps
First, construct a frequency map of the characters in the string.
Populate the priority queue with entries from the frequency map, using a custom comparator to prioritize higher frequencies.
Perform a loop to remove `k` characters by decrementing the highest frequency character in the queue and reinserting it.
Finally, calculate the minimized string value by iterating through the remaining characters in the priority queue, squaring their frequencies, and summing the results.

Expected Complexity
The algorithm operates in linear time complexity, O(n), where n is the length of the input string.
The use of the priority queue facilitates efficient management of character frequencies during the removal process, ensuring optimal performance.

-----------------------------------------
Please check my playlists :
•    • LeetCode Top 150 Interview Questions  
•    • GfG Problem of the Day  
•    • Array/String  
•    • Two Pointers  
•    • Two Pointers  
•    • Matrix  
•    • Hashmap  
•    • Intervals  
•    • Stack  
•    • Linked List  
•    • Binary Tree General  
•    • Binary Tree BFS  
•    • Binary Search Tree  
•    • Graph General  
•    • Graph BFS  
•    • Trie  
•    • Backtracking  
•    • Divide & Conquer  
•    • Kadane's Algorithm  
•    • Binary Search  
•    • Heap  
•    • Bit Manipulation  
•    • Math  
•    • 1D DP  
•    • Math  

LinkedIn:   / paulepps  
Teachable: https://code-and-conquer.teachable.com