Brilliant

Practice

Algebra
Geometry
Number Theory
Calculus
Discrete Mathematics
Basic Mathematics
Logic
Classical Mechanics
Electricity and Magnetism
Computer Science
Quantitative Finance
Chemistry

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 5 million people

Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.

Log in with Facebook Log in with Google

or

Log in with email

Join using Facebook Join using Google

or

Join using email

New user? Sign up

Existing user? Sign in

The fastest way to solve this

Computer Science Level 3

Given an array \(S\) which is a sorted array of integers.

What is the fastest running time to find the maximum \(x-y\) where \(x, y \in S\)

\[O(\log n)\] \[O(n\log n)\] \[O(1)\] \[O(n)\]

View solutions

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 5 million people

Learn from a vibrant community of students and enthusiasts,
including olympiad champions, researchers, and professionals.

Your answer seems reasonable. Find out if you're right!

Sign up to access problem solutions.

That seems reasonable. Find out if you're right!

Log in with Facebook Log in with Google

or

Log in with email

Join using Facebook Join using Google

or

Join using email

New user? Sign up

Existing user? Sign in

by Daniel Lim

×

Problem Loading...

Note Loading...

Set Loading...