Simple counter (bad solution) clear solution for Nearest Value by bravebug - python coding challenges

Enable Javascript in your browser and then refresh this page, for a much enhanced experience.

Simple counter (bad solution) solution in Clear category for Nearest Value by bravebug

def nearest_value(values: set, one: int) -> int:
    if one in values:
        return one
    n = 1
    while True:
        if (one - n) in values:
            return one - n
        elif (one + n) in values:
            return one + n
        n += 1


if __name__ == '__main__':
    print("Example:")
    print(nearest_value({4, 7, 10, 11, 12, 17}, 9))

    # These "asserts" are used for self-checking and not for an auto-testing
    assert nearest_value({4, 7, 10, 11, 12, 17}, 9) == 10
    assert nearest_value({4, 7, 10, 11, 12, 17}, 8) == 7
    assert nearest_value({4, 8, 10, 11, 12, 17}, 9) == 8
    assert nearest_value({4, 9, 10, 11, 12, 17}, 9) == 9
    assert nearest_value({4, 7, 10, 11, 12, 17}, 0) == 4
    assert nearest_value({4, 7, 10, 11, 12, 17}, 100) == 17
    assert nearest_value({5, 10, 8, 12, 89, 100}, 7) == 8
    assert nearest_value({-1, 2, 3}, 0) == -1
    print("Coding complete? Click 'Check' to earn cool rewards!")

March 31, 2020

Comments:

Kedow on Nov. 8, 2020, 7:56 a.m.
We can delete the first condition and set n=0. Code will be a bit more compact while doing the same

StephD on March 7, 2021, 7:58 a.m.
I like this solution It's more simple and understandable for beginner then solutions using min and abs

___1981 on July 16, 2021, 3:17 a.m.
Yes, it's easier for beginners like me to understand this. But this code is going to take too long to run this: nearest_value([100000000000,-200000000000],-1) A beginner like me needs to learn more than simple tools to make codes more efficient and short. I shall keep this in mind.

bravebug on Sept. 20, 2021, 4:18 p.m.
What code did you compare it with?

___1981 on Sept. 30, 2021, 9:47 a.m.
Just those others in the clear solutions.

bravebug on Sept. 30, 2021, 6:10 p.m.
Oh! You are absolutely right! It's just a slow count by one. However interesting that my solution fastest in standard simple tests (repeated 100000 times): <pre class='brush: python'>this solution (set while in elif True): 1.30 mortonfox (min abs set lambda int): 1.76 veky (min abs set int): 1.90 Oksana_Antropova (min abs set int comprehension): 1.53 vvm70 (abs set lambda sorted int): 1.67 </pre> This may mean that different solution for different inputs. P.s.: But my solution is really bad =)

nserev on Nov. 29, 2021, 3:06 p.m.
Cool solution with a nice while loop. Keep up the good work!

PQBob on Nov. 14, 2022, 2:26 p.m.
good clear solution. More better than my solution!))

Different kind of sets

0 %

You ClassRoom Demo is Ready With the new tool CheckiO ClassRoom, you will be able to analyze your students' progress, have your own leaderboard, change missions order on the map, and so on.