Pom version change

pom.xml

@@ -6,7 +6,7 @@
 
     <groupId>com.ossez</groupId>
     <artifactId>parent-modules</artifactId>
-    <version>0.0.1</version>
+    <version>0.0.1-SNAPSHOT</version>
     <packaging>pom</packaging>
 
     <name>CWIKIUS-OSSEZ Java Parent Modules</name>

src/main/java/com/ossez/lang/tutorial/Main.java → src/main/java/com/ossez/codebank/algorithm/Main.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial;
+package com.ossez.codebank.algorithm;
 
 import java.util.Properties;
 

src/main/java/com/ossez/codebank/algorithm/models/ListNode.java

@@ -0,0 +1,16 @@
+package com.ossez.codebank.algorithm.models;
+
+/**
+ * 
+ * @author YuCheng
+ *
+ */
+public class ListNode {
+	public  int val;
+	public  ListNode next;
+
+	public ListNode(int x) {
+		val = x;
+		next = null;
+	}
+}

src/main/java/com/ossez/codebank/algorithm/models/TreeNode.java

@@ -0,0 +1,16 @@
+package com.ossez.codebank.algorithm.models;
+
+/**
+ * 
+ * @author YuCheng
+ *
+ */
+public class TreeNode {
+	public int val;
+	public TreeNode left, right;
+
+	public TreeNode(int val) {
+		this.val = val;
+		this.left = this.right = null;
+	}
+}

src/main/java/com/ossez/lang/tutorial/objplusclass/CreateObject.java → src/main/java/com/ossez/codebank/algorithm/objplusclass/CreateObject.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial.objplusclass;
+package com.ossez.codebank.algorithm.objplusclass;
 
 /**
  * 

src/main/java/com/ossez/lang/tutorial/overview/FreshJuiceEnums.java → src/main/java/com/ossez/codebank/algorithm/overview/FreshJuiceEnums.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial.overview;
+package com.ossez.codebank.algorithm.overview;
 
 /**
  * Java Tutorial

src/main/java/com/ossez/lang/tutorial/overview/HelloWorld.java → src/main/java/com/ossez/codebank/algorithm/overview/HelloWorld.java

@@ -1,4 +1,4 @@
-package com.ossez.lang.tutorial.overview;
+package com.ossez.codebank.algorithm.overview;
 
 /**
  * Java Tutorial

src/main/java/com/ossez/lang/tutorial/utils/TreeUtils.java → src/main/java/com/ossez/codebank/algorithml/utils/TreeUtils.java

@@ -1,55 +1,55 @@
-package com.ossez.lang.tutorial.utils;
-
-import java.util.ArrayList;
-
-import com.ossez.lang.tutorial.models.TreeNode;
-
-/**
- * 
- * @author YuCheng
- *
- */
-public class TreeUtils {
-
-	public static TreeNode initTree(String data) {
-		// NULL CHECK
-		if (data.equals("{}")) {
-			return null;
-		}
-
-		ArrayList<TreeNode> treeList = new ArrayList<TreeNode>();
-
-		data = data.replace("{", "");
-		data = data.replace("}", "");
-		String[] vals = data.split(",");
-
-		// INSERT ROOT
-		TreeNode root = new TreeNode(Integer.parseInt(vals[0]));
-		treeList.add(root);
-
-		int index = 0;
-		boolean isLeftChild = true;
-		for (int i = 1; i < vals.length; i++) {
-			if (!vals[i].equals("#")) {
-				TreeNode node = new TreeNode(Integer.parseInt(vals[i]));
-				if (isLeftChild) {
-					treeList.get(index).left = node;
-				} else {
-					treeList.get(index).right = node;
-				}
-				treeList.add(node);
-			}
-
-			// LEVEL
-			if (!isLeftChild) {
-				index++;
-			}
-
-			// MOVE TO RIGHT OR NEXT LEVEL
-			isLeftChild = !isLeftChild;
-		}
-
-		return root;
-
-	}
-}
+package com.ossez.codebank.algorithml.utils;
+
+import java.util.ArrayList;
+
+import com.ossez.codebank.algorithm.models.TreeNode;
+
+/**
+ * 
+ * @author YuCheng
+ *
+ */
+public class TreeUtils {
+
+	public static TreeNode initTree(String data) {
+		// NULL CHECK
+		if (data.equals("{}")) {
+			return null;
+		}
+
+		ArrayList<TreeNode> treeList = new ArrayList<TreeNode>();
+
+		data = data.replace("{", "");
+		data = data.replace("}", "");
+		String[] vals = data.split(",");
+
+		// INSERT ROOT
+		TreeNode root = new TreeNode(Integer.parseInt(vals[0]));
+		treeList.add(root);
+
+		int index = 0;
+		boolean isLeftChild = true;
+		for (int i = 1; i < vals.length; i++) {
+			if (!vals[i].equals("#")) {
+				TreeNode node = new TreeNode(Integer.parseInt(vals[i]));
+				if (isLeftChild) {
+					treeList.get(index).left = node;
+				} else {
+					treeList.get(index).right = node;
+				}
+				treeList.add(node);
+			}
+
+			// LEVEL
+			if (!isLeftChild) {
+				index++;
+			}
+
+			// MOVE TO RIGHT OR NEXT LEVEL
+			isLeftChild = !isLeftChild;
+		}
+
+		return root;
+
+	}
+}

src/main/java/com/ossez/codebank/interview/KayakCountUpDown.java

@@ -0,0 +1,86 @@
+package com.ossez.codebank.interview;
+
+import java.util.ArrayList;
+import java.util.List;
+
+import org.slf4j.Logger;
+import org.slf4j.LoggerFactory;
+
+/**
+ * 
+ * https://www.cwiki.us/display/ITCLASSIFICATION/Count+Up+Down
+ * 
+ * @author YuCheng
+ *
+ */
+public class KayakCountUpDown {
+	private final static Logger logger = LoggerFactory.getLogger(KayakCountUpDown.class);
+
+	static int minNumber = 0;
+	static int maxNumber = 0;
+	int tmpN = 0;
+	List<Integer> retList = new ArrayList<Integer>();
+
+	/**
+	 * 
+	 * @param start
+	 * @param end
+	 * @return
+	 */
+	public List<Integer> countUp(int start, int end) {
+		logger.debug("BEGIN");
+		maxNumber = end;
+		tmpN = start;
+		moveUp(0);
+		retList.add(end);
+		return retList;
+
+	}
+
+	/**
+	 * 
+	 * @param start
+	 * @param end
+	 * @return
+	 */
+	public List<Integer> countUpDown(int start, int end) {
+		logger.debug("BEGIN");
+		minNumber = start;
+		maxNumber = end;
+		tmpN = start;
+
+		moveUp(0);
+		retList.add(end);
+
+		moveDown(1);
+		return retList;
+
+	}
+
+	/**
+	 * 
+	 * @param n
+	 */
+	private void moveUp(int n) {
+		retList.add(tmpN);
+		tmpN++;
+		if (tmpN != maxNumber) {
+			moveUp(tmpN + 1);
+		}
+
+	}
+
+	/**
+	 * 
+	 * @param n
+	 */
+	private void moveDown(int n) {
+		tmpN = (maxNumber - n);
+		retList.add(tmpN);
+
+		if (tmpN != minNumber) {
+			moveDown(n + 1);
+		}
+	}
+
+}