Finding Quadruple Sums

Introduction

Hello there! Get ready as we dive into an intriguing problem that involves list manipulation, combinatorial logic, and some Scala skills . This problem centers around finding combinations in a given list whose sum is equivalent to a specified target value . Are you ready for a challenging endeavor? Great! Let's jump into the world of Scala and number theory.

Task Statement

Here's the task at hand: You have to write a Scala function that accepts a list of distinct integers and a target sum as input. The aim is to identify exactly four numbers in the list that, when summed, equal this target. If there are multiple sets that meet this condition, your function should return any one of them. If no such quadruple exists, the function should return an empty list. Consider this list as an example: List(5, 15, 2, 7, 8, 4) . If your target sum is 24, a four-number set that adds up to this value could be List(5, 7, 4, 8) . The input list will contain at least 4 and at most 1,000 distinct integers. The input integers will be in the range -10^6 to 10^6. The target sum will also be in the range of -10^6 to 10^6. There is a time limit for the solution to evaluate within 3 seconds.

Estimating Program Evaluation Time

O(N^4)

Join the 1M+ learners on CodeSignal

Be a part of our community of 1M+ users who develop and demonstrate their skills on CodeSignal

Solution Building: Step 3

On to the last step! We will now scan all pairs, and for each, we will calculate the difference between the target sum and the pair sum, searching for this difference value in the map. For successful searches, we validate that the elements do not belong to more than one pair. If we find such combinations, we return the four numbers. However, if we traverse all pairs and fail to find a suitable set, we return an empty list.

Scala

import scala.collection.mutable

def findQuadSum(targetSum: Int, numbers: List[Int]): List[Int] = {
  val length = numbers.length
  val sumMap = mutable.Map[Int, List[(Int, Int)]]()

  for (i <- 0 until length - 1) {
    for (j <- i + 1 until length) {
      val pairwiseSum = numbers(i) + numbers(j)
      val pairs = sumMap.getOrElse(pairwiseSum, List())
      sumMap(pairwiseSum) = (i, j) :: pairs
    }
  }

  for (i <- 0 until length - 1) {
    for (j <- i + 1 until length) {
      val total = numbers(i) + numbers(j)
      val diff = targetSum - total
      sumMap.get(diff) match {
        case Some(pairs) =>
          for ((x, y) <- pairs) {
            if (x != i && x != j && y != i && y != j) {
              return List(numbers(i), numbers(j), numbers(x), numbers(y))
            }
          }
        case None => // do nothing
      }
    }
  }
  List()
}

import scala.collection.mutable

def findQuadSum(targetSum: Int, numbers: List[Int]): List[Int] = {
  val length = numbers.length
  val sumMap = mutable.Map[Int, List[(Int, Int)]]()

  for (i <- 0 until length - 1) {
    for (j <- i + 1 until length) {
      val pairwiseSum = numbers(i) + numbers(j)
      val pairs = sumMap.getOrElse(pairwiseSum, List())
      sumMap(pairwiseSum) = (i, j) :: pairs
    }
  }

  for (i <- 0 until length - 1) {
    for (j <- i + 1 until length) {
      val total = numbers(i) + numbers(j)
      val diff = targetSum - total
      sumMap.get(diff) match {
        case Some(pairs) =>
          for ((x, y) <- pairs) {
            if (x != i && x != j && y != i && y != j) {
              return List(numbers(i), numbers(j), numbers(x), numbers(y))
            }
          }
        case None => // do nothing
      }
    }
  }
  List()
}

Note that since the integers in the array are distinct, the list pairs doesn't contain pairs that share the same number, so the loop inside the match statement doesn't do more than two steps.

Introduction

Task Statement

Estimating Program Evaluation Time

Join the 1M+ learners on CodeSignal

Solution Explanation

Solution Building: Step 1

Solution Building: Step 2

Solution Building: Step 3

Lesson Summary