Daily Coding Problem | Day 1110 | Pythagorean triplet

devstromo · devstromo · commit 21c145ca73da · 2025-04-22T22:16:41.000-03:00
diff --git a/daily-coding-problem/src/main/java/com/devstromo/day1110/DESCRIPTION.md b/daily-coding-problem/src/main/java/com/devstromo/day1110/DESCRIPTION.md
@@ -0,0 +1,6 @@
+Good morning! Here's your coding interview problem for today.
+
+This problem was asked by Netflix.
+
+Given an array of integers, determine whether it contains a Pythagorean triplet. Recall that a Pythogorean triplet `(a,
+b, c)` is defined by the equation `a^2`+ `b^2`= `c^2`.
diff --git a/daily-coding-problem/src/main/java/com/devstromo/day1110/Problem.java b/daily-coding-problem/src/main/java/com/devstromo/day1110/Problem.java
@@ -0,0 +1,25 @@
+package com.devstromo.day1110;
+
+public class Problem {
+    public boolean solve(int[] nums) {
+        for (int i = 0; i < nums.length - 2; i++) {
+            if (nums[i] == 0) continue;
+            for (int j = i + 1; j < nums.length - 1; j++) {
+                if (nums[j] == 0) continue;
+                for (int k = j + 1; k < nums.length; k++) {
+                    if (nums[k] == 0) continue;
+                    if (nums[i] * nums[i] + nums[j] * nums[j] == nums[k] * nums[k]) {
+                        return true;
+                    }
+                    if (nums[i] * nums[i] + nums[k] * nums[k] == nums[j] * nums[j]) {
+                        return true;
+                    }
+                    if (nums[k] * nums[k] + nums[j] * nums[j] == nums[i] * nums[i]) {
+                        return true;
+                    }
+                }
+            }
+        }
+        return false;
+    }
+}
diff --git a/daily-coding-problem/src/test/java/com/devstromo/day1110/ProblemUnitTest.java b/daily-coding-problem/src/test/java/com/devstromo/day1110/ProblemUnitTest.java
@@ -0,0 +1,61 @@
+package com.devstromo.day1110;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+class ProblemUnitTest {
+    private final Problem problem = new Problem();
+
+    @Test
+    void testSimpleTriplet() {
+        assertTrue(problem.solve(new int[]{3, 4, 5}));
+    }
+
+    @Test
+    void testMultipleTriplets() {
+        assertTrue(problem.solve(new int[]{10, 4, 6, 8, 5}));
+    }
+
+    @Test
+    void testNoTriplet() {
+        assertFalse(problem.solve(new int[]{1, 2, 3}));
+    }
+
+    @Test
+    void testEmptyArray() {
+        assertFalse(problem.solve(new int[]{}));
+    }
+
+    @Test
+    void testSingleElement() {
+        assertFalse(problem.solve(new int[]{5}));
+    }
+
+    @Test
+    void testOnlyTwoElements() {
+        assertFalse(problem.solve(new int[]{5, 12}));
+    }
+
+    @Test
+    void testWithDuplicates() {
+        assertTrue(problem.solve(new int[]{5, 5, 3, 4}));
+    }
+
+    @Test
+    void testWithZeros() {
+        assertFalse(problem.solve(new int[]{0, 0, 0}));
+    }
+
+    @Test
+    void testNegativeNumbers() {
+        assertTrue(problem.solve(new int[]{-3, 4, 5}));
+        assertTrue(problem.solve(new int[]{3, -4, 5}));
+        assertTrue(problem.solve(new int[]{3, 4, -5}));
+    }
+
+    @Test
+    void testLargeTriplet() {
+        assertTrue(problem.solve(new int[]{9, 40, 41}));
+    }
+}
