# Check whether frequency of characters in a string makes Fibonacci Sequence

Given a string with lowercase English alphabets. The task is to check whether the frequency of the characters in the string can be arranged as a Fibonacci series. If yes, print “YES”, otherwise print “NO”.

Note:

• Frequencies can be arranged in any way to form Fibonacci Series.
• The Fibonacci Series starts from 1. That is the series is 1,1,2,3,5,…..

Examples:

```Input : str = "abeeedd"
Output : YES
Frequency of 'a' => 1
Frequency of 'b' => 1
Frequency of 'e' => 3
Frequency of 'd' => 2
These frequencies are first 4 terms of
Fibonacci series => {1, 1, 2, 3}

Input : str = "dzzddz"
Output : NO
Frequencies are not in Fibonacci series
```

Approach:

• Store the frequencies of each character of the string in a map. Let the size of the map be after storing frequencies.
• Then, make a vector and insert first ‘n’ elements of the Fibonacci series in this vector.
• Then, compare each element of the vector with values of the map. If both elements of vector and values of the map are same, print ‘YES’, otherwise print ‘NO’.

Below is the implementation of the above approach:

## C++

 `// C++ program to check whether frequency of ` `// characters in a string makes ` `// Fibonacci Sequence ` ` `  `#include ` `using` `namespace` `std; ` ` `  `// Function to check if the frequencies ` `// are in Fibonacci series ` `string isFibonacci(string s) ` `{ ` `    ``// map to store the ` `    ``// frequencies of character ` `    ``map<``char``, ``int``> m; ` ` `  `    ``for` `(``int` `i = 0; i < s.length(); i++) { ` `        ``m[s[i]]++; ` `    ``} ` ` `  `    ``// Vector to store first n ` `    ``// fibonacci numbers ` `    ``vector<``int``> v; ` ` `  `    ``// Get the size of the map ` `    ``int` `n = m.size(); ` ` `  `    ``// a and b are first and second terms of ` `    ``// fibonacci series ` `    ``int` `a = 1, b = 1; ` ` `  `    ``int` `c; ` `    ``v.push_back(a); ` `    ``v.push_back(b); ` ` `  `    ``// vector v contains elements of fibonacci series ` `    ``for` `(``int` `i = 0; i < n - 2; i++) { ` `        ``v.push_back(a + b); ` `        ``c = a + b; ` `        ``a = b; ` `        ``b = c; ` `    ``} ` ` `  `    ``int` `flag = 1; ` `    ``int` `i = 0; ` ` `  `    ``// Compare vector elements with values in Map ` `    ``for` `(``auto` `itr = m.begin(); itr != m.end(); itr++) { ` `        ``if` `(itr->second != v[i]) { ` `            ``flag = 0; ` `            ``break``; ` `        ``} ` ` `  `        ``i++; ` `    ``} ` ` `  `    ``if` `(flag == 1) ` `        ``return` `"YES"``; ` `    ``else` `        ``return` `"NO"``; ` `} ` ` `  `// Driver code ` `int` `main() ` `{ ` `    ``string s = ``"abeeedd"``; ` ` `  `    ``cout << isFibonacci(s); ` ` `  `    ``return` `0; ` `} `

## Java

 `// Java program to check whether frequency of  ` `// characters in a string makes  ` `// Fibonacci Sequence  ` `import` `java.util.HashMap; ` `import` `java.util.Vector; ` ` `  `class` `GFG  ` `{ ` ` `  `    ``// Function to check if the frequencies ` `    ``// are in Fibonacci series ` `    ``static` `String isFibonacci(String s)  ` `    ``{ ` ` `  `        ``// map to store the ` `        ``// frequencies of character ` `        ``HashMap m = ``new` `HashMap<>(); ` `        ``for` `(``int` `i = ``0``; i < s.length(); i++) ` `            ``m.put(s.charAt(i),  ` `            ``m.get(s.charAt(i)) == ``null` `? ``1` `:  ` `            ``m.get(s.charAt(i)) + ``1``); ` ` `  `        ``// Vector to store first n ` `        ``// fibonacci numbers ` `        ``Vector v = ``new` `Vector<>(); ` ` `  `        ``// Get the size of the map ` `        ``int` `n = m.size(); ` ` `  `        ``// a and b are first and second terms of ` `        ``// fibonacci series ` `        ``int` `a = ``1``, b = ``1``; ` ` `  `        ``int` `c; ` `        ``v.add(a); ` `        ``v.add(b); ` ` `  `        ``// vector v contains elements of  ` `        ``// fibonacci series ` `        ``for` `(``int` `i = ``0``; i < n - ``2``; i++)  ` `        ``{ ` `            ``v.add(a + b); ` `            ``c = a + b; ` `            ``a = b; ` `            ``b = c; ` `        ``} ` ` `  `        ``int` `flag = ``1``; ` `        ``int` `i = ``0``; ` ` `  `        ``// Compare vector elements with values in Map ` `        ``for` `(HashMap.Entry entry : m.entrySet())  ` `        ``{ ` `            ``if` `(entry.getValue() != v.elementAt(i))  ` `            ``{ ` `                ``flag = ``1``; ` `                ``break``; ` `            ``} ` ` `  `            ``i++; ` `        ``} ` `         `  `        ``if` `(flag == ``1``) ` `            ``return` `"YES"``; ` `        ``else` `            ``return` `"NO"``; ` `    ``} ` ` `  `    ``// Driver Code ` `    ``public` `static` `void` `main(String[] args)  ` `    ``{ ` `        ``String s = ``"abeeedd"``; ` `        ``System.out.println(isFibonacci(s)); ` `    ``} ` `} ` ` `  `// This code is contributed by ` `// sanjeev2552 `

