CodingReported in a candidate post, Nov 2018
Minimum Steps in String with Obstacles and Prime Conditions
Filed under Delhivery
The question
Given a string of '*' and '#' and variables r1, r2, find the minimum steps from the first index to the last without landing on '*', moving by +1, +2, or +A where A is the count of primes up to i satisfying (A/i) >= (r1/r2).
No write-up yet. Related questions below have one.
Related Delhivery questions
Collected from public candidate posts and coding forums. Updated Nov 2026.