From 55f4baf212009e76dba35baa5ea4a9f7f40bef49 Mon Sep 17 00:00:00 2001 From: Matt Bovel <matthieu.bovel@epfl.ch> Date: Sun, 19 Dec 2021 13:52:27 +0000 Subject: [PATCH] Fix typo --- previous-exams/2021-midterm-solution.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/previous-exams/2021-midterm-solution.md b/previous-exams/2021-midterm-solution.md index 6f0bc21..c477e47 100644 --- a/previous-exams/2021-midterm-solution.md +++ b/previous-exams/2021-midterm-solution.md @@ -156,7 +156,7 @@ for eval <- Seq(eval1, eval2) do ### Exercise 3.1 - Type parameter `A` in `map` -- `def map[C](f: B => C): Transform[B, C]` +- `def map[C](f: B => C): Transform[A, C]` ### Exercise 3.2 @@ -322,4 +322,4 @@ def increasingSequences(list: List[Int]): List[List[Int]] = list match **Comments** - It is important to store `prefix` to avoid calling twice `takeWhileStrictlyIncreasing`. -- In the empty list case, some students made the confusion of returning a list containing the empty list. In this case, we have: `List[List[Int]]() == Nil != List(Nil) == List(List[Int]())`. \ No newline at end of file +- In the empty list case, some students made the confusion of returning a list containing the empty list. In this case, we have: `List[List[Int]]() == Nil != List(Nil) == List(List[Int]())`. -- GitLab