Counter at Bloomberg

Easy82.4% acceptance

This problem has 25.0% frequency at Bloomberg.

Problem Description

Given an integer `n`, return a `counter` function. This `counter` function initially returns `n` and then returns 1 more than the previous value every subsequent time it is called (`n`, `n + 1`, `n + 2`, etc).

Read full problem and hints

Also asked at 5 companies