CodingEasycod-g1184

Subject ArraysLevel Entry–Mid~10 minCommon in Algorithms & data structures interviewsIndustries Software development

Question

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.

Learn the concepts

Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.

Run or narrate your approach, then ask the coach.