JavaEasyArrays10 min

Find the minimum and maximum in an array

Print the minimum and maximum separated by a space. Follow the stated ordering and edge-case conventions exactly. Interviewers use this task to probe algorithm selection, invariants, and boundary handling.

Input

n followed by n integers.

Output

Print the minimum and maximum separated by a space.

Constraints

1 <= n <= 100000; values between -1000000000 and 1000000000.

Example

Input

5 3 -2 9 9 0

Output

-2 9

Example 2 input

2 0 1

Output

0 1

This example exercises a further boundary or ordering case.

Public test cases (2)

Input
```
5 3 -2 9 9 0
```
Expected output
```
-2 9
```
Input
```
1 7
```
Expected output
```
7 7
```

Hints (2)

Identify the state needed to avoid recomputing work for each element.
Maintain the smallest and largest values in a single streaming pass.

Target complexity: time O(n) · space O(1)

Your solution

import java.util.*;
import java.math.BigInteger;

public class Main {
    
    static String array_min_max(Scanner s) {
        while (s.hasNextLine()) s.nextLine();
        // your code
        return "";
    }
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        System.out.println(array_min_max(s));
    }
}

Standard input

Checking runner availability…

Reference solution

Anagram check · Easy
Check for an Armstrong number · Easy
Check whether a number is a palindrome · Easy
Check whether an integer is prime · Easy
Compute a factorial with BigInteger · Easy
Count vowels and consonants · Easy
Find the first occurrence with binary search · Easy
Find the GCD and LCM · Easy
Generate the Fibonacci series · Easy
Palindrome check ignoring case and spaces · Easy

All Java programs

Find the minimum and maximum in an array

Input

Output

Constraints

Example

Public test cases (2)

Your solution

Reference solution

More Java programs