Remove manual line wrapping from problem descriptions.

Author: timoxley

problems/async_loops/problem.md

@@ -1,7 +1,6 @@
 This code is broken!
 
-A Java developer has committed this terrible code to our codebase
-and didn't test it!
+A Java developer has committed this terrible code to our codebase and didn't test it!
 
 ```js
 function loadUsers(userIds, load, done) {
@@ -15,14 +14,14 @@ function loadUsers(userIds, load, done) {
 module.exports = loadUsers
 ```
 
-# Task: Fix this code! The callback should be called with all the users loaded.
-The order of the users should match the order of supplied user ids.
-Because this function is asynchronous, we do not care about its return value.
+# Task
+
+Fix this code! The callback should be called with all the users loaded.
+The order of the users should match the order of supplied user ids. Because this function is asynchronous, we do not care about its return value.
 
 ## Arguments
 * userIds: an Array of numeric user ids.
-* load: a Function used to load user objects. Expects a numeric id and a callback. The callback will be called with the
-  result of loading the user with the specified id (either a user object or null).
+* load: a Function used to load user objects. Expects a numeric id and a callback. The callback will be called with the result of loading the user with the specified id (either a user object or null).
 * done: a Function that expects an Array of user objects (as retrieved from `load`).
 
 ## Conditions

problems/basic_call/problem.md

@@ -1,16 +1,10 @@
-JavaScript implements 'duck' typing. Duck typing is a style of dynamic typing in
-which an object's methods and properties determine the valid semantics,
-rather than its inheritance from a particular class or implementation of a
-specific interface. The name of the concept refers to the duck test, attributed
-to James Whitcomb Riley, which may be phrased as follows:
+JavaScript implements 'duck' typing. Duck typing is a style of dynamic typing in which an object's methods and properties determine the valid semantics, rather than its inheritance from a particular class or implementation of a specific interface. The name of the concept refers to the duck test, attributed to James Whitcomb Riley, which may be phrased as follows:
 
   "When I see a bird that walks like a duck and swims like a duck and quacks like a duck, I call that bird a duck"
 
-In JavaScript, in order to write robust programs we sometimes need to
-check an object conforms to the type that we need.
+In JavaScript, in order to write robust programs we sometimes need to check an object conforms to the type that we need.
 
-We can use Object#hasOwnProperty to detect if an object 'has' a property defined on itself (i.e. not
-inherited from its prototype):
+We can use Object#hasOwnProperty to detect if an object 'has' a property defined on itself (i.e. not inherited from its prototype):
 
 ```js
 var duck = {
@@ -24,8 +18,7 @@ duck.hasOwnProperty('quack') // => true
 
 We didn't give the duck a .hasOwnProperty method, where did it come from?
 
-Duck was created with the `{}` syntax, and as such
-it inherits from Object.prototype:
+Duck was created with the `{}` syntax, and as such it inherits from Object.prototype:
 
 ```js
 var object = {quack: true}
@@ -50,10 +43,7 @@ object.hasOwnProperty('quack')
 // => TypeError: Object object has no method 'hasOwnProperty'
 ```
 
-We can still use `hasOwnProperty` from the `Object.prototype` though,
-if we call it with the `this` value set to something that 'looks like
-an object'. Function#call allows us to invoke any function with
-an altered `this` value.
+We can still use `hasOwnProperty` from the `Object.prototype` though, if we call it with the `this` value set to something that 'looks like an object'. Function#call allows us to invoke any function with an altered `this` value.
 
 ```js
 // the first argument to call becomes the value of `this`
@@ -64,9 +54,7 @@ Object.prototype.hasOwnProperty.call(object, 'quack') // => true
 
 # Task:
 
-Write a function `duckCount` that returns the number of arguments passed to it which
-have a property 'quack' defined directly on them. Do not match values inherited
-from prototypes.
+Write a function `duckCount` that returns the number of arguments passed to it which have a property 'quack' defined directly on them. Do not match values inherited from prototypes.
 
 Example:
 
