Скачать или смотреть Check if frequencies can be equal solved in JS | GfG | POTD | Streak 207 | Wed, 25 Jun 2025 | NCS

Given a string s consisting only lowercase alphabetic characters, check whether it is possible to remove at most one character such that the frequency of each distinct character in the string becomes same. Return true if it is possible; otherwise, return false.

Examples:

Input: s = "xyyz"
Output: true
Explanation: Removing one 'y' will make frequency of each distinct character to be 1.
Input: s = "xyyzz"
Output: true
Explanation: Removing one 'x' will make frequency of each distinct character to be 2.
Input: s = "xxxxyyzz"
Output: false
Explanation: Frequency can not be made same by removing at most one character.

#coding #GeeksforGeeks #ProblemOfTheDay #JavaScript

---
introduction:
name: "Jagadeesh Kumar S"
contact: "+91 73972 85837 | [email protected]"
description: "A problem-solving enthusiast passionate about coding challenges."

technical_achievements:
"Solved 100+ daily coding challenges on GeeksforGeeks"
"Ranked in the top 130 on SRM Institute of Science and Technology's GeeksforGeeks leaderboard"
"Maintained a 100+ day streak for Problem of the Day"

github:
contributions: "Solutions available at https://github.com/JKS-sys/Solution-T..."
---