finds.dev← search

// the find

bradtraversy/traversy-js-challenges

★ 1,085 · JavaScript · updated Nov 2025

Challenges & docs from JS Algorithms & Data Structures course

This is the challenge/solution sandbox for Brad Traversy's paid JS Algorithms & Data Structures course. Each topic folder has a blank starter file, a heavily-commented solution, a Jest test, and a runner script. It's for people working through the course or self-teaching DS&A fundamentals in JS.

The progression is genuinely well thought out — loops and string manipulation, then higher-order array methods, then recursion, then Big O, then the actual data structures (hash tables, linked lists, trees, graphs) and sorting algorithms, each building on the last. Every challenge ships a working Jest test plus a separate 'run' file so you can console.log and poke at your implementation without fighting the test harness. Solutions are commented for the reasoning, not just the syntax, which is rare for repos that dump a solution folder and call it a day.

The repo explicitly bans PRs since it's pinned to a specific paid course, so this isn't a living open-source project you can contribute fixes to — it's a static artifact. Test files require a manual rename from `-test.js` to `.test.js` before Jest will pick them up, which is a needless manual step that should just be the default filename. There's no linter, no CI, and no package.json scripts beyond running the tests, so as a codebase to learn 'good practices' from, it's really only useful for the DS&A content, not for tooling conventions. It's also inseparable from the course — without the paid videos, the readmes and heavily-commented solutions are doing double duty as documentation, and some sections read like abbreviated lecture notes rather than standalone material.

View on GitHub →

// want more like this?

We dig through GitHub every week and send a few repos picked for what you actually care about — each with an honest take like this one.

Get finds in your inbox → Search again →