A repository for developing and administering exercises related to software engineering and data analysis.
- Pick a problem and follow the steps.
- You'll be given an amount of time to complete the exercise. Complete it by that time.
- You can search online as much as you want.
- You can use any language or library.
- Clone or download (don't fork) this repository.
- Write code that solves the problem.
- Describe what you did, either/both (a) comments throughout your code, (b) a summary. If (b), you can write it in the pull request, or as a block of text somewhere in your code.
- Run your code to create an
output.csvwith your solution. - Compress (e.g.
.zip,.tar.gz) your code andoutput.csvand submit your solution via email to jflack@jhu.edu.
There is only one problem currently available.
This exercise is in 1_common_values/:
input/: Contains input files.solution.py: A placeholder file is here for you. If you're using Python, you can start editing this file. If you're using another language, you can delete this file and replace it with a file type corresponding to a language of your choice. If you want to split up your code into multiple modular files, that is fine too.
The input/ directory has two files, a.csv and b.csv. Both files have only
1 column, id. The idea here is that there are 2 different datasets, a and
b, and values in the id column represent identifiers for members in those
datasets.
Mostly, the members of each dataset are different. However, they do have some common members. Additionally, some members are listed multiple times within a dataset.
Your goal is to produce a table of results (output.csv) that show all of the IDs that exist
in either set, and show how many times they appear in each set.
Example table format:
| id | a | b |
|---|---|---|
| 264731 | 1 | 2 |
Bonus points if the id column is sorted (either ascending or descending
is fine).