Check Whether a Cyclic Shift Can Make the Array Strictly Descending

Asked at Capital One · Coding Questions · Difficulty: Medium

Given an integer array `nums` of length `n` and an integer `t` \( `0 <= t < n` \). Define one cyclic shift as moving the last `t` elements of the array to the front (i.e., a right rotation by `t`).

Loading the problem…