Improved task 1

Author: javadev

build.sbt

@@ -3,7 +3,7 @@ import Dependencies._
 lazy val root = (project in file(".")).
   settings(
     inThisBuild(List(
-      scalaVersion := "2.13.8",
+      scalaVersion := "3.3.1",
       version      := "1.0"
     )),
     name := "leetcode-in-scala",

src/main/scala/g0001_0100/s0001_two_sum/Solution.scala

@@ -2,18 +2,19 @@ package g0001_0100.s0001_two_sum
 
 // #Easy #Top_100_Liked_Questions #Top_Interview_Questions #Array #Hash_Table
 // #Data_Structure_I_Day_2_Array #Level_1_Day_13_Hashmap #Udemy_Arrays #Big_O_Time_O(n)_Space_O(n)
-// #2023_10_08_Time_517_ms_(86.66%)_Space_56.2_MB_(68.04%)
+// #2024_05_15_Time_680_ms_(76.33%)_Space_59.5_MB_(64.20%)
 
 object Solution {
     def twoSum(nums: Array[Int], target: Int): Array[Int] = {
-        val lookup = scala.collection.mutable.Map[Int, Int]()
-        for (idx <- nums.indices) {
-            if (lookup.contains(target - nums(idx))) {
-                return Array(lookup(target - nums(idx)), idx)
-            } else {
-                lookup.addOne(nums(idx) -> idx)
-            }
+        val indiced = nums.zipWithIndex
+        val sortedStruct = indiced.sortBy(_._1)
+        var i = 0
+        var j = nums.length - 1
+        while (i < j && j > 0) {
+            if sortedStruct(j)._1 + sortedStruct(i)._1 > target then j = j - 1
+            else if sortedStruct(j)._1 + sortedStruct(i)._1 < target then i = i + 1
+            else return Array(sortedStruct(i)._2, sortedStruct(j)._2)
         }
-        Array(-1, -1)
+        return Array(-1, -1)
     }
 }

src/test/scala/g0101_0200/s0102_binary_tree_level_order_traversal/SolutionSpec.scala

@@ -7,15 +7,15 @@ import org.scalatest.matchers.should.Matchers
 class SolutionSpec extends AnyFunSuite with Matchers {
     test("levelOrder") {
         val root = TreeUtils.constructBinaryTree(List(3, 9, 20, null, null, 15, 7))
-        Solution.levelOrder(root) shouldBe Array(Array(3), Array(9, 20), Array(15, 7))
+        Solution.levelOrder(root) shouldBe List(List(3), List(9, 20), List(15, 7))
     }
 
     test("levelOrder2") {
         val root = TreeUtils.constructBinaryTree(List(1))
-        Solution.levelOrder(root) shouldBe Array(Array(1))
+        Solution.levelOrder(root) shouldBe List(List(1))
     }
 
     test("levelOrder3") {
-        Solution.levelOrder(null) shouldBe Array.empty
+        Solution.levelOrder(null) shouldBe List.empty
     }
 }