Merge branch 'master' into hj-async-program-execution

AY1920S1-CS2103T-F14-1 · Oct 31, 2019 · 954493f · 954493f
2 parents 4ca660c + 739b5b9
commit 954493f
Showing 1 changed file with 13 additions and 13 deletions.
diff --git a/questionBank.json b/questionBank.json
@@ -7,13 +7,13 @@
     "topics" : [ "OTHERS" ],
     "testCases" : [ {
       "input" : "1 2",
-      "expectedResult" : "3\n"
+      "expectedResult" : "3\r\n"
     }, {
       "input" : "100 2",
-      "expectedResult" : "102\n"
+      "expectedResult" : "102\r\n"
     }, {
       "input" : "0 0",
-      "expectedResult" : "0\n"
+      "expectedResult" : "0\r\n"
     } ],
     "userProgram" : {
       "canonicalName" : "Main",
@@ -22,16 +22,16 @@
     "description" : "Write a program that when given 2 numbers, prints out the result of adding them together.\n\nExample:\n\nInput: 1 3\nOutput: 4\n"
   }, {
     "title" : "Matching Sums",
-    "status" : "NEW",
+    "status" : "PASSED",
     "difficulty" : "MEDIUM",
     "isBookmarked" : true,
     "topics" : [ "DYNAMIC_PROGRAMMING", "OTHERS", "ARRAY" ],
     "testCases" : [ {
       "input" : "13 5 3 8 1 22 2 77 17",
-      "expectedResult" : "0 2\n"
+      "expectedResult" : "0 2\r\n"
     }, {
       "input" : "-1 -22 0 -1 3 11",
-      "expectedResult" : "1 2"
+      "expectedResult" : "1 2\r\n"
     } ],
     "userProgram" : {
       "canonicalName" : "Main",
@@ -46,10 +46,10 @@
     "topics" : [ "OTHERS", "RECURSION" ],
     "testCases" : [ {
       "input" : "12321",
-      "expectedResult" : "True"
+      "expectedResult" : "true\r\n"
     }, {
       "input" : "10111",
-      "expectedResult" : "False"
+      "expectedResult" : "false\r\n"
     } ],
     "userProgram" : {
       "canonicalName" : "Main",
@@ -58,16 +58,16 @@
     "description" : "Given a linked list, determine if it has a cycle in it.\n\nTo represent a cycle in the given linked list, we use an integer pos which represents the position (0-indexed) in the linked list where tail connects to. If pos is -1, then there is no cycle in the linked list.\n\n \n\nExample 1:\n\nInput: head = [3,2,0,-4], pos = 1\nOutput: true\nExplanation: There is a cycle in the linked list, where tail connects to the second node.\n\n\nExample 2:\n\nInput: head = [1,2], pos = 0\nOutput: true\nExplanation: There is a cycle in the linked list, where tail connects to the first node.\n\n\nExample 3:\n\nInput: head = [1], pos = -1\nOutput: false\nExplanation: There is no cycle in the linked list."
   }, {
     "title" : "Swap Nodes in Pairs",
-    "status" : "NEW",
+    "status" : "ATTEMPTED",
     "difficulty" : "MEDIUM",
     "isBookmarked" : false,
     "topics" : [ "DYNAMIC_PROGRAMMING", "GRAPH" ],
     "testCases" : [ {
       "input" : "5 12 33 23",
-      "expectedResult" : "4132"
+      "expectedResult" : "4132\r\n"
     }, {
       "input" : "2 31 01",
-      "expectedResult" : "1232"
+      "expectedResult" : "1232\r\n"
     } ],
     "userProgram" : {
       "canonicalName" : "Main",
@@ -82,10 +82,10 @@
     "topics" : [ "LINKED_LIST", "SORTING" ],
     "testCases" : [ {
       "input" : "3 5 3 4 1 99 0 21 34 123 3 21 3 1",
-      "expectedResult" : "0 1 3 4 21 34 99 123"
+      "expectedResult" : "0 1 3 4 21 34 99 123\r\n"
     }, {
       "input" : "1 4 1 2 3 4",
-      "expectedResult" : "1 2 3 4"
+      "expectedResult" : "1 2 3 4\r\n"
     } ],
     "userProgram" : {
       "canonicalName" : "Main",