Take this array:
[1, 2, 6, 4, 4, 1, 0, 0, 2, 0, 4, 1, 4, 2, 4, 8, 1, 2, 4]
There are quite a few places where [1, ..., 2, ..., 4] appears, where ... is any number of items. These include [1, 2, 6, 4], [1, 0, 0, 2, 0, 4], [1, 0, 0, 2, 0, 4, 1, 4], and [1, 2, 4]. The shortest of these is simply [...
Given a positive number \$n\$ you have to find \$\bf another\$ positive number \$m\$(if there exist one) such that if we insert same digits in both n and m the resulting fractional value is same
$$m/n = m_{transformed}/n_{transformed}$$
$$or$$
$$m*n_{transformed} = m_{transformed}*n$$
their might...
Inspired by this Numberphile video.
What is planing?
In order to 'plane' a sequence of digits, you need to:
Identify the lengths of the 'runs' (adjacently repeated digits) in the sequence. Non-repeated digits count as runs of one.
Decrease the length of each run by one. Runs of length 1 become ...
Losing capital of a chemical formula, it may become ambigious: co can be both CO or Co.
Given an input consisting of a-z0-9, where 0 can only stand behind 0-9. Check whether it's ambigious, unambigious, or impossible. Return 3 different values for them. Shortest code win.
Examples:
co - ambig...
