Code Challenge for interns looking to join the Africa's Talking Backend team
# Backend Code Challenge
## This challenge is due at 1800 HRS EAT on 12th September 2018
## Simple Unchanging Rules
The code challenge is and will always be judged using the following criteria:
- A Correct fork, branch and pull request
- Using the GitHub Pull Request Time Stamp and correct code quality & structure, the first developer whose code runs successfully wins
- Code quality and structure will be evaluated
- The order for pull requests will be followed, first come first win basis!
- Do not share any code that you cannot opensource on the Git Repository as its open source and Africa's Talking will not be liable for any breach of intellectual property (if any) once shared on the platform.
## Terms and Conditions
You can participate on as many challenges as you wish:
- Do not share any code that you cannot opensource on the Git Repository as its open source and Africa's Talking will not be liable for any breach of intellectual property (if any) once shared on the platform.
- Code Challenges are time bound - the time restriction is specified on the challenge
- Additional rules MAY be provided on the code challenge and will vary for each challenge
- You are free to use all manner of tools
- Successive interviews for projects MAY be run to satisfy participating Africa's Talking Partners
## Code Challenge Bounty:
- A chance to work with some of the most brilliant minds in Africa
## Task
In this code challenge you will be required to work on several challenges:
1. Write a function that takes an int n and returns a list of all prime numbers between 0 and n
2. Write a function that takes an Int n and returns a List of all the factorials of the numbers between 0 and n
3. Using Pattern Matching to match a case of List of either of the following types Int, String and Float.
4. Using scala's Regex expression pattern find whether a String "7th floor Galana plaza, Kilimani" contains a Integer. (your function should return Some(7) as the result)
5. Write a case class …