A simple function for solving the stairs riddle from job interviews: "1000 people are climbing an infinite staircase, all start at 0 and some go up one stair each turn. in each turn are going up only the people that are divisible by the turn number (1,2,3... 2,4,6... 3,6,9...etc) and this continues for 1000 turns. how many people are on stair no.3?" (any n in this function)
-
Notifications
You must be signed in to change notification settings - Fork 0
YaelChen/Stairs_riddle
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
a simple function for solving the stairs riddle from job interviews
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published