Algorithms

K-Deletion Smallest String

Difficulty

Asked at D.E. Shaw

Theory: Algorithms Under a Complexity Bound

Read the problem, hints and solution here. The editor needs a bigger screen: open this page on a laptop to write and run your code.

x xxxxxxxxx xxxxxxx xxxxxxx xxxx xxxxxxxxxx x xxxxx xxxxxxxx xxxx, xxxxx xx xxxxxxxx x xxxxxx xxxxxxxxxx: xxxxxxx x xxxxxxxxxx xxxx xx xxxxxxx, xxx xxxxx xxx xxxx xx xx xx xxx xxxxxxx xxxxx xxx xxxxxxxxxxxxxxxxx xxxxxxxx xxxxxx, xxxxxxx xxxxxxxx-xxxx xx x xxxxxxxxxxxxx xxxx xxxxx xxxxxxxxxx xxxxxx xxx xxxxxxxxx xxxxxxxxxxxxx.

xxxxxxxxx xxxxxxxx_xxxxx_xxxxxxxxx(x, x) xxxxxxxxx xxx xxxxxxxxxxxxxxxxx xxxxxxxx xxxxxx xxxxxxxxxx xx xxxxxxxx xxxxxxx x xxxxxxxxxx xxxx x. xxx xxxxxxxxx xxxxxxxxxx xxxx xxxxx xxxxxxxx xxxxxxxx xxxxx.

xxxxxxxx

xxxxxxxx_xxxxx_xxxxxxxxx("xxxx", x)
# 'xx'  (xxxx 'x' xxx 'x')

xxxxxxxx_xxxxx_xxxxxxxxx("xxxxx", x)
# 'xxx'  (xxx xxxxxx xx xxxxxxx xxxxxx; xxxx xxxx xxx xxxx)

xxxxxxxxxxx

x xxxxxxxx xxxx xxxxxxxxx xxxxxxx x-x; x <= x <= xxx(x), xxx(x) <= xxxxxx. xxxx x == xxx(x) xxx xxxxxx xx xxx xxxxx xxxxxx.
xxx xxxxxx xxxxxx xxx xxxxxxx xxx(x) - x xxxxxxxxxx.
xxxxxxxx xxx xxxx xxxxxxxxx xx x xxxx, x xxxxx xxxx, xx xx (x(xx)) xxxxxxxx xxx xxxx xxx xxxxxx xx xxxx xx xxx xxxxxxx xxxxxx xxxx; xxx xxx x xxxxxx xxxx-xx-xxxxx xxxx.

This problem is only available to subscribers.

Language: Pythonsmallest_after_deletions

def smallest_after_deletions(s, k):
    """..."""
    # ...
    pass

Unlock to runUpgrade

Sample tests

Unlock the problem to run it against the tests.

Next in Quant Dev 50BFS Meets Binary SearchAlgorithms