Robinhood OA (2025) | Crypto Volatility Window & Fractional Share Rebalancing

Problem 1 - Crypto Volatility Window Problem Statement You are given an integer array prices representing the price of a cryptocurrency recorded every minute and an integer limit. A timeframe (contiguous subarray) is considered stable if: |max(prices in timeframe) − min(prices in timeframe)| ≤ limit Return the length of the longest stable timeframe. Constraints Constraint 1 ≤ prices.length ≤ 100000 1 ≤ prices[i] ≤ 109 0 ≤ limit ≤ 109 Test Case Input Output prices = [8, 2, 4, 7] ...