DevSlides
Write Markdown, preview a real 16:9 slide, and present fullscreen. Built for teachers, code lessons, pitch decks, and technical talks.
No decks yet. Create the Binary Search lesson to see the editor.
Problem, algorithm, runnable C++, complexity chart, and a live array walk.
Shortest paths on an unweighted graph, with a queue, BFS walk, and C++.
The BST invariant, a live tree search, insert intuition, and C++.
Pointer walks, list vs array, reverse-in-place, and a practice close.
Divide, merge, stability, and an always-O(n log n) complexity slide.
Base case, call stack, factorial, and why naive Fibonacci explodes.
Families, loop counting, and live charts for log n, n log n, and 2ⁿ.
Hash, collisions, load factor, and hash map vs tree map.
Stepped tree, list, graph, stack, queue, array, and time-complexity visualizers.
A 45-minute lecture: goals, hook, model, lab, recap — steal the structure for any topic.
A short teaching deck with a title slide, goal, and stepped code.
Factoring, the quadratic formula, and the discriminant with stepped worked examples.
Right triangles, common triples, the converse, and real-world practice.
Pólya's four-step framework — understand, plan, carry out, look back — for any subject.
Problem, solution, market, business model, traction, competition, team, and the ask.
Every layout in one deck: clicks, code-step, diagrams, motion, notes, and shortcuts.
Wipe, blinds, doors, iris, pixels, and other slide-to-slide transitions.
One slide per Framer-style text animation, including looping color, gradient, and type-loop.
Play an asciinema .cast recording on the slide.
An empty 16:9 deck. Start from a single centered slide.