• ###### Draxiscommented on "Pyramid Array" cpp solution

While this works, `push_back` in a loop results in unnecessary allocations as the vector expands, you should `reserve` the result vector first.

• ###### leehuntcommented on "N smallest elements in original order" cpp solution

How can an O(n)^2 solution be considered a 'best practice'?

• ###### LuzoAizocommented on "Unique In Order" cpp solution

Yep that check every time is really unnecessary.

• ###### JMC2002commented on "Beginner - Reduce but Grow" cpp solution

This comment is hidden because it contains spoiler information about the solution

• ###### Omar-mohamed-7commented on "You Can't Code Under Pressure #1" cpp solution

creative solution :-)

• ###### mcroppercommented on "How good are you really?" cpp solution

its a c++17 feature, so is more efficient. eg for larger vector sizes. It can run both accumulation and reduction in parrallel meaning its optimized for multicore systems. Although for this eg the differences are miniscule.

• ###### IRustycommented on "Hanoi record" cpp solution

This comment is hidden because it contains spoiler information about the solution

• ###### IRustycommented on "Two Sum" cpp solution

neither clever nor good. o(n^2).

• ###### eurydice5717commented on "Earth-mover's distance" cpp solution

Simply... EXCELLENT

• ###### oximascommented on "Highest and Lowest" cpp solution

simple and persice, I like it

• ###### eurydice5717commented on "Multiple of 11" cpp solution

Negating 'a' is the Best Genius Way to get the alternating sum... !!!
Congrats

• ###### eurydice5717commented on "Relatively Prime Numbers" cpp solution

Should not std::move() a result, RVO does it for you ?

• ###### LostFan123commented on "Solve the equation: (N * x) % M == 1." kata

The instruction should be made more clear

wow

• ###### idfacommented on ""Vowel one" C++ Translation"

Should be fixed now. Thanks!