All challenges
Easy 0 solved 0% acceptance

Output Range With Increment

List the numbers from a start value toward an end value, moving by a fixed step.

What you'll learn

  • Write a loop with a custom step
  • Choose the counting direction from the inputs
  • Return an empty result for invalid input

Problem

Write a function that lists numbers from start to end, moving by step each time. If start is less than or equal to end, count up: start, start + step, start + 2·step, ... while the value is at most end. If start is greater than end, count down by step instead while the value is at least end. The last value only equals end when the steps land on it exactly.

Implement range_with_increment(start, end, step).

Input

start: The first number.

end: The limit; it is included only if a step lands on it.

step: The size of each step. It must be positive.

Output

Return the numbers in the order they are produced. If step is 0 or negative, return an empty list.

Constraints

−1000 ≤ start, end ≤ 1000

−100 ≤ step ≤ 100

Examples

Example 1
Input:
start = -15
end = 10
step = 5

Expected output:
expected = [-15, -10, -5, 0, 5, 10]
Input:
long long start = -15;
long long end = 10;
long long step = 5;

Expected output:
std::vector<long long> expected = {-15, -10, -5, 0, 5, 10};
Input:
long start = -15;
long end = 10;
long step = 5;

Expected output:
long[] expected = new long[] {-15, -10, -5, 0, 5, 10};

Explanation

Counting up by 5 from −15 gives −15, −10, −5, 0, 5, 10, and 10 is reached exactly.

Example 2
Input:
start = 20
end = 5
step = 4

Expected output:
expected = [20, 16, 12, 8]
Input:
long long start = 20;
long long end = 5;
long long step = 4;

Expected output:
std::vector<long long> expected = {20, 16, 12, 8};
Input:
long start = 20;
long end = 5;
long step = 4;

Expected output:
long[] expected = new long[] {20, 16, 12, 8};

Explanation

start is above end, so count down: 20, 16, 12, 8; the next value 4 is below 5.

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

Handle a step of 0 or less first, or your loop may never end.

Hint 2

Use two loops: one counting up while the value is at most end, one counting down while it is at least end.

Hint 3

Check the condition before adding each value, so a value past end is never added.

Expected complexity

O(|end − start| / step) time, O(|end − start| / step) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.