diff --git a/cediackermann/challenges/twoSum/BUILD b/cediackermann/challenges/twoSum/BUILD
new file mode 100644
index 0000000..7efc394
--- /dev/null
+++ b/cediackermann/challenges/twoSum/BUILD
@@ -0,0 +1,11 @@
+load("@rules_java//java:defs.bzl", "java_binary")
+
+package(default_visibility = ["//visibility:public"])
+
+java_binary(
+    name = "twoSum",
+    main_class = "cediackermann.challenges.twoSum.Main",
+    srcs = glob(["*.java"]),
+    deps = [
+    ],
+)
diff --git a/cediackermann/challenges/twoSum/Main.java b/cediackermann/challenges/twoSum/Main.java
new file mode 100644
index 0000000..73905e7
--- /dev/null
+++ b/cediackermann/challenges/twoSum/Main.java
@@ -0,0 +1,12 @@
+package cediackermann.challenges.twoSum;
+
+public class Main {
+    public static void main(String[] args) {
+        Solution sol = new Solution();
+        int[] nums = new int[] { 10, 20, 30, 17, 4 };
+        int[] solution = sol.getSolution(nums, 14);
+        for (int i : solution) {
+            System.out.println(i);
+        }
+    }
+}
diff --git a/cediackermann/challenges/twoSum/Solution.java b/cediackermann/challenges/twoSum/Solution.java
new file mode 100644
index 0000000..f2ef144
--- /dev/null
+++ b/cediackermann/challenges/twoSum/Solution.java
@@ -0,0 +1,14 @@
+package cediackermann.challenges.twoSum;
+
+public class Solution {
+    public int[] getSolution(int[] nums, int target) {
+        for (int i = 0; i <= nums.length; i++) {
+            for (int j = i + 1; j <= nums.length; j++) {
+                if (nums[i] + nums[j] == target) {
+                    return new int[] { i, j };
+                }
+            }
+        }
+        return new int[0];
+    }
+}