Post History

66%

+2 −0

Challenges Find all unique quintuplets in an array that sum to a given target

Japt, 12 bytes Outputs an empty array if no solution is possible. Íà5 â fÈx ¶V Try it Íà5 â fÈx ¶V :Implicit input of array U & target integer V Í :Sort U à5 ...

posted 2y ago by Shaggy‭

Answer

#1: Initial revision by

Shaggy‭ · 2024-12-14T01:32:46Z (almost 2 years ago)

Copy Link

Raw

Markdown

# [Japt](https://github.com/ETHproductions/japt), 12 [bytes](https://en.wikipedia.org/wiki/ISO/IEC_8859-1)

Outputs an empty array if no solution is possible.

    Íà5 â fÈx ¶V

[Try it](https://petershaggynoble.github.io/Japt-Interpreter/?v=1.4.6&code=zeA1IOIgZsh4ILZW&input=WzEsMCw5LDYsNSwwXQoyMQotUg)

    Íà5 â fÈx ¶V     :Implicit input of array U & target integer V
    Í                :Sort U
     à5              :Combinations of length 5
        â            :Deduplicate
          f          :Filter by
           È         :Passing through the following function
            x        :  Reduce by addition
              ¶V     :  Equal to V?

Communities

Post History