⌘K
Flycodx

Stable Gold Rate Window

Stable Gold Rate Window

HardArrays100% accepted

Priya manages gold loans in Bangalore. She needs to identify continuous periods where gold price doesn't fluctuate more than X% to offer stable loan rates to bulk applicants.

Approach

Given an array of daily gold prices, find the longest subarray where the difference between max and min price is at most K.

Input

prices=[100,102,101,103,150] K=5

Output

4
solution.py
Loading editor...
Test 1
Test 2
Test 3

Press Run to test your custom input, or Submit to judge against all test cases.

Sign in to continue

Create a free account to run code, submit solutions and track progress.

  • Free forever — no credit card
  • 10+ languages with live execution
  • Points, streaks & leaderboards
Auto Save OnLn 1, Col 1Spaces: 4UTF-8LFPython 3