Refactored Chapter 11

Author: RodneyShag

README.md

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 import java.util.ArrayList;
 import java.util.HashMap;

src/chapter1/Chapter1.java renamed to src/chapter01/Chapter1.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 import java.util.ArrayList;
 

src/chapter1/IntroArrayList.java renamed to src/chapter01/IntroArrayList.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 import java.util.HashMap;
 

src/chapter1/IntroHashMap.java renamed to src/chapter01/IntroHashMap.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 public class IntroStringBuffer {
 	/* Joins an an array of strings into 1 string. Uses StringBuffer for efficiency */

src/chapter1/IntroStringBuffer.java renamed to src/chapter01/IntroStringBuffer.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 import java.util.HashSet;
 import java.util.Arrays;

src/chapter1/OnePoint1.java renamed to src/chapter01/OnePoint1.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 import java.util.Arrays;
 

src/chapter1/OnePoint3.java renamed to src/chapter01/OnePoint3.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 public class OnePoint4 {
 	/* Important: To simplify finding "true length", we assume specific Strings:

src/chapter1/OnePoint4.java renamed to src/chapter01/OnePoint4.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 /* Determines if a String has all unique characters.
  * 

src/chapter1/OnePoint5.java renamed to src/chapter01/OnePoint5.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 public class OnePoint6 { // O(n^2) runtime. Impossible to do better since must touch all n^2 elements.
 

src/chapter1/OnePoint6.java renamed to src/chapter01/OnePoint6.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 /* If I can figure out the (simple) algorithm, coding it is simple */
 public class OnePoint7 {

src/chapter1/OnePoint7.java renamed to src/chapter01/OnePoint7.java

@@ -1,4 +1,4 @@
-package chapter1;
+package chapter01;
 
 public class OnePoint8 {
 	/* CLEVER TRICK from book */

src/chapter1/OnePoint8.java renamed to src/chapter01/OnePoint8.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 public class Chapter2 {
 	public static void main (String [] args){

src/chapter2/Chapter2.java renamed to src/chapter02/Chapter2.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 /* Used in Question 2.2 Solution 2C */
 public class IntWrapper {

src/chapter2/IntWrapper.java renamed to src/chapter02/IntWrapper.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 public class ListFunctions {
 	/* Prints linked list */

src/chapter2/ListFunctions.java renamed to src/chapter02/ListFunctions.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 /* Implementation of SINGLY-linked list */
 /* In interview, ask if it's DOUBLY or SINGLY linked */

src/chapter2/Node.java renamed to src/chapter02/Node.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 /* Used in TwoPoint5 */
 public class PartialSum {

src/chapter2/PartialSum.java renamed to src/chapter02/PartialSum.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 import java.util.HashSet;
 

src/chapter2/TwoPoint1.java renamed to src/chapter02/TwoPoint1.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 /* Find kth to last element of SLL
  * 

src/chapter2/TwoPoint2.java renamed to src/chapter02/TwoPoint2.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 /* Clever Trick: move the data!
  * Runs in O(1) time */

src/chapter2/TwoPoint3.java renamed to src/chapter02/TwoPoint3.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 /* Partitioning an array
  * 

src/chapter2/TwoPoint4.java renamed to src/chapter02/TwoPoint4.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 public class TwoPoint5 {
 	/* Wrapper */

src/chapter2/TwoPoint5.java renamed to src/chapter02/TwoPoint5.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 /* CLEVER SOLUTION - I would have never gotten this solution without the book 
  * - Easy to code (once algorithm is understood)

src/chapter2/TwoPoint6.java renamed to src/chapter02/TwoPoint6.java

@@ -1,4 +1,4 @@
-package chapter2;
+package chapter02;
 
 import java.util.Stack;
 

src/chapter2/TwoPoint7.java renamed to src/chapter02/TwoPoint7.java

@@ -1,6 +1,6 @@
-package chapter3;
+package chapter03;
 
-import chapter2.ListFunctions;
+import chapter02.ListFunctions;
 
 public class Chapter3 {
 	public static void main (String [] args){

src/chapter3/Chapter3.java renamed to src/chapter03/Chapter3.java

@@ -1,4 +1,4 @@
-package chapter3;
+package chapter03;
 
 import java.util.Stack;
 

src/chapter3/MyQueue.java renamed to src/chapter03/MyQueue.java

@@ -1,6 +1,6 @@
-package chapter3;
+package chapter03;
 
-import chapter2.Node;
+import chapter02.Node;
 
 /* I made a Queue of NODES. Book does a Queue of OBJECTS */
 public class Queue {

src/chapter3/Queue.java renamed to src/chapter03/Queue.java

@@ -1,6 +1,6 @@
-package chapter3;
+package chapter03;
 
-import chapter2.Node;
+import chapter02.Node;
 
 /* I made a Stack of NODES. Book does a Stack of OBJECTS */
 public class Stack {

src/chapter3/Stack.java renamed to src/chapter03/Stack.java

@@ -1,4 +1,4 @@
-package chapter3;
+package chapter03;
 
  /* Remember to use "int [] heads = {-1,-1,-1}" and simply implement push/pop/peek */
 public class ThreePoint1 {

src/chapter3/ThreePoint1.java renamed to src/chapter03/ThreePoint1.java

@@ -1,4 +1,4 @@
-package chapter3;
+package chapter03;
 
 import java.util.Stack;
 

src/chapter3/ThreePoint2.java renamed to src/chapter03/ThreePoint2.java

@@ -1,4 +1,4 @@
-package chapter3;
+package chapter03;
 
 import java.util.ArrayList;
 import java.util.Stack;

src/chapter3/ThreePoint3.java renamed to src/chapter03/ThreePoint3.java

@@ -1,4 +1,4 @@
-package chapter3;
+package chapter03;
 
 /* Also uses Tower class */
 public class ThreePoint4 {

src/chapter3/ThreePoint4.java renamed to src/chapter03/ThreePoint4.java

@@ -1,4 +1,4 @@
-package chapter3;
+package chapter03;
 
 import java.util.Stack;
 

src/chapter3/ThreePoint6.java renamed to src/chapter03/ThreePoint6.java

@@ -1,4 +1,4 @@
-package chapter3.ThreePoint7;
+package chapter03.ThreePoint7;
 
 public abstract class Animal {
 	String name;

src/chapter3/ThreePoint7/Animal.java renamed to src/chapter03/ThreePoint7/Animal.java

@@ -1,4 +1,4 @@
-package chapter3.ThreePoint7;
+package chapter03.ThreePoint7;
 
 public class Cat extends Animal {
 	/* Constructor */

src/chapter3/ThreePoint7/Cat.java renamed to src/chapter03/ThreePoint7/Cat.java

@@ -1,4 +1,4 @@
-package chapter3.ThreePoint7;
+package chapter03.ThreePoint7;
 
 public class Dog extends Animal{
 	/* Constructor */

src/chapter3/ThreePoint7/Dog.java renamed to src/chapter03/ThreePoint7/Dog.java

@@ -1,4 +1,4 @@
-package chapter3.ThreePoint7;
+package chapter03.ThreePoint7;
 
 import java.util.LinkedList;
 

src/chapter3/ThreePoint7/Shelter.java renamed to src/chapter03/ThreePoint7/Shelter.java

@@ -1,4 +1,4 @@
-package chapter3.ThreePoint7;
+package chapter03.ThreePoint7;
 
 /* Skills Utilized:
  * 1) Inheritance: using "extends". Abstract method in "Animal".

src/chapter3/ThreePoint7/ThreePoint7.java renamed to src/chapter03/ThreePoint7/ThreePoint7.java

@@ -1,4 +1,4 @@
-package chapter3;
+package chapter03;
 
 import java.util.Stack;
 

src/chapter3/Tower.java renamed to src/chapter03/Tower.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 import java.util.ArrayList;
 import java.util.LinkedList;

src/chapter4/Chapter4.java renamed to src/chapter04/Chapter4.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 /* Checks if binary tree is balanced.
  * 

src/chapter4/FourPoint1.java renamed to src/chapter04/FourPoint1.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 import java.util.Queue;
 import java.util.LinkedList;

src/chapter4/FourPoint2.java renamed to src/chapter04/FourPoint2.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 /* Main Trick: Binary Search */
 public class FourPoint3 {

src/chapter4/FourPoint3.java renamed to src/chapter04/FourPoint3.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 import java.util.ArrayList;
 import java.util.LinkedList;

src/chapter4/FourPoint4.java renamed to src/chapter04/FourPoint4.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 /* Checks if binary tree is binary search tree (BST)
  * 

src/chapter4/FourPoint5.java renamed to src/chapter04/FourPoint5.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 /* Read book's logic (but ignore its code). My code is much cleaner
  * - Notice there are 2 distinct cases: "leftMostChild" (easy to code), "properParent" (a little tricky)

src/chapter4/FourPoint6.java renamed to src/chapter04/FourPoint6.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 /* Find common ancestor
  * 

src/chapter4/FourPoint7.java renamed to src/chapter04/FourPoint7.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 /* Tests if one tree is subtree of another
  * 

src/chapter4/FourPoint8.java renamed to src/chapter04/FourPoint8.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 import java.util.ArrayList;
 

src/chapter4/FourPoint9.java renamed to src/chapter04/FourPoint9.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 import java.util.Queue;
 import java.util.LinkedList;

src/chapter4/GraphFunctions.java renamed to src/chapter04/GraphFunctions.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 import java.util.HashSet;
 

src/chapter4/GraphNode.java renamed to src/chapter04/GraphNode.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 import java.util.Queue;
 import java.util.LinkedList;

src/chapter4/TreeFunctions.java renamed to src/chapter04/TreeFunctions.java

@@ -1,4 +1,4 @@
-package chapter4;
+package chapter04;
 
 public class TreeNode {
 	TreeNode left   = null;

src/chapter4/TreeNode.java renamed to src/chapter04/TreeNode.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 public class BitFunctions {
 	public static boolean getBit(int num, int bit){

src/chapter5/BitFunctions.java renamed to src/chapter05/BitFunctions.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 // Code copied from: https://code.google.com/p/basic-algorithm-operations/source/browse/trunk/java/CareerCup/Book+Solutions/Chapter+5/Question5_7/?r=274
 // BTW, INTEGER_SIZE was not initialized in original code, so I set it to 3 here.

src/chapter5/BitInteger.java renamed to src/chapter05/BitInteger.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 import java.util.ArrayList;
 

src/chapter5/Chapter5.java renamed to src/chapter05/Chapter5.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 public class FivePoint1 {
 	/* Solution from book. There are many other ways to solve this also */

src/chapter5/FivePoint1.java renamed to src/chapter05/FivePoint1.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 /* Binary representation of decimal
  * 

src/chapter5/FivePoint2.java renamed to src/chapter05/FivePoint2.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 /* Given positive integer, print next smallest and next largest w/ same # of 1s in binary representation.
  * 

src/chapter5/FivePoint3.java renamed to src/chapter05/FivePoint3.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 public class FivePoint5 {
 	/* Clever Trick: XOR */

src/chapter5/FivePoint5.java renamed to src/chapter05/FivePoint5.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 public class FivePoint6 {
 	/* Clever Trick: Shifting. Initially learned from the book */

src/chapter5/FivePoint6.java renamed to src/chapter05/FivePoint6.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 import java.util.ArrayList;
 import java.util.Iterator;

src/chapter5/FivePoint7.java renamed to src/chapter05/FivePoint7.java

@@ -1,4 +1,4 @@
-package chapter5;
+package chapter05;
 
 /* I basically copied the book code. Tricks:
  * 1) Set full bytes first

src/chapter5/FivePoint8.java renamed to src/chapter05/FivePoint8.java

@@ -1,4 +1,4 @@
-package chapter7;
+package chapter07;
 
 public class Chapter7 {
 	public static void main(String [] args){