binary tree

nodes at k distance from current node
pre order successor

Author: dheeraj9198

coding-todo

@@ -0,0 +1,17 @@
+package Array;
+
+/**
+ * Created by dheeraj on 7/11/2016.
+ */
+public class ReplaceZeroOneToFindLongest1 {
+    public static void main(String[] strings) {
+        int[] array = new int[]{1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1};
+
+        int start, rep, length;
+
+        for (int x = 0; x < array.length; x++) {
+
+        }
+
+    }
+}

src/Array/ReplaceZeroOneToFindLongest1.java

@@ -1,5 +1,14 @@
 package BinaryTree;
 
+
+import com.sun.deploy.model.Resource;
+
+import java.io.File;
+import java.security.CodeSigner;
+import java.security.cert.Certificate;
+import java.util.Map;
+import java.util.jar.JarFile;
+
 /**
  * Created by dheeraj on 7/10/2016.
  */
@@ -17,34 +26,33 @@ private static void printAtKFromCurrent(Node root, int currentDis, int diatance)
         printAtKFromCurrent(root.right, currentDis + 1, diatance);
     }
 
-    private static int findDis(Node node, int value,int distance) {
+    private static int findDis(Node node, int value, int distance) {
         if (node == null) {
             return -1;
         }
         if (node.data == value) {
-            printAtKFromCurrent(node,0,distance);
+            printAtKFromCurrent(node, 0, distance);
             return 1;
         }
-        int left = findDis(node.left, value,distance);
-        int right = findDis(node.right, value,distance);
+        int left = findDis(node.left, value, distance);
+        int right = findDis(node.right, value, distance);
 
         if (left > -1) {
-            if(left == distance){
+            if (left == distance) {
                 System.out.println(node.data);
             }
-            printAtKFromCurrent(node.right,1,distance-left);
-            return left+1;
+            printAtKFromCurrent(node.right, 1, distance - left);
+            return left + 1;
         } else if (right > -1) {
-            if(right == distance){
+            if (right == distance) {
                 System.out.println(node.data);
             }
-            printAtKFromCurrent(node.left,1,distance-right);
-            return right+1;
+            printAtKFromCurrent(node.left, 1, distance - right);
+            return right + 1;
         }
         return -1;
     }
 
-
     public static void main(String[] strings) {
         Node node = new Node(1);
 
@@ -60,6 +68,6 @@ public static void main(String[] strings) {
         node.left.left.left = new Node(8);
         node.left.left.left.left = new Node(9);
         node.left.left.right = new Node(10);
-        findDis(node,4,2);
+        findDis(node, 4, 2);
     }
 }

src/BinaryTree/KDistanceFromANode.java

@@ -1,7 +1,5 @@
 package BinaryTree;
 
-import javax.management.RuntimeMBeanException;
-
 /**
  * Created by dheeraj on 7/9/2016.
  */

src/BinaryTree/TreeFromInOrderLevelOrder.java

@@ -1,4 +1,4 @@
-package DP;
+package dymanicProgramming;
 
 import java.util.*;
 

src/DP/AllPermutationsOfString.java …Programming/AllPermutationsOfString.javasrc/DP/AllPermutationsOfString.java renamed to src/dymanicProgramming/AllPermutationsOfString.java src/DP/AllPermutationsOfString.java renamed to src/dymanicProgramming/AllPermutationsOfString.java

@@ -1,4 +1,4 @@
-package DP;
+package dymanicProgramming;
 
 /**
  * Created by dheeraj on 12/25/14.

src/DP/AppleCollectorTopCoder.java …cProgramming/AppleCollectorTopCoder.javasrc/DP/AppleCollectorTopCoder.java renamed to src/dymanicProgramming/AppleCollectorTopCoder.java src/DP/AppleCollectorTopCoder.java renamed to src/dymanicProgramming/AppleCollectorTopCoder.java

@@ -1,4 +1,4 @@
-package DP;
+package dymanicProgramming;
 
 import java.util.Hashtable;
 

src/DP/Beginner_CoinsSum.java …ymanicProgramming/Beginner_CoinsSum.javasrc/DP/Beginner_CoinsSum.java renamed to src/dymanicProgramming/Beginner_CoinsSum.java src/DP/Beginner_CoinsSum.java renamed to src/dymanicProgramming/Beginner_CoinsSum.java

@@ -1,4 +1,4 @@
-package DP;
+package dymanicProgramming;
 
 /**
  * Created by dheeraj on 6/7/16.

src/DP/CoinSumDp.java src/dymanicProgramming/CoinSumDp.javasrc/DP/CoinSumDp.java renamed to src/dymanicProgramming/CoinSumDp.java

@@ -1,4 +1,4 @@
-package DP;
+package dymanicProgramming;
 
 import java.util.Arrays;
 

src/DP/EggFloor.java src/dymanicProgramming/EggFloor.javasrc/DP/EggFloor.java renamed to src/dymanicProgramming/EggFloor.java

@@ -0,0 +1,37 @@
+package dymanicProgramming;
+
+/**
+ * Created by dheeraj on 7/10/2016.
+ */
+public class KnapsackProblem {
+
+    //10 -> 60
+    //20 -> 100
+    //30 -> 120
+
+    static int knapSack(int W, int wt[], int val[], int n) {
+        // Base Case
+        if (n == 0 || W == 0)
+            return 0;
+
+        // If weight of the nth item is more than Knapsack capacity W, then
+        // this item cannot be included in the optimal solution
+        if (wt[n] > W)
+            return knapSack(W, wt, val, n - 1);
+
+            // Return the maximum of two cases:
+            // (1) nth item included
+            // (2) not included
+        else return Math.max(val[n] + knapSack(W - wt[n], wt, val, n-1),
+                knapSack(W, wt, val, n-1)
+        );
+    }
+
+    public static void main(String[] strings) {
+        int val[] = {60, 100, 120};
+        int wt[] = {10, 20, 30};
+        int W = 50;
+        int n = val.length-1;
+        System.out.println(knapSack(W, wt, val, n));
+    }
+}