Implement new Concept Exercise: sets

Open
#850 0 comments 0 reactions 0 assignees View on GitHub

Nobody has claimed this yet.

Assessment

Difficulty
4/5
Estimated time
3-5 days
Newbie friendliness
38/100
Issue type
Feature
Clarity
Mostly clear
Activity status
Stale
Tech stack
fsharp
Domain
content

Research direction

Start by reading the linked v3 concept-exercise documentation, rationale, anatomy video, and F# implementing-a-concept-exercise guide. Then follow those instructions to design and implement the sets exercise using the listed learning objectives, prerequisites, hints, and after resources. Done means the exercise is implemented and no representer or analyzer changes are added.

Written by the indexing model from the issue text.

Description

x:action/create x:knowledge/intermediate x:module/concept-exercise x:size/large x:type/content

This issue describes how to implement the sets concept exercise for the F# 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 the basics of the Concept of Sets in F#.

Learning objectives

  • Know of the existence of the Set type.
  • Know how to define a set.
  • Know that sets have structural equality.
  • Know that sets are immutable.
  • Know how to add and remove elements in a set.
  • Know how to check if an elements is in a set.
  • Know some basic map functions (like getting the difference or intersection).

Out of scope

  • Memory and performance characteristics.

Concepts

The Concepts this exercise unlocks are:

  • sets: know of the existence of the Set type; know how to define a set; know that sets have structural equality; know that sets are immutable; know how to add and remove elements in a set; know how to check if an elements is in a set; know some basic map functions (like getting the difference or intersection).

Prerequisites

This exercise's prerequisites Concepts are:

  • higher-order-functions: know how to use higher-order functions.
  • generic-types: know how generic types work.

Any data types used in this exercise (e.g. strings) should also be added as prerequisites.

Resources to refer to

Hints
After

Representer

This exercise does not require any specific representation logic to be added to the representer.

Analyzer

This exercise does not require any specific logic to be added to the analyzer.

Implementing

To implement this exercise, please follow these instructions.

Help

If you have any questions while implementing the exercise, please post the questions as comments in this issue.

Dominant language
F#
Stars
118
Forks
113
Avg merge
2d 12h
Merged PRs (30d)
2

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from exercism/fsharp

All issues in exercism/fsharp

Similar issues

More Content issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.