Remove duplicate solution of SumOfTwo task

Author: andrei-punko

src/main/java/by/andd3dfx/numeric/SumOfTwoInArray.java

@@ -4,11 +4,28 @@
 import java.util.Map;
 
 /**
- * Find in array of integers two items which have sum equals to definite number.
+ * <pre>
+ * <a href="https://leetcode.com/problems/two-sum/">Task description</a>
+ *
+ * Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.
+ * You may assume that each input would have exactly one solution, and you may not use the same element twice.
+ * You can return the answer in any order.
+ *
+ * Example 1:
+ * Input: nums = [2,7,11,15], target = 9
+ * Output: [0,1]
+ * Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
+ *
+ * Example 2:
+ * Input: nums = [3,2,4], target = 6
+ * Output: [1,2]
+ *
+ * Example 3:
+ * Input: nums = [3,3], target = 6
+ * Output: [0,1]
+ *
  * Try to solve task using algorithm with O(n) complexity.
- * <p>
- * Есть массив целых чисел и число K.
- * Найти два таких (не обязательно различных) числа в массиве, сумма которых равна K, либо вывести, что такого нет.
+ * </pre>
  *
  * @see <a href="https://youtu.be/CrQdpjsr26w">Video solution</a>
  */

src/main/java/by/andd3dfx/search/FindSumOfTwoInArray.java

@@ -1,9 +1,9 @@
 package by.andd3dfx.search;
 
-import org.junit.Test;
-
 import static org.assertj.core.api.Assertions.assertThat;
 
+import org.junit.Test;
+
 public class FindSumOfTwoInArrayTest {
 
     @Test
@@ -25,4 +25,64 @@ public void find_On() {
         assertThat(FindSumOfTwoInArray.find_On(new int[]{1, 4, 7, 2, 90}, 19))
             .isNull();
     }
+
+    /// Cases from deleted implementation copy
+
+    @Test
+    public void testFind_ON() {
+        var result = FindSumOfTwoInArray.find_On(new int[]{1, 3, 5, 7, 9}, 12);
+
+        assertThat(result).satisfiesAnyOf(
+            items -> assertThat(items).isEqualTo(new int[]{1, 4}),
+            items -> assertThat(items).isEqualTo(new int[]{2, 3}),
+            items -> assertThat(items).isEqualTo(new int[]{3, 2}),
+            items -> assertThat(items).isEqualTo(new int[]{4, 1})
+        );
+    }
+
+    @Test
+    public void testFind_ON2() {
+        var result = FindSumOfTwoInArray.find_On2(new int[]{1, 3, 5, 7, 9}, 12);
+
+        assertThat(result).satisfiesAnyOf(
+            items -> assertThat(items).isEqualTo(new int[]{1, 4}),
+            items -> assertThat(items).isEqualTo(new int[]{2, 3}),
+            items -> assertThat(items).isEqualTo(new int[]{3, 2}),
+            items -> assertThat(items).isEqualTo(new int[]{4, 1})
+        );
+    }
+
+    @Test
+    public void testFind_ONForSameNumbers() {
+        var result = FindSumOfTwoInArray.find_On(new int[]{1, 1, 6, 6, 1}, 12);
+
+        assertThat(result).satisfiesAnyOf(
+            items -> assertThat(items).isEqualTo(new int[]{2, 3}),
+            items -> assertThat(items).isEqualTo(new int[]{3, 2})
+        );
+    }
+
+    @Test
+    public void testFind_ON2ForSameNumbers() {
+        var result = FindSumOfTwoInArray.find_On2(new int[]{1, 1, 6, 6, 1}, 12);
+
+        assertThat(result).satisfiesAnyOf(
+            items -> assertThat(items).isEqualTo(new int[]{2, 3}),
+            items -> assertThat(items).isEqualTo(new int[]{3, 2})
+        );
+    }
+
+    @Test
+    public void testFind_ONForAbsentSolution() {
+        var result = FindSumOfTwoInArray.find_On(new int[]{1, 1, 6, 3, 1}, 12);
+
+        assertThat(result).isNull();
+    }
+
+    @Test
+    public void testFind_ON2ForAbsentSolution() {
+        var result = FindSumOfTwoInArray.find_On2(new int[]{1, 1, 6, 3, 1}, 12);
+
+        assertThat(result).isNull();
+    }
 }