Check if the frequency of all the digits in a number is same Last Updated : 13 Sep, 2022 Comments Improve Suggest changes Like Article Like Report Given a positive number 'N', the task is to find whether 'N' is balanced or not. Output 'YES' if 'N' is a balanced number else 'NO'. A number is balanced if the frequency of all the digits in it is same i.e. all the digits appear the same number of times. Examples: Input: N = 1234567890 Output: YES The frequencies of all the digits are same. i.e. every digit appears same number of times. Input: N = 1337 Output: NO Approach: Create an array freq[] of size 10 which will store the frequency of each digit in 'N'.Then, check if all the digits of 'N' have the same frequency or not.If yes then print 'YES' or 'NO' otherwise. Below is the implementation of the above approach: C++ // C++ implementation of the approach #include <bits/stdc++.h> using namespace std; // returns true if the number // passed as the argument // is a balanced number. bool isNumBalanced(int N) { string st = to_string(N); bool isBalanced = true; // frequency array to store // the frequencies of all // the digits of the number int freq[10] = { 0 }; int i = 0; int n = st.size(); for (i = 0; i < n; i++) // store the frequency of // the current digit freq[st[i] - '0']++; sort(freq,freq+10); int k=9; // last index of the array while(freq[k-1]!=0){ if(freq[k]!=freq[k-1]){ isBalanced=false; } k--; } // return true if // the string is balanced if (isBalanced) return true; else return false; } // Driver code int main() { int N = 1234567890; // Function call bool flag = isNumBalanced(N); if (flag) cout << "YES"; else cout << "NO"; } // This code is contributed by ihritik Java // JAVA implementation using Hashmap and Collection import java.util.*; public class Num_balanced { public static boolean isNumBalanced(int n) { // Calling integer to char array convert function char[] num = num_to_arr(n); // HashMap is used to store key value pairs HashMap<Character, Integer> hp = new HashMap<Character, Integer>(); // traverse char array and store array elements as // key and their frequency as their value for (int i = 0; i < num.length; i++) { // if element already exists in the HashMap, so // we increment its previous value if (hp.containsKey(num[i])) { hp.put(num[i], hp.get(num[i]) + 1); } // element does'nt exist in the HashMap, so we // initialize its value with 1 else { hp.put(num[i], 1); } } // use Collection to store values of all the keys Collection c = (Collection)hp.values(); // use iterator to iterate over each value Iterator<?> iterator = c.iterator(); int temp = (Integer) iterator.next(); while (iterator.hasNext()) { // compare each value to be equal, if not return // false if ((int) iterator.next() != temp) { return false; } } // each value was equal so return true return true; } // This function converts integer into char array public static char[] num_to_arr(int num) { // Convert integer into String String str = Integer.toString(num); char[] arr = new char[str.length()]; // Insert characters of the string into char array for (int i = 0; i < str.length(); i++) { arr[i] = str.charAt(i); } return arr; } // Driver code public static void main(String[] args) { int n_1 = 1234567890; // Function call if (isNumBalanced(n_1)) { // if number is balanced System.out.println("YES"); } else { // if number is not balanced System.out.println("NO"); } } } // Code Contributed by YESHU GARG Java // Implementation of JAVA to check the // given number is Balanced or not import java.util.*; public class Main { // returns true if the number // passed as the argument // is a balanced number. public static boolean isNumBalanced(int num) { // to get the absolute value of the number num = Math.abs(num); // to convert the int number into a String String str = num + ""; // to convert the String into Character Array char[] ch_arr = str.toCharArray(); // HashSet is used to remove the duplicates // in the Character Array HashSet<Character> hs = new HashSet<Character>(); for (char ch : ch_arr) { // Adding the Characters in the Array in the Set hs.add(ch); } // getting the length of the String int str_len = str.length(); // getting the numbers of elements in the HashSet int hs_len = hs.size(); // return true if // the number is balanced // checks for the number is balanced or not by // comparing length of String and HashSet if (hs_len <= str_len / 2 || hs_len == str_len) { return true; } return false; } // Driver Code public static void main(String[] args) { int N = 1234567890; // Function call boolean flag = isNumBalanced(N); if (flag) System.out.println("YES"); else System.out.println("NO"); } } // This code is contributed by Mano Python3 # Python3 implementation of the above approach # Returns true if the number passed as # the argument is a balanced number. def isNumBalanced(N): st = str(N) isBalanced = True # Frequency array to store the frequencies # of all the digits of the number freq = [0] * 10 n = len(st) for i in range(0, n): # store the frequency of the # current digit freq[int(st[i])] += 1 for i in range(0, 9): # if freq[i] is not equal to # freq[i + 1] at any index 'i' # then set isBalanced to false if freq[i] != freq[i + 1]: isBalanced = False # Return true if the string # is balanced if isBalanced: return True else: return False # Driver code if __name__ == "__main__": N = 1234567890 # Function call flag = isNumBalanced(N) if flag: print("YES") else: print("NO") # This code is contributed by Rituraj Jain C# // CSHARP implementation of the above approach using System; class Program { // returns true if the number // passed as the argument // is a balanced number. static bool isNumBalanced(int N) { String st = "" + N; bool isBalanced = true; // frequency array to store // the frequencies of all // the digits of the number int[] freq = new int[10]; int i = 0; int n = st.Length; for (i = 0; i < n; i++) // store the frequency of // the current digit freq[st[i] - '0']++; for (i = 0; i < 9; i++) { // if freq[i] is not // equal to freq[i + 1] at // any index ‘i’ then set // isBalanced to false if (freq[i] != freq[i + 1]) isBalanced = false; } // return true if // the string is balanced if (isBalanced) return true; else return false; } // Driver code static void Main() { int N = 1234567890; // Function call bool flag = isNumBalanced(N); if (flag) Console.WriteLine("YES"); else Console.WriteLine("NO"); } // This code is contributed by ANKITRAI1 } PHP <?php // PHP implementation of the approach // returns true if the number // passed as the argument // is a balanced number. function isNumBalanced($N) { $st = "" . strval($N); $isBalanced = true; // frequency array to store // the frequencies of all // the digits of the number $freq = array_fill(0, 10, 0); $i = 0; $n = strlen($st); for ($i = 0; $i < $n; $i++) // store the frequency of // the current digit $freq[ord($st[$i]) - ord('0')]++; for ($i = 0; $i < 9; $i++) { // if freq[i] is not // equal to freq[i + 1] at // any index 'i' then set // isBalanced to false if ($freq[$i] != $freq[$i + 1]) $isBalanced = false; } // return true if // the string is balanced if ($isBalanced) return true; else return false; } // Driver code $N = 1234567890; // Function call $flag = isNumBalanced($N); if ($flag) echo "YES\n"; else echo "NO\n"; // This code is contributed by mits ?> JavaScript <script> // Javascript implementation of // the above approach // Returns true if the number // passed as the argument // is a balanced number. function isNumBalanced(N) { var st = N; var isBalanced = true; // Frequency array to store // the frequencies of all // the digits of the number var freq = new Array(10); var i = 0; var n = st.length; for(i = 0; i < n; i++) // Store the frequency of // the current digit freq[st[i] - 0]++; for(i = 0; i < 9; i++) { // If freq[i] is not // equal to freq[i + 1] at // any index ‘i’ then set // isBalanced to false if (freq[i] != freq[i + 1]) isBalanced = false; } // Return true if // the string is balanced if (isBalanced) return true; else return false; } // Driver code var N = 1234567890; // Function call var flag = isNumBalanced(N); if (flag) document.write("YES"); else document.write("NO"); // This code is contributed by bunnyram19 </script> OutputNO Complexity Analysis: Time Complexity: O(NlogN), since the complexity for the sort function is n lognAuxiliary Complexity: O(1), though there a frequency array but it takes only 10 space which is constant no of spaces hence the overall space complexity is constant Comment More infoAdvertise with us Next Article Analysis of Algorithms A AmanKumarSingh Follow Improve Article Tags : DSA Similar Reads Basics & PrerequisitesLogic Building ProblemsLogic building is about creating clear, step-by-step methods to solve problems using simple rules and principles. Itâs the heart of coding, enabling programmers to think, reason, and arrive at smart solutions just like we do.Here are some tips for improving your programming logic: Understand the pro 2 min read Analysis of AlgorithmsAnalysis of Algorithms is a fundamental aspect of computer science that involves evaluating performance of algorithms and programs. Efficiency is measured in terms of time and space.BasicsWhy is Analysis Important?Order of GrowthAsymptotic Analysis Worst, Average and Best Cases Asymptotic NotationsB 1 min read Data StructuresArray Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 3 min read String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut 2 min read Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The 2 min read Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Hereâs the comparison of Linked List vs Arrays Linked List: 2 min read Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first 2 min read Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems 2 min read Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most 4 min read Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of 3 min read Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this 15+ min read AlgorithmsSearching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input 2 min read Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution 14 min read Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get 3 min read Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net 3 min read Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of 3 min read Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit 4 min read AdvancedSegment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree 3 min read Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i 2 min read GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br 2 min read Interview PreparationInterview Corner: All Resources To Crack Any Tech InterviewThis article serves as your one-stop guide to interview preparation, designed to help you succeed across different experience levels and company expectations. Here is what you should expect in a Tech Interview, please remember the following points:Tech Interview Preparation does not have any fixed s 3 min read GfG160 - 160 Days of Problem SolvingAre you preparing for technical interviews and would like to be well-structured to improve your problem-solving skills? Well, we have good news for you! GeeksforGeeks proudly presents GfG160, a 160-day coding challenge starting on 15th November 2024. In this event, we will provide daily coding probl 3 min read Practice ProblemGeeksforGeeks Practice - Leading Online Coding PlatformGeeksforGeeks Practice is an online coding platform designed to help developers and students practice coding online and sharpen their programming skills with the following features. GfG 160: This consists of most popular interview problems organized topic wise and difficulty with with well written e 6 min read Problem of The Day - Develop the Habit of CodingDo you find it difficult to develop a habit of Coding? If yes, then we have a most effective solution for you - all you geeks need to do is solve one programming problem each day without any break, and BOOM, the results will surprise you! Let us tell you how:Suppose you commit to improve yourself an 5 min read Like