practicalli / practicalli/clojure
Exercise: Park Run
Nobody has claimed this yet.
- Dominant language
- Makefile
- Stars
- 117
- Forks
- 36
- PR merge metrics
- No merged PRs in 30d
Description
Given hash-map data of park run events
When searching for fastest time, specific weather, hightest/lowest temperature, number of runners, etc
Then return the hash-map containing all the run details of the matching days
Shows the use of recur and its ability to keep track of a value as it processes a sequence of values from a collection.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Locate the Park Run exercise and its hash-map event data, then read how existing exercises are structured. Use the stated searches—fastest time, weather, temperatures, and runner count—as the expected cases, and consider the work complete when each returns the hash-map containing all matching run details.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- clojure
- Domain
- content
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100