theScore "the Rush" Interview Challenge

At theScore, we are always looking for intelligent, resourceful, full-stack developers to join our growing team. To help us evaluate new talent, we have created this take-home interview question. This question should take you no more than a few hours.

All candidates must complete this before the possibility of an in-person interview. During the in-person interview, your submitted project will be used as the base for further extensions.

Why a take-home challenge?

In-person coding interviews can be stressful and can hide some people's full potential. A take-home gives you a chance work in a less stressful environment and showcase your talent.

We want you to be at your best and most comfortable.

A bit about our tech stack

As outlined in our job description, you will come across technologies which include a server-side web framework (like Elixir/Phoenix, Ruby on Rails or a modern Javascript framework) and a front-end Javascript framework (like ReactJS)

Challenge Background

We have sets of records representing football players' rushing statistics. All records have the following attributes:

• Player (Player's name)
• Team (Player's team abbreviation)
• Pos (Player's postion)
• Att/G (Rushing Attempts Per Game Average)
• Att (Rushing Attempts)
• Yds (Total Rushing Yards)
• Avg (Rushing Average Yards Per Attempt)
• Yds/G (Rushing Yards Per Game)
• TD (Total Rushing Touchdowns)
• Lng (Longest Rush -- a T represents a touchdown occurred)
• 1st (Rushing First Downs)
• 1st% (Rushing First Down Percentage)
• 20+ (Rushing 20+ Yards Each)
• 40+ (Rushing 40+ Yards Each)
• FUM (Rushing Fumbles)

In this repo is a sample data file rushing.json.

Challenge Requirements

1. Create a web app. This must be able to do the following steps

   1. Create a webpage which displays a table with the contents of rushing.json
   2. The user should be able to sort the players by Total Rushing Yards, Longest Rush and Total Rushing Touchdowns
   3. The user should be able to filter by the player's name
   4. The user should be able to download the sorted data as a CSV, as well as a filtered subset

2. The system should be able to potentially support larger sets of data on the order of 10k records.

3. Update the section Installation and running this solution in the README file explaining how to run your code

Submitting a solution

1. Download this repo
2. Complete the problem outlined in the Requirements section
3. In your personal public GitHub repo, create a new public repo with this implementation
4. Provide this link to your contact at theScore

We will evaluate you on your ability to solve the problem defined in the requirements section as well as your choice of frameworks, and general coding style.

Help

If you have any questions regarding requirements, do not hesitate to email your contact at theScore for clarification.

Installation and running this solution

#### Requirements

• Elixir v1.12.X - as it is specified in the project file.
• NodeJS v13.X.X and NPM - required by Phoenix and its Frontend side.

#### Application setup

• Run mix deps.get to get the dependencies.
• Enter into the assets folder and the run npm install to get the node modules required.

#### Application running

• Go back to the project root folder and run mix phx.server to start the application.
• From your browser, go to http://localhost:4000 to access the app.

Extras

• The data JSON file path can be changed in the config/config.exs file. You will find the following lines:

# JSON file path
config :exrush, json_path: "priv/rushing.json"

Customize it with your own file! We have tried with files of 20k entries (e.g. priv/rushing_large.json).