Problem description, input and output:
In this problem there is some things we can assume with the problem description:
1. The maximun Fibonacci number we need to calculate is the 45th number.
2. The maximun length of the cypher text is 100 characters(not all of them uppercase letters)
3. All of the input numbers are fibonacci (no need to validate them).
4. The maximun output string would be 45 cause there isn’t trailing spaces.
5. You need to check only X amount of numbers where X is the amount of uppercase letters in the cypher text.
6. The output string must be filled with spaces before we add the letters to it.
With all of this in mind the problem is almost finish, now we need to follow just a few more steps.
first we pre-calculate the first 45 fibonacci elements then we store the numbers and ONLY the uppercase letters (you can store the whole line and then store the uppercase letters in another array) with that we need two more things, one, we need to store the amount of upper case letters (a.k.a. the length of the array), second, we need the biggest fibonacci number inside the number we are going to use to put a ” at the end to stop the string (or we can start at the 45th position in the array and going backwards until we find something diferent to a ‘ ‘ (space) and we put a ” in the position next to it.
Source Code
Source Code