Sync simple-linked-list docs with problem-specifications (#2302)

* Sync simple-linked-list docs with problem-specifications

The simple-linked-list exercise has been overhauled as part of a project
to make practice exercises more consistent and friendly.

For more context, please see the discussion in the forum, as well as
the pull request that updated the exercise in the problem-specifications
repository:

- https://forum.exercism.org/t/new-project-making-practice-exercises-more-consistent-and-human-across-exercism/3943

* Sync simple-linked-list docs with problem-specifications

The simple-linked-list exercise has been overhauled as part of a project
to make practice exercises more consistent and friendly.

For more context, please see the discussion in the forum, as well as
the pull request that updated the exercise in the problem-specifications
repository:

- https://forum.exercism.org/t/new-project-making-practice-exercises-more-consistent-and-human-across-exercism/3943

Author: kytrinyx

exercises/practice/simple-linked-list/.docs/instructions.md

@@ -1,22 +1,19 @@
 # Instructions
 
-Write a simple linked list implementation that uses Elements and a List.
+Write a prototype of the music player application.
 
-The linked list is a fundamental data structure in computer science,
-often used in the implementation of other data structures. They're
-pervasive in functional programming languages, such as Clojure, Erlang,
-or Haskell, but far less common in imperative languages such as Ruby or
-Python.
+For the prototype, each song will simply be represented by a number.
+Given a range of numbers (the song IDs), create a singly linked list.
 
-The simplest kind of linked list is a singly linked list. Each element in the
-list contains data and a "next" field pointing to the next element in the list
-of elements.
+Given a singly linked list, you should be able to reverse the list to play the songs in the opposite order.
 
-This variant of linked lists is often used to represent sequences or
-push-down stacks (also called a LIFO stack; Last In, First Out).
+~~~~exercism/note
+The linked list is a fundamental data structure in computer science, often used in the implementation of other data structures.
 
-As a first take, lets create a singly linked list to contain the range (1..10),
-and provide functions to reverse a linked list and convert to and from arrays.
+The simplest kind of linked list is a **singly** linked list.
+That means that each element (or "node") contains data, along with something that points to the next node in the list.
 
-When implementing this in a language with built-in linked lists,
-implement your own abstract data type.
+If you want to dig deeper into linked lists, check out [this article][intro-linked-list] that explains it using nice drawings.
+
+[intro-linked-list]: https://medium.com/basecs/whats-a-linked-list-anyway-part-1-d8b7e6508b9d
+~~~~

exercises/practice/simple-linked-list/.docs/introduction.md

@@ -0,0 +1,5 @@
+# Introduction
+
+You work for a music streaming company.
+
+You've been tasked with creating a playlist feature for your music player application.