This is very much readable if you make it a bit less cramped (like in my solution).

C++ translation, with random tests

This should really be a 7kyu. ( So if you find it hard for an 8kyu, that might be correct. )

Don't hold your breath everyone, but I'll raise the issue at the appropriate place.

Approved

LGTM! I would've personally loved to see generateTestCase further simplified as below, but it's good as-is

std::vector<int> result(randint(15, 100));
std::iota(result.begin(), result.end(), randint(-1e6, 1e6));

if (not isConsecutive) {
    const std::size_t index      = randint(1, result.size() - 2);
    const std::size_t eraseCount = randint(1, result.size() - 1 - index);
    result.erase(result.begin() + index, result.begin() + index + erase_count);
}

return { result, solution(result) };

Point 1 is now fixed too.

Point 2 is now fixed

• I heavily encourage you to add the Python fixed tests, splitting them into an It(all_consecutive) and It(non_consecutive). The two tests from JS are too little imo

• From the description:

  The numbers will also all be unique and in ascending order

  This means std::generate(result.begin(), result.end(), [&] { return randint(-1e6, 1e6); } ); is non-compliant since it can generate duplicates and is not guaranteed to be sorted

• Optioal, but fmt::format("numbers = {{{}}}\n", fmt::join(numbers, ", ")) is unnecessary because fmt::format("numbers = {}\n", numbers) will output the same exact thing

lgtm, approved

this piece of code is a friendly reminder that heavy string-work should be done in any language but C or assembly

C++ translation ready for review (author is inactive).

.

Rejected:

1. you don't test the value of first at all.
2. there's lots of "C++ is just C with classes"-type of code; e. g. using a modifiable pointer as a way to return two values is usually bad practice in modern C++ (std::pair or, for this case specifically, std::optional is usually the better choice here).

Lua translation