i tried.. i'm fried

README.md

@@ -18,7 +18,30 @@ then it should return the following values after the call:
 [1, 3, 2, 7, 7, 2, 3, 1]
 Notice that it has been doubled in size by having the original sequence appearing in reverse order at the end of the list. You may not make assumptions about how many elements are in the list.
 
+PROBLEM 1 SOLUTION
+(this solution feels a little 'hacky', looking forward to seeing what a more elegant solution would look like)
+
+def mirror(array)
+    new_array = []
+    reverse_array = []
+    front_index = 0
+    back_index = -1
+    array.length.times do
+        new_array << array[front_index]
+        front_index +=1
+        reverse_array << array[back_index]
+        back_index -=1
+        end
+    reverse_array.each do |num|
+        new_array << num
+    end
+    return new_array
+end
+
+
 ## Problem #2
 Write a method `switchPairs` that switches the order of values in an Array of strings in a pairwise fashion. Your method should switch the order of the first two values, then switch the order of the next two, switch the order of the next two, and so on. **This switch should happen _in place_, meaning no new array should be created.** For example, if the list initially stores these values: ["four", "score", "and", "seven", "years", "ago"] your method should switch the first pair, "four", "score", the second pair, "and", "seven", and the third pair, "years", "ago", to yield this list: ["score", "four", "seven", "and", "ago", "years"]
 
 If there are an odd number of values in the list, the final element is not moved. For example, if the original list had been: ["to", "be", "or", "not", "to", "be", "hamlet"] It would again switch pairs of values, but the final value, "hamlet" would not be moved, yielding this list: ["be", "to", "not", "or", "be", "to", "hamlet"]
+PROBLEM 2 SOLUTION
+--AAAHH! This one is driving me crazy and I just can't get it to work. I feel like all the stuff i've come up with in the last hour are pretty close here, but I'm just fried and not seeing it. My brain is over-betsy'd and the clock just struck midnight, so i have to stop. Excited for that 'aha' moment tomorrow to see the approaches to this problem.