Day 31EasySmart Interviews (Hive)

Number Distribution

Counting + Conditionals

Solve on Smart Interviews View notes on GitHub

Problem

Problem Statement

Given N numbers, count how many are positive, how many are negative, and how many are zero.

Input / Output

Input:
  Line 1: Integer N — count of numbers
  Line 2: N space-separated integers

Output:
  Three integers on separate lines:
    count of positives
    count of negatives
    count of zeros

Example:
  Input:  6
          3 -1 0 7 -4 0
  Output: 2
          2
          2

Constraints

1 ≤ N ≤ 10^5
-10^9 ≤ arr[i] ≤ 10^9

Understanding the Problem

Walk through every number once
Bucket each number into one of three categories: positive, negative, or zero
Three counters, one loop — that's the entire solution

Edge Cases

All zeros → pos=0, neg=0, zero=N
All positive → neg=0, zero=0
All negative → pos=0, zero=0
Single element → still works fine

Solve it yourself before you look

Reading the solution first feels like progress, but it makes the next similar problem — and the interview version — much harder, because you skipped the part where you figure it out. Give it an honest 20–30 minutes. Stuck? Re-read the pattern, watch the concept video, or try the brute force first.

Hidden: approach · solution code