Skip to main content
ratans6128
ratans6128
May 19, 2023
Solved

TWO SUM

  • May 19, 2023
  • 3 replies
  • 0 views

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].
    Best answer by srishtij2061

    a!localVariables(
  local!num: { 2, 7, 11, 15 },
  local!target:9,
  local!n: {a!forEach(
    items: local!num,
    expression: fv!item + a!forEach(
      items: union(local!num, fv!item),
      expression: fv!item
    )
  )},
  local!loop: a!forEach(items: local!n,
  expression: wherecontains(local!target,tointeger(fv!item))
  ),
  touniformstring(local!loop)
)

    3 replies

    stefanhelzle0001
    stefanhelzle0001
    Brainy
    May 19, 2023

    Nice challenge. Do you have any specific question?

      S
      srishtij2061Answer
      May 19, 2023

      a!localVariables(
  local!num: { 2, 7, 11, 15 },
  local!target:9,
  local!n: {a!forEach(
    items: local!num,
    expression: fv!item + a!forEach(
      items: union(local!num, fv!item),
      expression: fv!item
    )
  )},
  local!loop: a!forEach(items: local!n,
  expression: wherecontains(local!target,tointeger(fv!item))
  ),
  touniformstring(local!loop)
)

        davel001150
        davel001150
        May 19, 2023

        a!localVariables(
  local!numbs: {2,7,11,15},
  local!target: 9,
  reject(
    a!isNullOrEmpty(_),
    a!forEach(
      items: local!numbs,
      expression: if(
        fv!item > local!target,
        null,
        wherecontains(local!target - fv!item, local!numbs)
      )
    )
  )
)

        It works aside from Appian arrays index starting at 1.  Uses only 1 forEach loop, and should be able to handle multiple correct answers.  15 lines just like the other. =/

          Terms & ConditionsAccessibility statement