@@ -77,8 +65,7 @@ duckCount(duck, notDuck) // 1
 ```
 ## Arguments
 
-* You will be passed 0-20 arguments. Each argument could be of any type with any
-  properties. Some of these items will have a 'quack' property.
+* You will be passed 0-20 arguments. Each argument could be of any type with any properties. Some of these items will have a 'quack' property.
 
 ## Conditions
 
@@ -88,8 +75,7 @@ duckCount(duck, notDuck) // 1
 
 ## Hint
 
-* The arguments variable, available in every function,
-  is an object that quacks like an Array:
+* The `arguments` variable, available in every function, is an *Object* that quacks like an *Array*:
 
 ```js
 {

problems/basic_every_some/problem.md

@@ -1,7 +1,6 @@
 # Task
 
-Return a function that takes a list of valid users, and returns a function that returns true
-if all of the supplied users exist in the original list of users.
+Return a function that takes a list of valid users, and returns a function that returns true if all of the supplied users exist in the original list of users.
 
 You only need to check that the ids match.
 
@@ -35,8 +34,7 @@ testAllValid([
 
 * goodUsers: a list of valid users
 
-Use array#some and Array#every to check every user passed to your returned
-function exists in the array passed to the exported function.
+Use array#some and Array#every to check every user passed to your returned function exists in the array passed to the exported function.
 
 ## Conditions
 

problems/basic_filter/problem.md

@@ -1,8 +1,7 @@
 # Task
 Use Array#filter to write a function called `getShortMessages`.
 
-`getShortMessages` takes an array of objects with '.message' properties
-and returns an array of messages that are *less than < 50 characters long*.
+`getShortMessages` takes an array of objects with '.message' properties and returns an array of messages that are *less than < 50 characters long*.
 
 ## Arguments
 
@@ -25,8 +24,7 @@ and returns an array of messages that are *less than < 50 characters long*.
 
 ## Example
 
-The function should return an array containing the messages themselves,
-*without their containing object*.
+The function should return an array containing the messages themselves, *without their containing object*.
 
 e.g.
 ```

problems/basic_inheritance_with_objectcreate/problem.md

@@ -1,10 +1,8 @@
 # Task
 
-Create a new "BetterUser" type that extends "User" by overriding
-the User's `.toString` method.
+Create a new "BetterUser" type that extends "User" by overriding the User's `.toString` method.
 
-Your exported function will be passed the constructor function
-for a "User" type that looks like this:
+Your exported function will be passed the constructor function for a "User" type that looks like this:
 
 ```js
 /**
@@ -42,8 +40,7 @@ Note: you do not need to copy this into your solution.
 
 ## Example
 
-From your exported function, return a `BetterUser` constructor function
-that extends `User` with a custom `toString` method that works like so:
+From your exported function, return a `BetterUser` constructor function that extends `User` with a custom `toString` method that works like so:
 
 ```js
 var joe = new BetterUser('Mr.', 'Joe Smith') // pass in title and name

problems/basic_inheritance_without_objectcreate/problem.md

@@ -23,11 +23,9 @@ Details copied below for your reference.
 
 ## Previous Task Definition
 
-Create a "BetterUser" that extends "User" by overriding
-the User's `.toString` method.
+Create a "BetterUser" that extends "User" by overriding the User's `.toString` method.
 
-Your exported function will be passed the constructor function
-for a "User" type that looks like this:
+Your exported function will be passed the constructor function for a "User" type that looks like this:
 
 ```js
 /**
@@ -65,8 +63,7 @@ Note: you do not need to copy this into your solution.
 
 ## Example
 
-From your exported function, return a `BetterUser` constructor function
-that extends `User` with a custom `toString` method that works like so:
+From your exported function, return a `BetterUser` constructor function that extends `User` with a custom `toString` method that works like so:
 
 ```js
 var joe = new BetterUser('Mr.', 'Joe Smith') // pass in title and name

problems/basic_recursion/problem.md

@@ -1,9 +1,6 @@
-Recursion is a fundamental programming concept which can lead to elegant and efficient solutions to
-algorithmic problems. In fact, recursion is so powerful, all iterating behaviour can be defined using
-recursive functions. You will find recursion indispensable when iterating over nested data structures.
+Recursion is a fundamental programming concept which can lead to elegant and efficient solutions to algorithmic problems. In fact, recursion is so powerful, all iterating behaviour can be defined using recursive functions. You will find recursion indispensable when iterating over nested data structures.
 
-A recursive function is a function which calls itself. For example, this recursive function will
-take an array of words, and return an array of those words, uppercased.
+A recursive function is a function which calls itself. For example, this recursive function will take an array of words, and return an array of those words, uppercased.
 
 ```js
 function toUpperArray(items) {
@@ -17,27 +14,20 @@ function toUpperArray(items) {
 toUpperArray(['hello', 'world']) // => ['HELLO', 'WORLD']
 ```
 
-The point of this exercise is to familiarise yourself with recursion by implementing a familiar
-interface using a recursive function.
+The point of this exercise is to familiarise yourself with recursion by implementing a familiar interface using a recursive function.
 
 # Task
 
 Implement Array#reduce using recursion.
 
-To test your reduction works correctly we will use your reduce implementation to execute our solution
-to the previous basic_reduce problem. i.e. your reduce function will be passed an array of words, and 
-a function, and an initial value which will return an object containing the counts for each word found
-in the array. You don't need to implement this functionality, it will be supplied to your reduce
-implementation.
+To test your reduction works correctly we will use your reduce implementation to execute our solution to the previous basic_reduce problem. i.e. your reduce function will be passed an array of words, and a function, and an initial value which will return an object containing the counts for each word found in the array. You don't need to implement this functionality, it will be supplied to your reduce implementation.
 
-For simplicity, your implementation of reduce **need not replicate the behaviour of a reduce missing an
-initial value**. You may assume the initial value will always be supplied.
+For simplicity, your implementation of reduce **need not replicate the behaviour of a reduce missing an initial value**. You may assume the initial value will always be supplied.
 
 ## Arguments
 
 * arr: An Array to reduce over
-* fn: Function to use as the reduction step. 
-  Like regular Array#reduce, this function must be passed previousValue, currentValue, index and the array we're iterating over.
+* fn: Function to use as the reduction step. Like regular Array#reduce, this function must be passed previousValue, currentValue, index and the array we're iterating over.
 * init: Initial value of the reduction. Unlike Array#reduce, this value is required (and you may assume it will always be supplied).
 
 ## Example

problems/basic_reduce/problem.md

@@ -1,8 +1,6 @@
 # Task
 
-Given an Array of strings, use `Array#reduce` to create an object that
-contains the number of times each string occured in the array. Return the
-object directly (no need to console.log).
+Given an Array of strings, use `Array#reduce` to create an object that contains the number of times each string occured in the array. Return the object directly (no need to console.log).
 
 ## Example
 

problems/blocking_event_loop/problem.md

@@ -1,12 +1,8 @@
 # Task
 
-Modify the recursive `repeat` function provided in the boilerplate,
-such that it does not block the event loop (i.e. Timers and IO handlers can fire).  
-This necessarily requires repeat to be asynchronous.
+Modify the recursive `repeat` function provided in the boilerplate, such that it does not block the event loop (i.e. Timers and IO handlers can fire).  This necessarily requires repeat to be asynchronous.
 
-A timeout is queued to fire after 1 second, which will print the results
-of the test and exit the process. `repeat` should release control of the event
-loop such that the timeout fires before 1500 milliseconds elapse.
+A timeout is queued to fire after 1 second, which will print the results of the test and exit the process. `repeat` should release control of the event loop such that the timeout fires before 1500 milliseconds elapse.
 
 Try to perform as many operations as you can before the timeout fires!
 

problems/currying/problem.md

@@ -37,8 +37,7 @@ In this challenge, we're going to implement a 'curry' function for an arbitrary
 `curryN` will take two parameters:
 
 * fn: The function we want to curry.
-* n: Optional number of arguments to curry.
-  If not supplied, `curryN` should use the fn's arity as the value for `n`.
+* n: Optional number of arguments to curry. If not supplied, `curryN` should use the fn's arity as the value for `n`.
 
 ## Example
 
@@ -62,8 +61,7 @@ console.log(curryN(add3)(1)(2)(3)) // => 6
 
 ## Hint
 
-* You can detect the number of expected arguments to a function (it's arity)
-  by checking a function's .length property.
+* You can detect the number of expected arguments to a function (it's arity) by checking a function's .length property.
 
 ## Boilerplate