I think you meant when n is the divisor and 2n-1 is the bound and n is the solution, because your solution fails on exactly that case, not on the written one.
You need to test for the case when n is the divisor and 2n+1 is the bound and 2n is the solution. I passed the test using a for loop but I would have failed this test so I got a false positive.
I think you meant
when n is the divisor and 2n-1 is the bound and n is the solution, because your solution fails on exactly that case, not on the written one.Because the instructions ask for the aliases being age_min and age_max
why can't we use min_age and max_age for the alias?
This comment is hidden because it contains spoiler information about the solution
This problem requires you to make a reference to the string somewhere. If you just return the length of the string you get a null reference.
You need to test for the case when n is the divisor and 2n+1 is the bound and 2n is the solution. I passed the test using a for loop but I would have failed this test so I got a false positive.