## Python3

 `# Python3 program to check whether the frequency ` `# of characters in a string make Fibonacci Sequence ` `from` `collections ``import` `defaultdict ` ` `  `# Function to check if the frequencies ` `# are in Fibonacci series ` `def` `isFibonacci(s): ` ` `  `    ``# map to store the frequencies of character ` `    ``m ``=` `defaultdict(``lambda``:``0``) ` ` `  `    ``for` `i ``in` `range``(``0``, ``len``(s)):  ` `        ``m[s[i]] ``+``=` `1` ` `  `    ``# Vector to store first n fibonacci numbers ` `    ``v ``=` `[] ` ` `  `    ``# Get the size of the map ` `    ``n ``=` `len``(m) ` ` `  `    ``# a and b are first and second ` `    ``# terms of fibonacci series ` `    ``a ``=` `b ``=` `1` ` `  `    ``v.append(a) ` `    ``v.append(b) ` ` `  `    ``# vector v contains elements of ` `    ``# fibonacci series ` `    ``for` `i ``in` `range``(``0``, n ``-` `2``): ` `        ``v.append(a ``+` `b) ` `        ``c ``=` `a ``+` `b ` `        ``a, b ``=` `b, c ` ` `  `    ``flag, i ``=` `1``, ``0` ` `  `    ``# Compare vector elements with values in Map ` `    ``for` `itr ``in` `sorted``(m):  ` `        ``if` `m[itr] !``=` `v[i]:  ` `            ``flag ``=` `0` `            ``break` `         `  `        ``i ``+``=` `1` `     `  `    ``if` `flag ``=``=` `1``: ` `        ``return` `"YES"` `    ``else``: ` `        ``return` `"NO"` ` `  `# Driver code ` `if` `__name__ ``=``=` `"__main__"``: ` ` `  `    ``s ``=` `"abeeedd"` `    ``print``(isFibonacci(s)) ` ` `  `# This code is contributed by Rituraj Jain `

## C#

 `// C# program to check whether frequency of  ` `// characters in a string makes  ` `// Fibonacci Sequence  ` `using` `System; ` `using` `System.Collections.Generic;              ` `     `  `class` `GFG  ` `{ ` ` `  `    ``// Function to check if the frequencies ` `    ``// are in Fibonacci series ` `    ``static` `String isFibonacci(String s)  ` `    ``{ ` ` `  `        ``// map to store the ` `        ``// frequencies of character ` `        ``int` `i = 0; ` `        ``Dictionary<``int``,  ` `                   ``int``> mp = ``new` `Dictionary<``int``, ` `                                            ``int``>(); ` `        ``for` `(i = 0; i < s.Length; i++) ` `        ``{ ` `            ``if``(mp.ContainsKey(s[i])) ` `            ``{ ` `                ``var` `val = mp[s[i]]; ` `                ``mp.Remove(s[i]); ` `                ``mp.Add(s[i], val + 1);  ` `            ``} ` `            ``else` `            ``{ ` `                ``mp.Add(s[i], 1); ` `            ``} ` `        ``} ` ` `  `        ``// List to store first n ` `        ``// fibonacci numbers ` `        ``List<``int``> v = ``new` `List<``int``>(); ` ` `  `        ``// Get the size of the map ` `        ``int` `n = mp.Count; ` ` `  `        ``// a and b are first and second terms of ` `        ``// fibonacci series ` `        ``int` `a = 1, b = 1; ` ` `  `        ``int` `c; ` `        ``v.Add(a); ` `        ``v.Add(b); ` ` `  `        ``// vector v contains elements of  ` `        ``// fibonacci series ` `        ``for` `(i = 0; i < n - 2; i++)  ` `        ``{ ` `            ``v.Add(a + b); ` `            ``c = a + b; ` `            ``a = b; ` `            ``b = c; ` `        ``} ` ` `  `        ``int` `flag = 1; ` `         `  `        ``// Compare vector elements with values in Map ` `        ``foreach``(KeyValuePair<``int``, ``int``> entry ``in` `mp)  ` `        ``{ ` `            ``if` `(entry.Value != v[i])  ` `            ``{ ` `                ``flag = 1; ` `                ``break``; ` `            ``} ` `            ``i++; ` `        ``} ` `         `  `        ``if` `(flag == 1) ` `            ``return` `"YES"``; ` `        ``else` `            ``return` `"NO"``; ` `    ``} ` ` `  `    ``// Driver Code ` `    ``public` `static` `void` `Main(String[] args)  ` `    ``{ ` `        ``String s = ``"abeeedd"``; ` `        ``Console.WriteLine(isFibonacci(s)); ` `    ``} ` `} ` ` `  `// This code is contributed by 29AjayKumar `

Output:

```YES
```

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.