diff --git a/src/dynamicprogramming/CandieDistribution.java b/src/dynamicprogramming/CandieDistribution.java
index fe2abcd..dbebd25 100644
--- a/src/dynamicprogramming/CandieDistribution.java
+++ b/src/dynamicprogramming/CandieDistribution.java
@@ -1,6 +1,5 @@
 package dynamicprogramming;
 
-import java.util.Arrays;
 import java.util.Scanner;
 
 public class CandieDistribution {
@@ -51,7 +50,6 @@ static int candies(int grades[], int i, int memo[]) {
 	}
 	
 	public static void main(String[] args) {
-		System.out.println(Integer.MAX_VALUE);
 		Scanner s = new Scanner(System.in);
 		int l = Integer.parseInt(s.nextLine());
 		int grades[] = new int[l];
diff --git a/src/dynamicprogramming/CoinChange.java b/src/dynamicprogramming/CoinChange.java
index 431f3e1..1ce5bdc 100644
--- a/src/dynamicprogramming/CoinChange.java
+++ b/src/dynamicprogramming/CoinChange.java
@@ -15,11 +15,11 @@ static void coinChange1(int dollars, int coins[]) {
 			for(int coin:coins) {
 				if(coin<=i && memo[i-coin]<memo[i]) {
 					memo[i] = memo[i-coin]+1;
-					int temp = memo[i];
 				}
 			}
 		}
 		System.out.println(memo[dollars]);
+		System.out.println(Arrays.toString(memo));
 	}
 	
 	public static void main(String[] args) {
diff --git a/src/dynamicprogramming/CoinChangePossible.java b/src/dynamicprogramming/CoinChangePossible.java
index 971f235..42d14cb 100644
--- a/src/dynamicprogramming/CoinChangePossible.java
+++ b/src/dynamicprogramming/CoinChangePossible.java
@@ -1,5 +1,6 @@
 package dynamicprogramming;
 
+import java.util.Arrays;
 import java.util.Scanner;
 
 public class CoinChangePossible {
@@ -12,7 +13,9 @@ static long coinChange(int coins[], int size, int amount) {
 				memo[j] += memo[j-coins[i]];
 			}
 		}
+		System.out.println(Arrays.toString(memo));
 		return memo[amount];
+		
 	}
 
 	public static void main(String[] args) {
diff --git a/src/dynamicprogramming/CountStringsWithoutConsecutiveOnes.java b/src/dynamicprogramming/CountStringsWithoutConsecutiveOnes.java
new file mode 100644
index 0000000..9d5200b
--- /dev/null
+++ b/src/dynamicprogramming/CountStringsWithoutConsecutiveOnes.java
@@ -0,0 +1,24 @@
+package dynamicprogramming;
+
+public class CountStringsWithoutConsecutiveOnes {
+
+	public static int countStrings(int n) {
+		int a[] = new int[n+1];
+		int b[] = new int[n+1];
+		
+		a[1] = b[1] = 1;
+		System.out.println(a[1]+b[1]);
+		for(int i=2;i<=n;i++) {
+			a[i] = a[i-1]+b[i-1];
+			b[i] = a[i-1];
+			System.out.println(a[i]+b[i]);
+		}
+		
+		return a[n]+b[n];
+	}
+	
+	public static void main(String[] args) {
+		
+		countStrings(8);
+	}
+}
diff --git a/src/dynamicprogramming/IncreasingSequence.java b/src/dynamicprogramming/IncreasingSequence.java
index eb0eb5f..e3388ac 100644
--- a/src/dynamicprogramming/IncreasingSequence.java
+++ b/src/dynamicprogramming/IncreasingSequence.java
@@ -4,10 +4,10 @@
 import java.io.File;
 import java.io.FileReader;
 import java.math.BigInteger;
+import java.util.HashMap;
 import java.util.Scanner;
 
 public class IncreasingSequence {
-
 	static void increasingSequence(BigInteger a[]) {
 		long change=0;
 		for(int i=1;i<a.length;i++) {
diff --git a/src/dynamicprogramming/ShortPalin.java b/src/dynamicprogramming/ShortPalin.java
index 86c44b7..9acec5a 100644
--- a/src/dynamicprogramming/ShortPalin.java
+++ b/src/dynamicprogramming/ShortPalin.java
@@ -1,11 +1,5 @@
 package dynamicprogramming;
 
-import java.math.BigInteger;
-import java.util.Arrays;
-import java.util.HashMap;
-import java.util.Map;
-import java.util.Scanner;
-
 public class ShortPalin {
 
 
diff --git a/src/dynamicprogramming/WineProfit.java b/src/dynamicprogramming/WineProfit.java
index 67443f8..c7a1ebe 100644
--- a/src/dynamicprogramming/WineProfit.java
+++ b/src/dynamicprogramming/WineProfit.java
@@ -11,7 +11,7 @@ public static int profit(int year, int be, int en, int p[]) {
 		
 		int profit1 =  profit(year+1, be+1, en, p)+year*p[be];
 		int profit2 =  profit(year+1, be, en-1, p)+year*p[en];
-		if(cache[be][en] != 0) return cache[be][en];
+		if(cache[be][en] != 0)  return cache[be][en];
 		
 		return cache[be][en] = Math.max(profit2, profit1);
 	}