PROBLEM OF THE DAY : 08/03/2024 | Check if frequencies can be equal
source link: https://www.geeksforgeeks.org/videos/problem-of-the-day-08032024-check-if-frequencies-can-be-equal/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Check if frequencies can be equal
Welcome to the daily solving of our PROBLEM OF THE DAY with Yash Dwivedi. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Strings but also build up problem-solving skills.
In this problem, we are given a string s which contains only lower alphabetic characters, check if it is possible to remove at most one character from this string in such a way that frequency of each distinct character becomes same in the string. Return true if it is possible to do else return false.
Note: The driver code print 1 if the value returned is true, otherwise 0.
Example :
Input:
s = "xyyz"
Output:
1
Explanation:
Removing one 'y' will make frequency of each character to be 1.
Give the problem a try before going through the video. All the best!!!
Problem Link: https://www.geeksforgeeks.org/problems/check-frequencies4211/1
Solution IDE Link: https://ide.geeksforgeeks.org/online-cpp-compiler/267c5631-97f0-401b-88c3-48465f7b41ea
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK