Shortest source to destination path and array number formation using operations
Filed under OYO
The question
Find the minimum distance in a maze (shortest source to destination path) and find the count of numbers in an array that can be formed from a given number d by adding or subtracting a or b any number of times.
No write-up yet. Related questions below have one.
Related OYO questions
Collected from public candidate posts and coding forums. Updated Nov 2026.