Count the distinct rectangle sizes, of area greater than or equal to X, that can be built out of a given set of segments.

Your browser (Unknown 0) is no longer supported. Some parts of the website may not work correctly. Please update your browser.

AVAILABLE LESSONS:

Lesson 1

Iterations

Lesson 2

Arrays

Lesson 3

Time Complexity

Lesson 4

Counting Elements

Lesson 5

Prefix Sums

Lesson 6

Sorting

Lesson 7

Stacks and Queues

Lesson 8

Leader

Lesson 9

Maximum slice problem

Lesson 10

Prime and composite numbers

Lesson 11

Sieve of Eratosthenes

Lesson 12

Euclidean algorithm

Lesson 13

Fibonacci numbers

Lesson 14

Binary search algorithm

Lesson 15

Caterpillar method

Lesson 16

Greedy algorithms

Lesson 17

Dynamic programming

Lesson 90

Tasks from Indeed Prime 2015 challenge

Lesson 91

Tasks from Indeed Prime 2016 challenge

Lesson 92

Tasks from Indeed Prime 2016 College Coders challenge

Lesson 99

Future training

Lesson 91

respectable

Count the distinct rectangle sizes, of area greater than or equal to X, that can be built out of a given set of segments.

ambitious

Remove at most two edges from a tree graph to maximize the product of the components' sizes.

ambitious

Find out how many dwarfs can fit on a raft such that it's balanced when crossing a river.

ambitious

Find the shortest path between two fields in a Hilbert maze.