## Iterative Machine Teaching

This is a random discussion surrounding the ICML 2017 paper Iterative Machine Teaching.

See also all posts ordered by categories.

This is a random discussion surrounding the ICML 2017 paper Iterative Machine Teaching.

Compute for every integer n between 0 and N (excluded), the minimum number of operations to reduce it to zero. Allowed operations: decrease by 1 or divide by a factor, not larger than its square root.

Given a collection of sets over some ground set, find an order on the ground set such that every set consists of consecutive (contiguous) elements.

Given n points in the 2-dimensional plane find a strip with minimal width that covers all the points.

In this article, I talk about this problem (of HackerRank). Try to solve it first!

Given n integers and a target value form an arithmetic expression evaluating to the target value.

Explanation for the problem mission improbable from the ACM final in 2017. Read the problem statement first.