restructured code

Author: ayansen

README.md

@@ -0,0 +1,49 @@
+# Code Logbook
+This repository contains solutions for standard programming problems structured by the algorithmic techniques or datastructures 
+used to solve them
+
+## Algorithm Techniques
+In mathematics and computer science, an algorithmic technique is a general approach for implementing a process or computation
+
+
+### Brute Force
+Brute Force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic paradigm that consists of systematically enumerating all possible candidates 
+for the solution and checking whether each candidate satisfies the problem's statement. An example of a brute force technique is backtracking.Backtracking is an algorithm where we 
+traverse all the possible paths to find the correct solution. 
+
+### Divide and Conquer
+The divide and conquer technique decomposes complex problems recursively into smaller sub-problems. 
+Each sub-problem is then solved and these partial solutions are recombined to determine the overall solution. 
+This technique is often used for searching and sorting.
+
+### Dynamic Programming
+Dynamic programming is a systematic technique in which a complex problem is decomposed recursively into smaller, overlapping sub-problems for solution.
+Dynamic programming stores the results of the overlapping sub-problems locally using an optimization technique called memoization
+
+
+### Greedy 
+A greedy approach begins by evaluating one possible outcome from the set of possible outcomes, and then searches locally for an improvement on that outcome.
+When a local improvement is found, it will repeat the process and again search locally for additional improvements near this local optimum. 
+A greedy technique is generally simple to implement, and these series of decisions can be used to find local optimums depending on where the search began. 
+However, greedy techniques may not identify the global optimum across the entire set of possible outcomes.
+
+
+### Graph Traversal
+Graph traversal is a technique for finding solutions to problems that can be represented as graphs.
+This approach is broad, and includes depth-first search, breadth-first search, tree traversal, and many specific variations that may include local optimizations and excluding search spaces that can be determined to be non-optimum or not possible. 
+These techniques may be used to solve a variety of problems including shortest path and constraint satisfaction problems.
+
+## Datastructures
+
+
+### HashMaps
+
+### Heap
+
+### List
+
+### Stack
+
+### Tree
+
+

src/main/java/algorithms/backtracking/FindLongestPathInMatrix.java src/main/java/algorithm/bruteforce/FindLongestPathInMatrix.java

@@ -1,4 +1,4 @@
-package algorithms.backtracking;
+package algorithm.bruteforce;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/algorithms/backtracking/FindStringInDictionary.java src/main/java/algorithm/bruteforce/FindStringInDictionary.java

@@ -1,7 +1,6 @@
-package algorithms.backtracking;
+package algorithm.bruteforce;
 
 import java.util.ArrayList;
-import java.util.Arrays;
 import java.util.List;
 import java.util.Stack;
 

src/main/java/algorithms/backtracking/ResolveWildcardCharacter.java src/main/java/algorithm/bruteforce/ResolveWildcardCharacter.java

@@ -1,4 +1,4 @@
-package algorithms.backtracking;
+package algorithm.bruteforce;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/algorithms/divideandconquer/LargestAndSmallestNumber.java src/main/java/algorithm/divideandconquer/LargestAndSmallestNumber.java

@@ -1,11 +1,12 @@
-package algorithms.divideandconquer;
+package algorithm.divideandconquer;
 
 /**
  * Created by aysen on 10/16/16.
  */
 
 
-import javafx.util.Pair;
+
+import algorithm.mathematicaloptimizations.lists.Pair;
 
 import java.util.List;
 

src/main/java/algorithms/dp/FibonacciSeries.java src/main/java/algorithm/dp/FibonacciSeries.java

