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 EXERCISES:

Exercise 9

Bitwise operations (bit-ops)

Exercise 8

Frontend

Exercise 7

Data Structures

Exercise 6

SQL

Exercise 5

Coding skills

Exercise 4

Algorithmic skills

Exercise 3

2017 Contest

Exercise 2

2016 Contest

Exercise 1

2015 Contest

Exercise 2

medium

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

hard

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

hard

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

hard

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