Added some documentation and specifications.

Author: trantbatey

src/Java101ExerciseTest.java

@@ -1,4 +1,3 @@
-import org.junit.Before;
 import org.junit.Test;
 
 import java.util.ArrayList;
@@ -173,30 +172,30 @@ public void exercise041Test() {
     }
 
     @Test
-    public void exercise061Test() {
+    public void exercise071Test() {
 
         // test 1
-        testList = Java101Exercises.exercise061(1);
+        testList = Java101Exercises.exercise071(1);
         assert(testList != null);
         assertEquals(1, (long)testList.size());
         assertEquals(1, (long)testList.get(0));
 
         // test 2
-        testList = Java101Exercises.exercise061(2);
+        testList = Java101Exercises.exercise071(2);
         assert(testList != null);
         assertEquals(2, (long)testList.size());
         assertEquals(1, (long)testList.get(0));
         assertEquals(2, (long)testList.get(1));
 
         // test 3
-        testList = Java101Exercises.exercise061(3);
+        testList = Java101Exercises.exercise071(3);
         assert(testList != null);
         assertEquals(2, (long)testList.size());
         assertEquals(1, (long)testList.get(0));
         assertEquals(3, (long)testList.get(1));
 
         // test -3
-        testList = Java101Exercises.exercise061(-3);
+        testList = Java101Exercises.exercise071(-3);
         assert(testList != null);
         assertEquals(4, (long)testList.size());
         assertEquals(-3, (long)testList.get(0));
@@ -205,15 +204,15 @@ public void exercise061Test() {
         assertEquals(3, (long)testList.get(3));
 
         // test 9
-        testList = Java101Exercises.exercise061(9);
+        testList = Java101Exercises.exercise071(9);
         assert(testList != null);
         assertEquals(3, (long)testList.size(), 3);
         assertEquals(1, (long)testList.get(0), 1);
         assertEquals(3, (long)testList.get(1), 3);
         assertEquals(9, (long)testList.get(2), 9);
 
         // test 8
-        testList = Java101Exercises.exercise061(8);
+        testList = Java101Exercises.exercise071(8);
         assert(testList != null);
         assertEquals(4, (long)testList.size());
         assertEquals(1, (long)testList.get(0));
@@ -222,7 +221,7 @@ public void exercise061Test() {
         assertEquals(8, (long)testList.get(3));
 
         // test 125
-        testList = Java101Exercises.exercise061(125);
+        testList = Java101Exercises.exercise071(125);
         assert(testList != null);
         assertEquals(4, (long)testList.size());
         assertEquals(1, (long)testList.get(0));
@@ -231,7 +230,7 @@ public void exercise061Test() {
         assertEquals(125, (long)testList.get(3));
 
         // test -125
-        testList = Java101Exercises.exercise061(-125);
+        testList = Java101Exercises.exercise071(-125);
         assert(testList != null);
         assertEquals(8, (long)testList.size());
         assertEquals(-125, (long)testList.get(0));
@@ -242,7 +241,7 @@ public void exercise061Test() {
         // test 2080046
         // also test time
         long startTime = System.nanoTime();
-        testList = Java101Exercises.exercise061(2080046);
+        testList = Java101Exercises.exercise071(2080046);
         assert(testList != null);
         long endTime = System.nanoTime();
         long duration = (endTime - startTime);

src/Java101Exercises.java

@@ -6,11 +6,11 @@
  * interview questions. There are five levels of problems. As you improve you can move up levels.
  *
  * LEVELS:
- *          BASIC
- *          EASY
- *          INTERMEDIATE
- *          DIFFICULT
- *          ADVANCED
+ *          BASIC               Exercise 001 - 010
+ *          EASY                Exercise 011 - 040
+ *          INTERMEDIATE        Exercise 041 - 070
+ *          DIFFICULT           Exercise 071 - 090
+ *          ADVANCED            Exercise 091 - 101
  *
  */
 
@@ -98,7 +98,7 @@ public static List<Integer> exercise041(List<Integer> iList) throws Exception {
     }
 
     /**
-     * Exercise 061 - Find Factors Efficiently
+     * Exercise 071 - Find Factors Efficiently
      * Find all of the factors for a given integer (int). The integer could be negative. The result needs to be sorted
      * in ascending order.
      *
@@ -109,7 +109,7 @@ public static List<Integer> exercise041(List<Integer> iList) throws Exception {
      * @param num       The number to be factored
      * @return          An Integer ArrayList of factors of num.
      */
-    public static ArrayList<Integer> exercise061(int num) {
+    public static ArrayList<Integer> exercise071(int num) {
         return  null;
     }
 }