Good morning! Here's your coding interview problem for today.
This problem was asked by Facebook.
Given an array of numbers of length N, find both the minimum and maximum using less than 2 * (N - 2) comparisons.
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||
Good morning! Here's your coding interview problem for today.
This problem was asked by Facebook.
Given an array of numbers of length N, find both the minimum and maximum using less than 2 * (N - 2) comparisons.