no changes needed for twosum for swift 4

Author: coolbnjmn

Two-Sum Problem/README.markdown

@@ -1,7 +1,5 @@
 # Two-Sum Problem
 
-### About to be edited for Swift 4 woohoo!
-
 You're given an array `a` with numbers. Write an algorithm that checks if there are any two entries in the array that add up to a given number `k`. In other words, is there any `a[i] + a[j] == k`?
 
 There are a variety of solutions to this problem (some better than others). The following solutions both run in **O(n)** time.

Two-Sum Problem/Solution 1/2Sum.playground/Contents.swift

@@ -1,4 +1,5 @@
 //: Playground - noun: a place where people can play
+// Last checked with: Version 9.0 beta 4 (9M189t)
 
 func twoSumProblem(_ a: [Int], k: Int) -> ((Int, Int))? {
   var map = [Int: Int]()

Two-Sum Problem/Solution 2/2Sum.playground/Contents.swift

@@ -1,4 +1,5 @@
 //: Playground - noun: a place where people can play
+// Last checked with: Version 9.0 beta 4 (9M189t)
 
 func twoSumProblem(_ a: [Int], k: Int) -> ((Int, Int))? {
   var i = 0