Description
This issue describes how to implement the partition
learning exercise for the Clojure track.
Getting started
Please please please read the docs before starting. Posting PRs without reading these docs will be a lot more frustrating for you during the review cycle, and exhaust Exercism's maintainers' time. So, before diving into the implementation, please read up on the following documents:
Please also watch the following video:
Goal
The goal of this exercise is to teach the student how the partition
function can be used in Clojure.
Learning objectives
The student will gain a general understanding of:
- The power of Clojure's sequence functions to transform data in contrast to imperative loops and recursion.
For a perfect example, check out these Clojure solutions to a very simple Advent of Code problem: https://www.youtube.com/watch?v=3w0FWqGC0PM
These solutions have also been gathered into a gist
Out of scope
Concepts
higher-order-functions
Prerequisites
basics
Resources to refer to
Representer
The Clojure Representer is currently being implemented and contributions are welcome.
Analyzer
The Clojure Analyzer is currently being implemented and contributions are welcome.
Implementing
To implement a concept exercise, the following files must be created:
languages
└── clojure
└── exercises
└── concept
└── <SLUG>
├── .docs
| ├── instructions.md
| ├── introduction.md
| ├── hints.md
| └── after.md (optional)
├── .meta
| |── design.md
| └── Example.clj
├── <NAME>.clj
└── <NAME>_test.clj
Help
If you have any questions while implementing the exercise, please post the questions as comments in this issue.
Activity