All challenges
Easy 0 solved 0% acceptance

Smallest of Three

Return the smallest of three integers.

What you'll learn

  • Keep track of the best value so far
  • Compare values with if statements
  • Handle ties and negative numbers

Problem

Three friends compare how many minutes they were late this week and the one who was late the least gets to pick lunch. Given the three numbers, find the smallest. Some values can be equal, and they can be negative (early).

Implement smallest_of_three(a, b, c).

Input

a: The first number.

b: The second number.

c: The third number.

Output

Return the smallest of the three values. If several are equal and smallest, return that value.

Constraints

−10^18 ≤ a, b, c ≤ 10^18

Examples

Example 1
Input:
a = 7
b = 15
c = 3

Expected output:
expected = 3
Input:
long long a = 7;
long long b = 15;
long long c = 3;

Expected output:
long long expected = 3;
Input:
long a = 7;
long b = 15;
long c = 3;

Expected output:
long expected = 3;

Explanation

3 is less than both 7 and 15.

Example 2
Input:
a = -4
b = -4
c = 10

Expected output:
expected = -4
Input:
long long a = -4;
long long b = -4;
long long c = 10;

Expected output:
long long expected = -4;
Input:
long a = -4;
long b = -4;
long c = 10;

Expected output:
long expected = -4;

Explanation

The two −4 values tie for smallest, so the answer is −4.

How to approach it

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

Hint 1

Assume the first number is the smallest.

Hint 2

Compare it with the second and then the third, updating when you find a smaller one.

Hint 3

Use a 64-bit integer type, the values can be very large.

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.