## Path Statistics

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

See also all posts ordered by categories.

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.

Maintain a numerical table `tab`

that implements the following operations in logarithmic time: for a range of table indices, query the maximum value, query the minimum value, query the sum, set all entries of that range to some value, add some value to all entries of that range.

Given a grid containing some segments, find the minimum number of times segments need to be displaced such that a particular segment can escape from the grid.

Given a boolean formula consisting of Horn clauses, set a minimal number of variables to *True* in order to satisfy all clauses.

Given a 2 player impartial game, decide for a given configuration if there is a possibility for the first player to win assuming the second player plays perfectly.