Diet Plan Performance Problem

Diet Plan Performance Problem — ExecCode Easy DSA Practice

Solve the Diet Plan Performance problem on ExecCode. Free online easy DSA practice in Sliding Window. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given the input needed to solve Diet Plan Performance. Your task is to compute the required answer and return three space-separated integers. k lower upper then calorie list.

Examples

Input {"k": 5, "lower": 2000, "upper": 2500, "calories": [2200, 1800, 2600, 2100, 2400]}; Output 1 1 3. Input {"k": 3, "lower": 1500, "upper": 1800, "calories": [1600, 1700, 1400]}; Output 1 0 2. Input {"k": 1, "lower": 1000, "upper": 1200, "calories": [1100]}; Output 0 0 1

Constraints

1 <= k <= len(calories) <= 10^5

Practice Diet Plan Performance free on ExecCode. Browse DSA problems, topic map, and placement guides.