@@ -1,4 +1,4 @@
-package algorithms.dp;
+package algorithm.dp;
 
 
 public class FibonacciSeries {

src/main/java/algorithms/dp/LongestCommonSubsequence.java src/main/java/algorithm/dp/LongestCommonSubsequence.java

@@ -1,4 +1,4 @@
-package algorithms.dp;
+package algorithm.dp;
 
 public class LongestCommonSubsequence {
 

src/main/java/algorithms/dp/LowestTravelCost.java src/main/java/algorithm/dp/LowestTravelCost.java

@@ -1,4 +1,4 @@
-package algorithms.dp;
+package algorithm.dp;
 
 import java.util.*;
 import java.util.stream.Collectors;

src/main/java/algorithms/dp/MaxSubMatrix.java src/main/java/algorithm/dp/MaxSubMatrix.java

@@ -1,4 +1,4 @@
-package algorithms.dp;
+package algorithm.dp;
 
 import java.util.Arrays;
 

src/main/java/algorithms/dp/MinimumCoins.java src/main/java/algorithm/dp/MinimumCoins.java

@@ -1,4 +1,4 @@
-package algorithms.dp;
+package algorithm.dp;
 
 import java.util.Collections;
 import java.util.List;

src/main/java/algorithms/dp/MinimumPerfectSquares.java src/main/java/algorithm/dp/MinimumPerfectSquares.java

@@ -1,4 +1,4 @@
-package algorithms.dp;
+package algorithm.dp;
 
 public class MinimumPerfectSquares {
     /**

src/main/java/algorithms/dp/PrintStringInDictionary.java src/main/java/algorithm/dp/PrintStringInDictionary.java

@@ -1,4 +1,4 @@
-package algorithms.dp;
+package algorithm.dp;
 
 public class PrintStringInDictionary {
 

src/main/java/algorithms/dp/StockPriceProblem.java src/main/java/algorithm/dp/StockPriceProblem.java

@@ -1,4 +1,4 @@
-package algorithms.dp;
+package algorithm.dp;
 
 public class StockPriceProblem {
 

src/main/java/datastructure/graphs/Edge.java src/main/java/algorithm/graphtraversal/Edge.java

@@ -1,4 +1,4 @@
-package datastructure.graphs;
+package algorithm.graphtraversal;
 
 /**
  * Created by aysen on 10/18/16.

src/main/java/datastructure/graphs/EdgeWeightedGraph.java src/main/java/algorithm/graphtraversal/EdgeWeightedGraph.java

@@ -1,4 +1,4 @@
-package datastructure.graphs;
+package algorithm.graphtraversal;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/datastructure/graphs/Vertex.java src/main/java/algorithm/graphtraversal/Vertex.java

@@ -1,9 +1,7 @@
-package datastructure.graphs;
+package algorithm.graphtraversal;
 
 import java.util.ArrayDeque;
-import java.util.HashSet;
 import java.util.Queue;
-import java.util.Set;
 
 /**
  * Created by aysen on 10/18/16.

src/main/java/datastructure/graphs/problems/DetectCylesInAGraph.java src/main/java/algorithm/graphtraversal/problems/DetectCylesInAGraph.java

@@ -1,7 +1,7 @@
-package datastructure.graphs.problems;
+package algorithm.graphtraversal.problems;
 
-import datastructure.graphs.Edge;
-import datastructure.graphs.EdgeWeightedGraph;
+import algorithm.graphtraversal.Edge;
+import algorithm.graphtraversal.EdgeWeightedGraph;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/datastructure/graphs/problems/MaximumLengthBetweenCities.java src/main/java/algorithm/graphtraversal/problems/MaximumLengthBetweenCities.java

@@ -1,7 +1,7 @@
-package datastructure.graphs.problems;
+package algorithm.graphtraversal.problems;
 
-import datastructure.graphs.EdgeWeightedGraph;
-import datastructure.graphs.Vertex;
+import algorithm.graphtraversal.EdgeWeightedGraph;
+import algorithm.graphtraversal.Vertex;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/datastructure/graphs/problems/ShortestPathInDAG.java src/main/java/algorithm/graphtraversal/problems/ShortestPathInDAG.java

@@ -1,7 +1,7 @@
-package datastructure.graphs.problems;
+package algorithm.graphtraversal.problems;
 
-import datastructure.graphs.EdgeWeightedGraph;
-import datastructure.graphs.Vertex;
+import algorithm.graphtraversal.EdgeWeightedGraph;
+import algorithm.graphtraversal.Vertex;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/datastructure/graphs/problems/TopologicalSort.java src/main/java/algorithm/graphtraversal/problems/TopologicalSort.java

@@ -1,11 +1,10 @@
-package datastructure.graphs.problems;
+package algorithm.graphtraversal.problems;
 
-import datastructure.graphs.Edge;
-import datastructure.graphs.EdgeWeightedGraph;
-import datastructure.graphs.Vertex;
+import algorithm.graphtraversal.Edge;
+import algorithm.graphtraversal.EdgeWeightedGraph;
+import algorithm.graphtraversal.Vertex;
 
 import java.util.*;
-import java.util.stream.Collectors;
 
 public class TopologicalSort {
 

src/main/java/datastructure/graphs/traversals/BreadthFirstTraversal.java src/main/java/algorithm/graphtraversal/traversals/BreadthFirstTraversal.java

@@ -1,8 +1,8 @@
-package datastructure.graphs.traversals;
+package algorithm.graphtraversal.traversals;
 
-import datastructure.graphs.Edge;
-import datastructure.graphs.EdgeWeightedGraph;
-import datastructure.graphs.Vertex;
+import algorithm.graphtraversal.Edge;
+import algorithm.graphtraversal.EdgeWeightedGraph;
+import algorithm.graphtraversal.Vertex;
 
 import java.util.*;
 import java.util.stream.Collectors;

src/main/java/datastructure/graphs/traversals/DepthFirstTraversal.java src/main/java/algorithm/graphtraversal/traversals/DepthFirstTraversal.java

@@ -1,7 +1,7 @@
-package datastructure.graphs.traversals;
+package algorithm.graphtraversal.traversals;
 
-import datastructure.graphs.Edge;
-import datastructure.graphs.EdgeWeightedGraph;
+import algorithm.graphtraversal.Edge;
+import algorithm.graphtraversal.EdgeWeightedGraph;
 
 import java.util.HashSet;
 import java.util.List;

src/main/java/datastructure/trees/BinarySearchTree.java src/main/java/algorithm/graphtraversal/trees/BinarySearchTree.java

@@ -1,8 +1,5 @@
-package datastructure.trees;
+package algorithm.graphtraversal.trees;
 
-import javax.swing.tree.TreeNode;
-import java.util.ArrayList;
-import java.util.List;
 import java.util.Optional;
 
 /**

src/main/java/datastructure/trees/BinaryTreeNode.java src/main/java/algorithm/graphtraversal/trees/BinaryTreeNode.java

@@ -1,4 +1,4 @@
-package datastructure.trees;
+package algorithm.graphtraversal.trees;
 
 /**
  * Created by aysen on 10/2/16.

src/main/java/datastructure/trees/TreeNode.java src/main/java/algorithm/graphtraversal/trees/TreeNode.java

@@ -1,4 +1,4 @@
-package datastructure.trees;
+package algorithm.graphtraversal.trees;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/datastructure/trees/TreeTraversals.java src/main/java/algorithm/graphtraversal/trees/TreeTraversals.java

@@ -1,4 +1,4 @@
-package datastructure.trees;
+package algorithm.graphtraversal.trees;
 
 import java.util.ArrayDeque;
 import java.util.ArrayList;

src/main/java/datastructure/trees/problems/TreeProblems.java src/main/java/algorithm/graphtraversal/trees/problems/TreeProblems.java

@@ -1,6 +1,6 @@
-package datastructure.trees.problems;
+package algorithm.graphtraversal.trees.problems;
 
-import datastructure.trees.BinaryTreeNode;
+import algorithm.graphtraversal.trees.BinaryTreeNode;
 
 import java.util.ArrayDeque;
 import java.util.ArrayList;

src/main/java/algorithms/greedy/MinimumSpanningTree.java src/main/java/algorithm/greedy/MinimumSpanningTree.java

@@ -1,7 +1,7 @@
-package algorithms.greedy;
+package algorithm.greedy;
 
-import datastructure.graphs.Edge;
-import datastructure.graphs.EdgeWeightedGraph;
+import algorithm.graphtraversal.Edge;
+import algorithm.graphtraversal.EdgeWeightedGraph;
 
 public class MinimumSpanningTree {
 

src/main/java/algorithms/greedy/ShortestPathInGraph.java src/main/java/algorithm/greedy/ShortestPathInGraph.java

@@ -1,6 +1,6 @@
-package algorithms.greedy;
+package algorithm.greedy;
 
-import datastructure.graphs.EdgeWeightedGraph;
+import algorithm.graphtraversal.EdgeWeightedGraph;
 
 import java.util.HashMap;
 import java.util.Map;

src/main/java/datastructure/heap/BinaryMaxHeap.java src/main/java/algorithm/mathematicaloptimizations/BinaryMaxHeap.java

@@ -1,4 +1,4 @@
-package datastructure.heap;
+package algorithm.mathematicaloptimizations;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/datastructure/heap/BinaryMinHeap.java src/main/java/algorithm/mathematicaloptimizations/BinaryMinHeap.java

@@ -1,4 +1,4 @@
-package datastructure.heap;
+package algorithm.mathematicaloptimizations;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/datastructure/hashing/problems/HashProblems.java src/main/java/algorithm/mathematicaloptimizations/HashProblems.java

@@ -1,7 +1,7 @@
-package datastructure.hashing.problems;
+package algorithm.mathematicaloptimizations;
 
-import datastructure.trees.BinaryTreeNode;
-import javafx.util.Pair;
+import algorithm.mathematicaloptimizations.lists.Pair;
+import algorithm.graphtraversal.trees.BinaryTreeNode;
 
 import java.util.*;
 

src/main/java/datastructure/heap/Heap.java src/main/java/algorithm/mathematicaloptimizations/Heap.java

@@ -1,4 +1,4 @@
-package datastructure.heap;
+package algorithm.mathematicaloptimizations;
 
 /**
  * Created by aysen on 10/28/16.

src/main/java/datastructure/heap/problems/HeapProblems.java src/main/java/algorithm/mathematicaloptimizations/heap/problems/HeapProblems.java

@@ -1,8 +1,8 @@
-package datastructure.heap.problems;
+package algorithm.mathematicaloptimizations.heap.problems;
 
-import datastructure.heap.BinaryMaxHeap;
-import datastructure.heap.BinaryMinHeap;
-import datastructure.heap.Heap;
+import algorithm.mathematicaloptimizations.BinaryMaxHeap;
+import algorithm.mathematicaloptimizations.BinaryMinHeap;
+import algorithm.mathematicaloptimizations.Heap;
 
 import java.util.List;
 import java.util.stream.Collectors;

src/main/java/datastructure/lists/LinkedList.java src/main/java/algorithm/mathematicaloptimizations/lists/LinkedList.java

@@ -1,4 +1,4 @@
-package datastructure.lists;
+package algorithm.mathematicaloptimizations.lists;
 
 import java.util.Collection;
 import java.util.Iterator;

src/main/java/algorithm/mathematicaloptimizations/lists/Pair.java

@@ -0,0 +1,50 @@
+package algorithm.mathematicaloptimizations.lists;
+
+import java.util.Objects;
+
+public class Pair<U, V> {
+
+    /**
+     * The first element of this <code>Pair</code>
+     */
+    private U key;
+
+    /**
+     * The second element of this <code>Pair</code>
+     */
+    private V value;
+
+    /**
+     * Constructs a new <code>Pair</code> with the given values.
+     *
+     * @param key  the key
+     * @param value the value
+     */
+    public Pair(U key, V value) {
+
+        this.key = key;
+        this.value = value;
+    }
+
+    public U getKey() {
+        return key;
+    }
+
+    public V getValue() {
+        return value;
+    }
+
+    @Override
+    public boolean equals(Object o) {
+        if (this == o) return true;
+        if (o == null || getClass() != o.getClass()) return false;
+        Pair<?, ?> pair = (Pair<?, ?>) o;
+        return Objects.equals(key, pair.key) && Objects.equals(value, pair.value);
+    }
+
+    @Override
+    public int hashCode() {
+        return Objects.hash(key, value);
+    }
+}
+

src/main/java/datastructure/lists/problems/ListProblems.java src/main/java/algorithm/mathematicaloptimizations/lists/problems/ListProblems.java

@@ -1,4 +1,4 @@
-package datastructure.lists.problems;
+package algorithm.mathematicaloptimizations.lists.problems;
 
 /**
  * Created by aysen on 10/27/16.

src/main/java/datastructure/lists/problems/MergeSortedLinkedLists.java src/main/java/algorithm/mathematicaloptimizations/lists/problems/MergeSortedLinkedLists.java

@@ -1,4 +1,4 @@
-package datastructure.lists.problems;
+package algorithm.mathematicaloptimizations.lists.problems;
 
 import java.util.LinkedList;
 import java.util.List;