Interactive coding challenges

Skill mahmoud20138/Tradecraft/plugins/tradecraft/skills/interactive-coding-challenges

120+ interactive coding challenges in Jupyter Notebooks covering data structures, algorithms, system design and OOP for interview prep. USE FOR: coding challenges, algorithm practice, data structures interview, leetcode style problems, DSA practice, array problems, linked list, graph algorithms, dynamic programming, sorting algorithms, bit manipulation, system design interview, OOP design, big-O complexity, technical interview prep.From its SKILL.md

Install

npx -y skills add mahmoud20138/Tradecraft --skill interactive-coding-challenges

Assembled from the repository path, not quoted from the project. Check it against their README if it does not work.

One thing to look at

10 stars10 stars. Stars are a popularity signal and not a quality one, but at this level it is likely that nobody has read this closely except its author, and you would be relying on your own review.

SKILL.md

2.2 KB, 411 tokens by cl100k_base, as published. Nobody here has run it

Interactive Coding Challenges

120+ challenges in Jupyter Notebooks with solutions, unit tests, and Big-O analysis.

Categories

Category	Count	Key Topics
Arrays & Strings	10	two-sum, anagram, reverse, rotation, compression
Linked Lists	8	reverse, cycle detect, merge, nth-from-end
Stacks & Queues	8	min-stack, queue-via-stacks, balanced parens
Graphs & Trees	21	BFS, DFS, BST validate, LCA, trie, shortest path
Sorting	10	merge, quick, heap, radix, counting sort
Recursion & DP	17	fibonacci, knapsack, coin change, LCS
Math & Probability	6	prime sieve, power set, probability
Bit Manipulation	8	XOR tricks, count bits, power of 2
System Design	8	URL shortener, pastebin, Twitter, Instagram
OOP Design	8	deck of cards, parking lot, call center, chess

Implementations Included

Data Structures (9): LinkedList, Stack, Queue, BinarySearchTree, Graph, MinHeap, Trie, PriorityQueue, HashMap

Algorithms (15): Selection, Insertion, Quick, Merge, Radix sort; DFS, BFS, Dijkstra; Knapsack (0/1 + Unbounded); Sieve of Eratosthenes

Each Challenge Contains

Problem statement + constraints
Unit tests (general + edge cases)
Skeleton code to fill
Reference solution with Big-O analysis

Setup

git clone https://github.com/donnemartin/interactive-coding-challenges
cd interactive-coding-challenges
pip install jupyter
jupyter notebook
# Open *_challenge.ipynb -> solve -> check *_solution.ipynb

What ships with it

Read from the repository

Just SKILL.md. No reference files, no scripts.