From 8096b7405ea00d15b5d1056e509b0be7bbbfbd2c Mon Sep 17 00:00:00 2001
From: Simon Guilloud <simon.guilloud@epfl.ch>
Date: Mon, 7 Mar 2022 12:19:14 +0000
Subject: [PATCH] Update exercises/exercise-2.md, exercises/exercise-3.md

---
 exercises/exercise-2.md | 8 --------
 exercises/exercise-3.md | 8 --------
 2 files changed, 16 deletions(-)

diff --git a/exercises/exercise-2.md b/exercises/exercise-2.md
index a1400a2..bc51fbe 100644
--- a/exercises/exercise-2.md
+++ b/exercises/exercise-2.md
@@ -1,13 +1,5 @@
 # Exercise 2
 
-Use the following commands to make a fresh clone of your repository:
-
-```
-git clone -b exercise-2 git@gitlab.epfl.ch:lamp/student-repositories-s22/cs206-GASPAR.git exercise-2
-```
-
-Update the README.md file with your solutions. Don't forget to list the group members's SCIPER numbers.
-
 # Problem 1: Aggregate
 
 In this week's lecture, you have been introduced to the aggregate method of `ParSeq[A]` (and other parallel data structures...). It has the following signature:
diff --git a/exercises/exercise-3.md b/exercises/exercise-3.md
index 2376fce..004e682 100644
--- a/exercises/exercise-3.md
+++ b/exercises/exercise-3.md
@@ -1,13 +1,5 @@
 # Exercise 3
 
-Use the following commands to make a fresh clone of your repository:
-
-```
-git clone -b exercise-3 git@gitlab.epfl.ch:lamp/student-repositories-s22/cs206-GASPAR.git exercise-3
-```
-
-Update the README.md file with your solutions. Don't forget to list the group members's SCIPER numbers.
-
 # Problem 1: Parallel Encoding
 
 In this exercise, your group will devise a parallel algorithm to encode sequences using the run-length encoding scheme. The encoding is very simple. It transforms sequences of letters such that all subsequences of the same letter are replaced by the letter and the sequence length. For instance:
-- 
GitLab