Code RoomCount price increases
EasyPrep Room Coding #360

Count price increases

CodingAlgorithms & data structuresEntry–Mid~10 min

Given a product's daily closing prices in chronological order, count how many days closed strictly higher than the day immediately before. The first day has no previous day and never counts. Example: [3, 4, 2, 5, 5] has 2 such days (4 beats 3, and 5 beats 2; the final 5 only ties).

Implement
count_price_rises(prices: list[int]) → int
Examples
in[[3,4,2,5,5]]out2
What a strong answer looks like

State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.

0:00 of about 10 min
InputExpectedGot
[[3,4,2,5,5]]2not run yetsample