JobsJob TrackerJob alerts

Treebo ยท 20 questions

All 20Coding 13System Design 3
  • Array Partitioning VariationCoding
  • OZ Graph BFSCoding
  • Replace Array Elements without DivisionCoding
  • Minimum Jumps on Infinite ArrayCoding
  • Generate Valid ParenthesesCoding
  • Minimum Range Containing Elements from N ArraysCoding
  • Maximum Sum Path in Binary TreeCoding
  • Design Inshorts News App APISystem Design
  • LRU Cache ImplementationCoding
  • Mean, Median, Mode Statistics Discussion
  • Session Management and Cookies
  • Clock Hands Angle
  • Divide Array into Two Parts with Equal AveragesCoding
  • High-Level System DesignSystem Design
  • Cookies and HTTP Protocol
  • Negative Signs sum to zeroCoding
  • OZ graph traversalCoding
  • Find median from a stream of numbersCoding
  • In-order traversal with modified leaf pointersCoding
  • Database design for a task schedulerSystem Design
โ† Treebo questions
  1. Interview questions
  2. Treebo
  3. Negative Signs sum to zero
Coding

Negative Signs sum to zero

Filed under Treebo

The question

Given a number N, determine if it is possible to get a sum of zero by making half the numbers negative (taking floor of half for odd numbers). Return Yes or No.

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

Related Treebo questions

  • Array Partitioning Variation
  • OZ Graph BFS
  • Replace Array Elements without Division
  • Minimum Jumps on Infinite Array
  • Minimum Range Containing Elements from N Arrays
โ† Cookies and HTTP ProtocolOZ graph traversal โ†’

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