hello everyone! i'm newby in C and trying to solve this task, but failing in a random test: get SIGSEGV. what could be the reason? (code below)

CS: last testcase expects {"1":4,"5":1,"10":0,"25":1366087610} but should be { '1': 4, '5': 1, '10': 0, '25': 2397957838778 } as stated 9 years ago. Still applies.

Also no random tests and no sample tests.

• No sample tests

• Ruby 3.0 should be enabled

• Desciption should be language-agnostic

This kata is a subject to deduplication process here: https://github.com/codewars/content-issues/issues/93 Please join the discussion to help us identify duplicate kata and retire them.

1. There's no random tests
2. tests don't check that blocks was called at all, so just returning blocks works as well

This is a duplicate of https://www.codewars.com/kata/5365bb5d5d0266cd010009be

• Ruby 3.0 should be enabled (Refer this & this for more detail)

Please use new python test framework.

C++ translation is done. Please, rewiew it.

No sample tests.

Implement a change function that performs at O(n)

O(n) would mean subtracting 25/10/5/1 until you have 0 cents. The required complexity is O(1).

No random tests.

No sample tests.

Crystal translation ready. Check out it!