kottans / kottans/algorithm_club
skiena 2-46
Open
interview question
- Dominant language
- JavaScript
- Stars
- 14
- Forks
- 14
- PR merge metrics
- No merged PRs in 30d
Description
You have a 100-story building and a couple of marbles. You must identify the
lowest floor for which a marble will break if you drop it from this floor. How fast
can you find this floor if you are given an infinite supply of marbles? What if you
have only two marbles?
Contributor guide
No contributing guide indexed for this repository
Research direction
The issue contains only the marble-drop problem and names no source files, tests, or entry points. Start by determining where this repository records solutions to these exercises. Done means documenting a response that addresses both the unlimited-marble and two-marble cases.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- javascript
- Domain
- content
- Issue type
- Documentation
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 25/100