Restructuring

shekhargulati · shekhargulati · commit e6702ef0e731 · 2016-02-25T16:39:08.000+05:30
diff --git a/java8/src/main/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_1.java b/java8/src/main/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_1.java
@@ -1,4 +1,4 @@
-package com.shekhargulati.ninetynine_problems.java8._00_random.stack;
+package com.shekhargulati.ninetynine_problems.java8._00_random.tadm.ch03;
 
 import java.util.Stack;
 
@@ -8,7 +8,7 @@
  * Give an algorithm that returns true if a string contains properly nested and balanced parentheses, and false if otherwise.
  * For full credit, identify the position of the first offending parenthesis if the string is not properly nested and balanced.
  */
-public class ParenthesisBalanceChecker {
+public class Problem3_1 {
 
     public boolean isBalancedString(final String input) {
         /*
diff --git a/java8/src/main/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_2.java b/java8/src/main/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_2.java
@@ -1,4 +1,4 @@
-package com.shekhargulati.ninetynine_problems.java8._00_random.stack;
+package com.shekhargulati.ninetynine_problems.java8._00_random.tadm.ch03;
 
 import java.util.LinkedList;
 import java.util.List;
@@ -9,7 +9,7 @@
  * In other words, after the reversal all pointers should now point backwards.
  * Your algorithm should take linear time.
  */
-public class ReverseLinkedList {
+public class Problem3_2 {
 
     public <T> List<T> reverse(List<T> list) {
         /*
diff --git a/java8/src/test/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_1Test.java b/java8/src/test/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_1Test.java
@@ -1,13 +1,13 @@
-package com.shekhargulati.ninetynine_problems.java8._00_random.stack;
+package com.shekhargulati.ninetynine_problems.java8._00_random.tadm.ch03;
 
 import org.junit.Test;
 
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.junit.Assert.*;
 
-public class ParenthesisBalanceCheckerTest {
+public class Problem3_1Test {
 
-    private final ParenthesisBalanceChecker checker = new ParenthesisBalanceChecker();
+    private final Problem3_1 checker = new Problem3_1();
 
     @Test
     public void shouldSayTrueForEmptyString() throws Exception {
diff --git a/java8/src/test/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_2Test.java b/java8/src/test/java/com/shekhargulati/ninetynine_problems/java8/_00_random/tadm/ch03/Problem3_2Test.java
@@ -1,4 +1,4 @@
-package com.shekhargulati.ninetynine_problems.java8._00_random.stack;
+package com.shekhargulati.ninetynine_problems.java8._00_random.tadm.ch03;
 
 import org.junit.Test;
 
@@ -11,12 +11,12 @@
 import static org.hamcrest.CoreMatchers.equalTo;
 import static org.junit.Assert.assertThat;
 
-public class ReverseLinkedListTest {
+public class Problem3_2Test {
 
     @Test
     public void shouldReverseALinkedList() throws Exception {
         List<Integer> numbers = IntStream.rangeClosed(1, 10).boxed().collect(toCollection(LinkedList::new));
-        List<Integer> reversedNumbers = new ReverseLinkedList().reverse(numbers);
+        List<Integer> reversedNumbers = new Problem3_2().reverse(numbers);
         assertThat(reversedNumbers, equalTo(Stream.of(10, 9, 8, 7, 6, 5, 4, 3, 2, 1).collect(toCollection(LinkedList::new))));
     }
 }
