Merge pull request neetcode-gh#1912 from NikSWE/scala-sln

Add new scala solutions

Author: tahsintunan

scala/0011-container-with-most-water.scala

@@ -0,0 +1,28 @@
+// Time Complexity: O(n)
+// Space Complexity: O(1)
+
+object Solution {
+  def maxArea(height: Array[Int]): Int = {
+    var maxWater = 0
+    var left = 0
+    var right = height.length - 1
+
+    while (left < right) {
+      var minHeight = height(left).min(height(right))
+      var dist = right - left
+      var capacity = minHeight * dist
+      if (capacity > maxWater) {
+        maxWater = capacity
+      }
+
+      if (height(left) < height(right)){
+        left += 1
+      }
+      else {
+        right -= 1
+      }
+    }
+
+    return maxWater
+  }
+}

scala/0242-valid-anagram.scala

@@ -0,0 +1,33 @@
+// Time Complexity: O(s + t)
+// Space Comeplexity: O(s + t)
+
+import scala.collection.mutable.Map
+
+object Solution {
+  def isAnagram(s: String, t: String): Boolean = {
+    if (s.length() != t.length())
+      return false
+
+    var charCount = Map[Char, Int]()
+
+    for (c <- s) {
+      if (charCount.contains(c))
+        charCount(c) = charCount(c) + 1
+      else
+        charCount += (c -> 1)
+    }
+
+    for (c <- t) {
+      if (charCount.contains(c))
+        charCount(c) = charCount(c) - 1
+      else
+        charCount += (c -> 1)
+    }
+
+    for ((_, v) <- charCount)
+      if (v != 0)
+        return false
+
+    return true
+  }
+}