app.pebblelabs.dev{{ routePath }}

NEW PROBLEM SLIDING WINDOW

Given an array nums and a window size k, return the maximum of every contiguous window as it slides left to right.

              example
              nums = [1,3,-1,-3,5,3,6,7], k = 3
              → [3,3,5,5,6,7]
            

HINTS — EACH COSTS 2 MIN

your median on this pattern31 min elapsed12:04

solution.pytests.py

python 3.12

              
                  {{ l.n }}
                  {{ l.text }}

TEST RUN 18 / 20 passing

                  {{ t.mark }}
                  {{ t.name }}
                  {{ t.ms }}
                

Run tests Submit & schedule review

EXPLAIN-BACK · NO CODE 4th review · last seen 12 days ago

PROMPT Explain, in your own words, why binary search still works here — and what you check at each step.

●

01:48 Finish

WHAT A COMPLETE ANSWER COVERS

IF YOU FINISH CLEAN Next review moves from 12 days to 31 days. Miss the duplicates case and it returns in 4.

TUESDAY · YOUR WINDOW 19:00 — 20:00

Start — 60:00

warm-up

new problem · 25 min

review · 17 min

explain · 10 min

19:0019:2019:4020:00

ADJUST Only have 30 minutes today? Pebble re-cuts the session and pushes the rest forward. Shorten

MASTERY — WHAT YOU'D RECALL TODAY

LAST 14 DAYS 13 / 14 windows kept Median solve time down 22% on patterns reviewed at least three times.

Three screens. That's the whole product.

Want it planning your hour?