finds.dev

StephenGrider/AlgoCasts

View on GitHub

★ 1,974JavaScriptGPL-3.0updated Aug 2024

// the take

This is the exercise repo for Stephen Grider's Udemy course on coding interview algorithms and data structures. It's a flat collection of classic interview problems (anagrams, BST, linked lists, palindrome, weave, etc.), each with a blank starter version under exercises/ and a solved version under completed_exercises/. It's for people working through that specific course, not a general algorithms reference.

Each problem is isolated in its own folder with a paired test.js, so you can run one exercise at a time without pulling in the rest of the repo. The starter/solution split (exercises vs completed_exercises) is a clean way to structure course material — you write the implementation, then diff against the answer. Coverage is broad for interview prep: trees, linked lists, stacks/queues, string manipulation, sorting.

The README is a single line pointing at the Udemy course — no setup instructions, no indication of what test runner to use, no license note beyond the file's existence. There's no root package.json, only one inside exercises/ and completed_exercises/, so it's unclear if the whole repo installs as one unit. This is course scaffolding, not a library: the code has had no meaningful commits since course release, there's no CI, and the value evaporates entirely if you're not enrolled in the specific Udemy course it supports.

We read the README, the directory tree and a key source file in September 2026. Nobody pays to be listed. How we judge →

// at a glance

Stars
1,974
Forks
2,674
Language
JavaScript
License
GPL-3.0
Last commit
5 Aug 2024

// nearby

If AlgoCasts isn't quite it.

All repos →