Invite your friends
July 2016 Flo Challenge
Testimonials
First Prize Winner
Vaibhav Bhatnagar, Bangalore
FloCareer July Coding challenge was special in many ways - it was not only about writing an efficient, good program, but it also opened my curiosity door to something new and exciting. I didn't know about Lichrel numbers when I started the program. Stumbled upon an infinite loop problem and figured out that I have to stop at some time. When I saw the video about Lichrel numbers, it all made sense. Thanks for giving this opportunity to learn something new and exciting.
- Vaibhav
Second Prize Winner
Parth Patel, Ahmedabad, Gujarat
Solving problems is trill and when they are accompanied with such a great prize, the trill increases multi-fold! This challenge was unique in many ways. It not only provided me an opportunity to write low-level C code for optimum execution but also allowed me to learn how to profile the code based on time and space requirements. Lastly, my perception regarding this challenge is that it was not about solving some mathematical problem but rather it was a challenge of how efficiently a developer can implement the logic.
- Parth
Third Prize Winner
Khamchand Saha, Guwahati, Assam
Frankly speaking, I didn't feel it like a challenge. But definitely there lied a twist in the problem statement. I could not crack it in one go. After few consistent efforts, I was able to solve it. During the process, I learnt new concepts. One such concept is "Lychrel Number". I am really thankful to FloCareer for organizing such a competition and boosting the spirits of the coders. I am happy to be one of the winners.
- Khamchand
Flo Challenge

A hackathon that makes sense!
Prizes
Participate in this coding challenge and win prizes worth Rs. 50,000/-
Cash prizes for 1 st , 2 nd and 3 rd winners
+
Goodies for 20 more
July 2016 Challenge
This is a mathematical challenge. It is not so difficult to implement, but this will reveal an interesting mystery of maths for you!
Any (base 10) number is either a palindrome or not. For example, 11, 202, 515 are palindrome. All single digit numbers are also palindromes by definition. For some numbers, when you do “reverse and add”, it results in palindrome.
For example:
	43: (Not a palindrome)
	43 + 34 = 77   Palindrome! 
	# of iterations: 1
            
Some numbers take more than one such “reverse and add” iterations to result into palindrome.
For example:
	37:  (Not a palindrome)
	37 + 73 =   110(Not a palindrome)
	110 + 011 = 121  Palindrome!
	# of iterations: 2
            
With that background, here’s the problem definition:
“For numbers between 1 to 10,000; print the number of ‘reverse and add’ iterations that you will need for each number to make it palindrome.”
The output of your program should look like following:
...
...
27: 1 iterations
28: 2 iterations
29: 1 iterations
30: 1 iterations
...
...
            
You can code in Python, Java, Java-Script, C or C++.
Hint: You will have to make some “practical limit” when you stumble upon some issues.
How to participate:
  1. Click onThis Link to start the assessment.
  2. The page will ask you to signup or login, if you are not already logged in.
  3. Start the test, where you will have to answer following questions. We recommend that you start the test only after you have the answers ready. You need to copy/paste the code; so make sure that you have tested the program properly before sending results.
Questions
Q1: Which language are you using to solve the Monthly Challenge of July 2016? Which environment did you use to compile and test your program? Please provide the details of operating system, compiler version (if applicable), language version (if applicable), browser type and version (if applicable), IDE (if applicable).
Valid languages are: Python, Java, Java-Script, C or C++
Q2: Please copy / paste the code below.
Q3: Provide the output of your program in the space below.
Q4: Did you have to make any “practical workarounds”? What did you learn from that?
Q5: (Bonus points) Implement the solutions in two different languages and compare performance.