CodingReported in a candidate post, Feb 2021
Search in Rotated Sorted Array & Modified Dice Problem
Filed under Infoedge
The question
Given a sorted array rotated some number of times, search for a target number using modified binary search. Also, solve a modified version of the dice problem where you must reach a distance of x in exactly n moves, with each move allowing a distance between 1 and m.
No write-up yet. Related questions below have one.
Related Infoedge questions
Collected from public candidate posts and coding forums. Updated Nov 2026.