Clean up, comments and gitignore for Idea

Author: qza

.gitignore

@@ -35,3 +35,8 @@ nb-configuration.xml
 
 # virtual machine crash logs, see http://www.java.com/en/download/help/error_hotspot.xml
 hs_err_pid*
+
+# idea
+
+.idea
+*.iml

pom.xml

@@ -70,6 +70,20 @@
 </executions>
 </plugin>
 
+<plugin>
+<groupId>org.scalatest</groupId>
+<artifactId>scalatest-maven-plugin</artifactId>
+<version>1.0</version>
+<executions>
+<execution>
+<id>test</id>
+<goals>
+<goal>test</goal>
+</goals>
+</execution>
+</executions>
+</plugin>
+
 <plugin>
 <groupId>org.apache.maven.plugins</groupId>
 <artifactId>maven-compiler-plugin</artifactId>

src/main/java/codechallenges/concurrent/semaphore/buffer/BoundedBuffer.java

@@ -8,7 +8,7 @@
 /**
  * BoundedBuffer
  *
- * Bounded buffer has purpose in Produces-Consumer scenario.
+ * Bounded buffer has purpose in Producer-Consumer scenario.
  *
  * Main requirements are:
  *

src/main/java/codechallenges/dynamicprogramming/LongestCommonSubsequence.java

@@ -3,12 +3,12 @@
 import static java.lang.Math.max;
 import java.util.Arrays;
 
+
 /**
  * The Longest Common Subsequence
  *
  * Given two sequences S1 and S2, find longest common subsequence S
  *
- * @author qza
  */
 public class LongestCommonSubsequence {
 

src/main/java/codechallenges/model/graph/Graph.java

@@ -13,7 +13,6 @@
  * @see Vertex
  * @see Edge
  *
- * @author qza
  */
 public interface Graph {
 

src/main/scala/codechallenges/methods/NewtonSquareRoots.scala

@@ -9,6 +9,8 @@
 
 import static org.junit.Assert.assertArrayEquals;
 
+import codechallenges.dynamicprogramming.Knapsack;
+
 /**
  *
  * @author qza

src/test/java/codechallenges/dynamicprogramming/KnapsackTest.java

@@ -9,6 +9,8 @@
 
 import static org.junit.Assert.assertArrayEquals;
 
+import codechallenges.dynamicprogramming.LongestCommonSubsequence;
+
 /**
  *
  * @author qza