From 612de6911e08bee18d3fbd412151415d50ca2d62 Mon Sep 17 00:00:00 2001
From: Quincy Larson <michaelqlarson@gmail.com>
Date: Sat, 4 Jul 2015 23:52:29 -0700
Subject: [PATCH] update quotes

---
 server/utils/resources.json | 135 +++---------------------------------
 1 file changed, 10 insertions(+), 125 deletions(-)

diff --git a/server/utils/resources.json b/server/utils/resources.json
index 9c2182738a5..744785fd911 100644
--- a/server/utils/resources.json
+++ b/server/utils/resources.json
@@ -1,126 +1,4 @@
 {
-  "announcements": [
-    ["Some of Code School's courses are no longer free. We're switching to NodeSchool.io for our Node.js and Express.js challenges.", "http://freecodecamp.com/nodeschool-challenges"],
-    ["Screenhero is now free on Windows and Mac! Follow these special instructions to install it.", "http://freecodecamp.com/install-screenhero"]
-  ],
-  "questions": [{
-    "question": "Time Complexity of Accessing Array Index (int a = ARR[5];)",
-    "answer": "O(1)"
-  }, {
-    "question": "Time Complexity of Inserting a node in Linked List",
-    "answer": "O(1)"
-  }, {
-    "question": "Time Complexity of Pushing and Popping on Stack",
-    "answer": "O(1)"
-  }, {
-    "question": "Time Complexity of Insertion and Removal from Queue",
-    "answer": "O(1)"
-  }, {
-    "question": "Time Complexity of Finding out the parent or left/right child of a node in a tree stored in Array",
-    "answer": "O(1)"
-  }, {
-    "question": "Time Complexity of Jumping to Next/Previous element in Doubly Linked List",
-    "answer": "O(1)"
-  }, {
-    "question": "Time Complexity of Traversing an array",
-    "answer": "O(n)"
-  }, {
-    "question": "Time Complexity of Traversing a linked list",
-    "answer": "O(n)"
-  }, {
-    "question": "Time Complexity of Linear Search",
-    "answer": "O(n)"
-  }, {
-    "question": "Time Complexity of Deletion of a specific element in a Linked List (Not sorted)",
-    "answer": "O(n)"
-  }, {
-    "question": "Time Complexity of Comparing two strings",
-    "answer": "O(n)"
-  }, {
-    "question": "Time Complexity of Checking for Palindrome",
-    "answer": "O(n)"
-  }, {
-    "question": "Time Complexity of Counting/Bucket Sort",
-    "answer": "O(n)"
-  }, {
-    "question": "Time Complexity of Binary Search",
-    "answer": "O(log n)"
-  }, {
-    "question": "Time Complexity of Finding largest/smallest number in a binary search tree",
-    "answer": "O(log n)"
-  }, {
-    "question": "Time Complexity of Certain Divide and Conquer Algorithms based on Linear functionality",
-    "answer": "O(log n)"
-  }, {
-    "question": "Time Complexity of Calculating Fibonacci Numbers - Best Method",
-    "answer": "O(log n)"
-  }, {
-    "question": "Time Complexity of Merge Sort",
-    "answer": "O(nlogn)"
-  }, {
-    "question": "Time Complexity of Heap Sort",
-    "answer": "O(nlogn)"
-  }, {
-    "question": "Time Complexity of Quick Sort",
-    "answer": "O(nlogn)"
-  }, {
-    "question": "Time Complexity of Certain Divide and Conquer Algorithms based on optimizing O(n^2) algorithms",
-    "answer": "O(nlogn)"
-  }, {
-    "question": "Time Complexity of Bubble Sort",
-    "answer": "O(n^2)"
-  }, {
-    "question": "Time Complexity of Insertion Sort",
-    "answer": "O(n^2)"
-  }, {
-    "question": "Time Complexity of Selection Sort",
-    "answer": "O(n^2)"
-  }, {
-    "question": "Time Complexity of Traversing a simple 2D array",
-    "answer": "O(n^2)"
-  }, {
-    "question": "Latency of L1 cache reference",
-    "answer": "0.5 nanoseconds"
-  }, {
-    "question": "Latency of Branch mispredict",
-    "answer": "5 nanoseconds"
-  }, {
-    "question": "Latency of L2 cache reference",
-    "answer": "7 nanoseconds"
-  }, {
-    "question": "Latency of Mutex lock/unlock",
-    "answer": "25 nanoseconds"
-  }, {
-    "question": "Latency of Main memory reference",
-    "answer": "100 nanoseconds"
-  }, {
-    "question": "Latency of Compressing 1K bytes with Zippy",
-    "answer": "3,000 nanoseconds"
-  }, {
-    "question": "Latency of Sending 1K bytes over a 1 Gbps network",
-    "answer": "10,000 nanoseconds"
-  }, {
-    "question": "Latency of Reading 4K randomly from SSD",
-    "answer": "150,000 nanoseconds"
-  }, {
-    "question": "Latency of Reading 1 MB sequentially from memory",
-    "answer": "250,000 nanoseconds"
-  }, {
-    "question": "Latency of a Round trip within the same datacenter",
-    "answer": "500,000 nanoseconds"
-  }, {
-    "question": "Latency of Reading 1 MB sequentially from SSD",
-    "answer": "1,000,000 nanoseconds"
-  }, {
-    "question": "Latency of Disk seek",
-    "answer": "10,000,000 nanoseconds"
-  }, {
-    "question": "Latency of Reading 1 MB sequentially from disk",
-    "answer": "20,000,000 nanoseconds"
-  }, {
-    "question": "Latency of Sending a packet from California to the Netherlands and back",
-    "answer": "150,000,000 nanoseconds"
-  }],
   "verbs": [
     "aced",
     "nailed",
@@ -155,8 +33,7 @@
     "Don't hurt 'em, Hammer!",
     "The town is now red!",
     "To the nines!",
-    "Nothing but net!",
-     "The world rejoices!",
+    "The world rejoices!",
     "That's the way it's done!",
     "You rock!",
     "Woo-hoo!",
@@ -205,7 +82,15 @@
     "Bullseye!",
     "Far out!",
     "You're heating up!",
-    "Hasta la vista, challenge!"
+    "Hasta la vista, challenge!",
+    "Terminated.",
+    "Hodor!",
+    "Off the hook!",
+    "Thundercats, Hooo!",
+    "Shiver me timbers!",
+    "Raise the roof!",
+    "We've underestimated you.",
+    "I also live dangerously."
   ],
   "phrases": [
     "Shout it from on top of a mountain",