diff --git a/EqualStacks.java b/EqualStacks.java
new file mode 100644
index 0000000..873d09e
--- /dev/null
+++ b/EqualStacks.java
@@ -0,0 +1,93 @@
+package com.java2novice.algos;
+
+import java.io.BufferedWriter;
+import java.io.FileWriter;
+import java.io.IOException;
+import java.util.Scanner;
+import java.util.Stack;
+
+public class EqualStacks {
+
+    static int equalStacks(int[] ha1, int[] ha2, int[] ha3) {
+
+        Stack<Integer> s1 = new Stack<Integer>();
+        Stack<Integer> s2 = new Stack<Integer>();
+        Stack<Integer> s3 = new Stack<Integer>();
+
+        int h1 = 0;
+        int h2 = 0;
+        int h3 = 0;
+
+        int minStack;
+
+        for (int i = ha1.length - 1; i >= 0; i--) {
+            s1.push(ha1[i]);
+            h1 += ha1[i];
+        }
+
+        for (int i = ha2.length - 1; i >= 0; i--) {
+            s2.push(ha2[i]);
+            h2 += ha2[i];
+        }
+
+        for (int i = ha3.length - 1; i >= 0; i--) {
+            s3.push(ha3[i]);
+            h3 += ha3[i];
+        }
+
+        minStack = Math.min(h1, Math.min(h2, h3));
+
+        while (h1 != h2 || h1 != h3) {
+            while (h1 > minStack) {
+                h1 -= s1.pop();
+            }
+            minStack = Math.min(h1, Math.min(h2, h3));
+
+            while (h2 > minStack) {
+                h2 -= s2.pop();
+            }
+            minStack = Math.min(h1, Math.min(h2, h3));
+
+            while (h3 > minStack) {
+                h3 -= s3.pop();
+            }
+            minStack = Math.min(h1, Math.min(h2, h3));
+        }
+
+        return minStack;
+    }
+
+    private static final Scanner scanner = new Scanner(System.in);
+
+    public static void main(String[] args) throws IOException {
+
+        String[] n1N2N3 = scanner.nextLine().split(" ");
+        int n1 = Integer.parseInt(n1N2N3[0].trim());
+        int n2 = Integer.parseInt(n1N2N3[1].trim());
+        int n3 = Integer.parseInt(n1N2N3[2].trim());
+
+        int[] h1 = new int[n1];
+        String[] h1Items = scanner.nextLine().split(" ");
+        for (int h1Itr = 0; h1Itr < n1; h1Itr++) {
+            int h1Item = Integer.parseInt(h1Items[h1Itr].trim());
+            h1[h1Itr] = h1Item;
+        }
+
+        int[] h2 = new int[n2];
+        String[] h2Items = scanner.nextLine().split(" ");
+        for (int h2Itr = 0; h2Itr < n2; h2Itr++) {
+            int h2Item = Integer.parseInt(h2Items[h2Itr].trim());
+            h2[h2Itr] = h2Item;
+        }
+
+        int[] h3 = new int[n3];
+        String[] h3Items = scanner.nextLine().split(" ");
+        for (int h3Itr = 0; h3Itr < n3; h3Itr++) {
+            int h3Item = Integer.parseInt(h3Items[h3Itr].trim());
+            h3[h3Itr] = h3Item;
+        }
+
+        int result = equalStacks(h1, h2, h3);
+        System.out.println(result);
+    }
+}