All challenges
Easy 0 solved 0% acceptance

Remove Gray From RGB

Remove the gray part of an RGB color by subtracting the smallest channel from all three.

What you'll learn

  • Validate that each channel is in range
  • Find the smallest of three values
  • Return several values as a list

Problem

Every RGB color can be split into a gray part, where red, green and blue are equal, and the pure color that is left over. The gray part is as large as the smallest of the three values, so subtracting that smallest value from each channel leaves the color with its gray removed. For example (130, 50, 130) has a gray part of 50 and becomes (80, 0, 80).

Implement remove_gray_rgb(red, green, blue).

Input

red: The red value.

green: The green value.

blue: The blue value.

Output

Return [red, green, blue] after subtracting the smallest of the three from each. A channel is valid from 0 to 255; if any value is outside that range, return an empty list.

Constraints

−1000 ≤ red, green, blue ≤ 1000

Examples

Example 1
Input:
red = 200
green = 120
blue = 75

Expected output:
expected = [125, 45, 0]
Input:
long long red = 200;
long long green = 120;
long long blue = 75;

Expected output:
std::vector<long long> expected = {125, 45, 0};
Input:
long red = 200;
long green = 120;
long blue = 75;

Expected output:
long[] expected = new long[] {125, 45, 0};

Explanation

The smallest value is 75, so the result is [125, 45, 0].

Example 2
Input:
red = 90
green = 90
blue = 90

Expected output:
expected = [0, 0, 0]
Input:
long long red = 90;
long long green = 90;
long long blue = 90;

Expected output:
std::vector<long long> expected = {0, 0, 0};
Input:
long red = 90;
long green = 90;
long blue = 90;

Expected output:
long[] expected = new long[] {0, 0, 0};

Explanation

A pure gray color loses everything: [0, 0, 0].

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Check the range of all three values before doing any math.

Hint 2

The gray part is the smallest of the three channels.

Hint 3

Subtract that same amount from each channel.

Expected complexity

O(1) time, O(1) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.