The "random tests" for the Ruby version of this kata has a problem. If "n" is a prime number, the random tests expect "1 => 1" to be included in the response in addition to "n => 1". This problem does NOT occur for the fixed tests however. Here are some examples of the errors that I received when "n" was a prime number: Expected: {393541=>1, 1=>1}, instead got: {393541=>1}; Expected: {240743=>1, 1=>1}, instead got: {240743=>1}; Expected: {101939=>1, 1=>1}, instead got: {101939=>1}. The random tests do work correctly when "n" is not a prime number.
Unfortunate decision to wrap this function in a class. There is more overhead to make the description language agnostic, and no added value, since this should have been a pure function.
This is one of those problems where mastering tree decomposition in mathematics beforehand makes a huge difference!
With a solid grasp of the concept, you can solve it much faster and more efficiently.
🔥 Big thanks for the effort put into designing this challenge! 🔥
The specs are so vague there are at least 3 possible interpretations of the task, and none of them is clear until you hit the next test case in the actual tests that invalidates your assumption (again).
I found out the solution, when i unlocked the solutions of this kata. You need to return more than just resultObj. You shoud return {factor: resultObj}
I found out the solution, when i unlocked the solutions of this kata. You need to return more than just resultObj. You shoud return {factor: resultObj}
Ruby refsol is calling user solution to get the result (instead of recursing)
The "random tests" for the Ruby version of this kata has a problem. If "n" is a prime number, the random tests expect "1 => 1" to be included in the response in addition to "n => 1". This problem does NOT occur for the fixed tests however. Here are some examples of the errors that I received when "n" was a prime number: Expected: {393541=>1, 1=>1}, instead got: {393541=>1}; Expected: {240743=>1, 1=>1}, instead got: {240743=>1}; Expected: {101939=>1, 1=>1}, instead got: {101939=>1}. The random tests do work correctly when "n" is not a prime number.
Unfortunate decision to wrap this function in a class. There is more overhead to make the description language agnostic, and no added value, since this should have been a pure function.
Python: only
PrimeFactorizershould beimported fromsolution, instead of*🌟 Truly Enjoyed This Problem! 🌟
This is one of those problems where mastering tree decomposition in mathematics beforehand makes a huge difference!
With a solid grasp of the concept, you can solve it much faster and more efficiently.
🔥 Big thanks for the effort put into designing this challenge! 🔥
python new test framework + random tests are required. updated in this fork
The specs are so vague there are at least 3 possible interpretations of the task, and none of them is clear until you hit the next test case in the actual tests that invalidates your assumption (again).
I got the same problem. What is this crap?
I found out the solution, when i unlocked the solutions of this kata. You need to return more than just resultObj. You shoud return {factor: resultObj}
I found out the solution, when i unlocked the solutions. You need to return more than just resultObj. You shoud return {factor: resultObj}
I found out the solution, when i unlocked the solutions of this kata. You need to return more than just resultObj. You shoud return {factor: resultObj}
This comment is hidden because it contains spoiler information about the solution
if you have same summ of sentences, need to sort by default input index
quote from Johan's solution:
Loading more items...