Analysis updated 2026-08-04 · repo last pushed 2020-02-12
A bootcamp student can prove mastery of algorithms by completing the timed exam tasks.
An instructor can grade a student's understanding using the included grading rubric.
A learner can practice recursion by writing a function that counts occurrences of a substring.
A teacher can assess problem-solving under constraints like the single-bit-memory robot sort.
| scottschindler/sprint-challenge--algorithms | 00kaku/gallery-slider-block | 04amanrajj/netwatch | |
|---|---|---|---|
| Stars | — | — | 0 |
| Language | — | JavaScript | Rust |
| Last pushed | 2020-02-12 | 2021-05-19 | — |
| Maintenance | Dormant | Dormant | — |
| Setup difficulty | easy | easy | moderate |
| Complexity | 2/5 | 2/5 | 3/5 |
| Audience | developer | general | ops devops |
Figures from each repo's GitHub metadata at analysis time.
No setup needed beyond cloning the repo and opening the test files in a code editor.
This repository is a graded assessment from a coding bootcamp, designed to test whether students can solve classic algorithmic problems on their own within a three-hour time limit. It is not a tool or application, but rather a take-home exam that measures a student's ability to analyze code performance and write problem-solving logic from scratch. The challenge is split into two main parts. The first part is a set of short-answer questions where students must analyze how efficiently pieces of code run, identify different search strategies, and describe their logic in plain English. The second part consists of hands-on coding tasks. One task asks the student to write a function that counts how many times "th" appears in a word using recursion, meaning the function must call itself instead of using standard loops. Another task requires sorting a list of items using a simulated robot that can only perform very basic actions like moving, picking up items, comparing them, and turning a single light on or off. The primary users are bootcamp students and their instructors. A student would use this to prove they have mastered the week's lessons on algorithms and deserve to pass the unit. An instructor uses the included grading rubric to score the student's understanding, awarding points for correctly identifying search strategies, passing automated code tests, and writing efficient solutions. For example, a student might be asked to find the specific floor of a building where an egg would break when dropped, and must explain the most efficient search strategy for doing so. A notable tradeoff in the robot sorting task is the strict constraint that students cannot store variables or use any external libraries. The robot only has one bit of memory, a simple light that turns on or off, forcing the student to invent a creative workaround. The project also encourages a real-world development habit: if a student gets stuck for twenty minutes, they are directed to stop and ask their instructor for help rather than spinning their wheels for the entire three-hour exam.
A graded bootcamp exam that tests students on classic algorithm problems within a three-hour time limit, including short-answer questions on code performance and hands-on coding tasks using recursion and constrained logic.
Dormant — no commits in 2+ years (last push 2020-02-12).
No license information is provided in this repository, so default copyright restrictions apply.
Setup difficulty is rated easy, with roughly 5min to a first successful run.
Mainly developer.
This repo across BitVibe Labs
Verify against the repo before relying on details.