diff --git a/RodCutting.java b/RodCutting.java
new file mode 100644
index 0000000..e22a33b
--- /dev/null
+++ b/RodCutting.java
@@ -0,0 +1,72 @@
+package DP;
+
+public class RodCutting {
+
+	public static void main(String[] args) {
+		int[] price = { 0, 1, 5, 8, 9, 10, 17, 17, 20 };
+		System.out.println(RodCutRecusrion(price, price.length - 1));
+		System.out.println(RCTD(price, price.length - 1, new int[price.length]));
+		System.out.println(RodCutBU(price));
+	}
+
+	public static int RodCutRecusrion(int[] price, int n) {
+		int max = price[n];
+		int left = 1;
+		int right = n - 1;
+		while (left <= right) {
+			int fp = RodCutRecusrion(price, left);
+			int sp = RodCutRecusrion(price, right);
+			int total = fp + sp;
+			if (total > max) {
+				max = total;
+			}
+			left++;
+			right--;
+		}
+		return max;
+	}
+
+	public static int RCTD(int[] price, int n, int[] strg) {
+		if (strg[n] != 0) {
+			return strg[n];
+		}
+		int max = price[n];
+		int left = 1;
+		int right = n - 1;
+		while (left <= right) {
+			int fp = RCTD(price, left, strg);
+			int sp = RCTD(price, right, strg);
+			int total = fp + sp;
+			if (total > max) {
+				max = total;
+			}
+			left++;
+			right--;
+		}
+		strg[n] = max;
+		return max;
+	}
+
+	public static int RodCutBU(int[] price) {
+		int[] strg = new int[price.length];
+		strg[0] = price[0];
+		strg[1] = price[1];
+		for (int n = 2; n < strg.length; n++) {
+			int max = price[n];
+			int left = 1;
+			int right = n - 1;
+			while (left <= right) {
+				int fp = strg[left];
+				int sp = strg[right];
+				int total = fp + sp;
+				if (total > max) {
+					max = total;
+				}
+				left++;
+				right--;
+			}
+			strg[n] = max;
+		}
+		return strg[strg.length - 1];
+	}
+}