This kata is a subject to deduplication process here: https://github.com/codewars/content-issues/issues/225. Please join the discussion to help us identify duplicate kata and retire them.
What people think of as "significant" varies from human to human, but when developing your heuristic keep these things in mind: Sweden has 1, 5, and 10kr coins; and bills for 20, 50, and 100kr; although the 50 isn't used very often.
What people think of as "significant" varies from human to human, but when developing your heuristic keep these things in mind:
Sweden has 1, 5, and 10kr coins; and bills for 20, 50, and 100kr; although the 50 isn't used very often.
One thing to note is that as the bill gets more expensive, the idea of what is "siginificant" for rounding up changes.
This is equivalent to not providing any clear specs: what is the cutoff point between the next round-up interval? The kata expects this:
bill < 100: 10 bill < 1000: 20 otherwise: 100
But it could easily be the total bill with 5% accounted for, since that'd be the actual least paid amount.
Again, this information is crucial to solving the kata but is being intentionally held back.
I think this is 7kyu, but not the easiest one.
Updated to Node v14
JS: Node v14 should be used along with its appropiate assertion tools (Mocha + Chai). Refer to this and this
JS: You can still use regex
Link dead, this one's more alike ~~
Added random tests
Updated to Node v12
No random tests
Node 12 should be enabled (Refer this and this for more info)
no random tests
There're already several katas about BFS tree-traversal.
It's in the codewars mission statement to help recruiters ascertain talent.
Duplicate to lots of katas.
Duplicate of an older, approved kata.
Loading collection data...
This kata is a subject to deduplication process here: https://github.com/codewars/content-issues/issues/225.
Please join the discussion to help us identify duplicate kata and retire them.
This is equivalent to not providing any clear specs: what is the cutoff point between the next round-up interval? The kata expects this:
But it could easily be the total bill with 5% accounted for, since that'd be the actual least paid amount.
Again, this information is crucial to solving the kata but is being intentionally held back.
I think this is 7kyu, but not the easiest one.
Updated to Node v14
JS: Node v14 should be used along with its appropiate assertion tools (Mocha + Chai).
Refer to this and this
JS: You can still use regex
Link dead, this one's more alike ~~
Added random tests
Updated to Node v12
No random tests
Node 12 should be enabled (Refer this and this for more info)
no random tests
There're already several katas about BFS tree-traversal.
It's in the codewars mission statement to help recruiters ascertain talent.
Duplicate to lots of katas.
Duplicate of an older, approved kata.
Loading more items...