Categorize Box According to Criteria

Categorize Box According to Criteria - Problem

Math Easy

Given four integers length, width, height, and mass, representing the dimensions and mass of a box, respectively, return a string representing the category of the box.

The box is "Bulky" if:

Any of the dimensions of the box is greater or equal to 10⁴.
Or, the volume of the box is greater or equal to 10⁹.

If the mass of the box is greater or equal to 100, it is "Heavy".

If the box is both "Bulky" and "Heavy", then its category is "Both".

If the box is neither "Bulky" nor "Heavy", then its category is "Neither".

If the box is "Bulky" but not "Heavy", then its category is "Bulky".

If the box is "Heavy" but not "Bulky", then its category is "Heavy".

Note that the volume of the box is the product of its length, width and height.

Input & Output

Example 1 — Heavy Box

$ Input: length = 1000, width = 35, height = 700, mass = 300

› Output: Heavy

💡 Note: Volume = 1000 × 35 × 700 = 24,500,000 < 10⁹, all dimensions < 10⁴, so not bulky. Mass = 300 ≥ 100, so heavy. Result: Heavy.

Example 2 — Bulky Box

$ Input: length = 200, width = 50, height = 800, mass = 50

› Output: Neither

💡 Note: Volume = 200 × 50 × 800 = 8,000,000 < 10⁹, all dimensions < 10⁴, so not bulky. Mass = 50 < 100, so not heavy. Result: Neither.

Example 3 — Both Bulky and Heavy

$ Input: length = 10000, width = 20, height = 30, mass = 150

› Output: Both

💡 Note: Length = 10000 ≥ 10⁴, so bulky. Mass = 150 ≥ 100, so heavy. Both conditions met. Result: Both.

Constraints

1 ≤ length, width, height ≤ 10⁵
1 ≤ mass ≤ 10³

Visualization

Tap to expand

Asked in

a Amazon 15 G Google 12

This problem requires conditional logic to categorize boxes based on size and weight criteria. The key insight is to use boolean flags to track bulky (dimension ≥ 10⁴ OR volume ≥ 10⁹) and heavy (mass ≥ 100) conditions, then apply simple if-else logic. Best approach uses optimized boolean evaluation. Time: O(1), Space: O(1)

Common Approaches

✓ Direct Condition Checking

⏱️ Time: O(1) Space: O(1)

Calculate volume, check if any dimension >= 10^4 or volume >= 10^9 for bulky status, check if mass >= 100 for heavy status, then return the appropriate category based on these boolean conditions.

Optimized Boolean Logic

⏱️ Time: O(1) Space: O(1)

Similar approach but with optimized boolean evaluation and cleaner conditional structure. We can potentially short-circuit some calculations for better performance in edge cases.

Direct Condition Checking — Algorithm Steps

Step 1: Calculate volume = length × width × height
Step 2: Check if bulky (any dimension >= 10^4 OR volume >= 10^9)
Step 3: Check if heavy (mass >= 100)
Step 4: Return category based on bulky and heavy flags

Visualization

Tap to expand

Step-by-Step Walkthrough

Input

Read box dimensions and mass

Check Conditions

Evaluate bulky and heavy criteria

Categorize

Return appropriate category string

Code -

solution.c — C

#include <stdio.h>
#include <string.h>

char* solution(int length, int width, int height, int mass) {
    // Calculate volume
    long long volume = (long long)length * width * height;
    
    // Check if bulky
    int isBulky = (length >= 10000 || width >= 10000 || height >= 10000 || volume >= 1000000000LL);
    
    // Check if heavy
    int isHeavy = (mass >= 100);
    
    // Return appropriate category
    if (isBulky && isHeavy) {
        return "Both";
    } else if (isBulky && !isHeavy) {
        return "Bulky";
    } else if (isHeavy && !isBulky) {
        return "Heavy";
    } else {
        return "Neither";
    }
}

int main() {
    int length, width, height, mass;
    scanf("%d", &length);
    scanf("%d", &width);
    scanf("%d", &height);
    scanf("%d", &mass);
    
    char* result = solution(length, width, height, mass);
    printf("%s\n", result);
    
    return 0;
}

Time & Space Complexity

Time Complexity

⏱️

O(1)

Fixed number of arithmetic operations and comparisons

✓ Linear Growth

Space Complexity

O(1)

Only uses a few boolean variables

✓ Linear Space

18.5K Views

Medium Frequency

~5 min Avg. Time

842 Likes

Ln 1, Col 1

Smart Actions

💡 Explanation

AI Ready

💡 Suggestion Tab to accept Esc to dismiss

// Output will appear here after running code

Code Editor Closed

Click the red button to reopen

Input & Output

Constraints

Visualization

Related Problems

Common Approaches

Direct Condition Checking — Algorithm Steps

Visualization

Code -

Time & Space Complexity

Select Compiler