JobsJob TrackerJob alerts

Jupiter Money ยท 9 questions

All 9Coding 8
  • Longest path / diameter in a graph and topological sortingCoding
  • Wave Sort an arrayCoding
  • Most frequently occurring word in a text file and hash collisionsCoding
  • Find the Nth highest salary of an employeeCoding
  • Peak finding variationCoding
  • OS paging, memory management, and URL request flow via OSI model
  • Parallel SumsCoding
  • Two SumCoding
  • Matrix Diagonals and Spiral MatrixCoding
โ† Jupiter Money questions
  1. Interview questions
  2. Jupiter Money
  3. Parallel Sums
Coding

Parallel Sums

Filed under Jupiter Money

The question

Split an array into two sets with equal sums. If impossible, return -1. Otherwise, return the sets as a comma-separated string, sorted, with the set having the smaller first element appearing first.

No write-up yet. Related questions below have one.

Related Jupiter Money questions

  • Longest path / diameter in a graph and topological sorting
  • Wave Sort an array
  • Most frequently occurring word in a text file and hash collisions
  • Find the Nth highest salary of an employee
  • Peak finding variation
โ† OS paging, memory management, and URL request flow via OSI modelTwo Sum โ†’

Collected from public candidate posts and coding forums. Updated Nov 2026.