I'm Kashish, and I'm 9. In the last few weeks I built a linked list, hash table, a binary search tree (BST), breadth-first search (BFS), Dijkstra's algorithm and a greedy scheduler from scratch in Python, using free and open source tools. I write about it every day on my blog, including the failures. This poster shows the method that worked for me: turn the idea into something from my own life, solve it on paper first, then turn the paper straight into code.

Make it mine: Big-O became swimmers, from club level to Olympic. Dijkstra's costs became price tags on a bus-and-train trip. An infinite loop became two friends telling each other "ask her" forever.

Paper first: for Dijkstra I failed twice, then kept a table on paper: place, cost, came from, and ticked, crossing out old costs when I found cheaper ones. That table became two dictionaries and a list in Python, with almost no change in structure. The paper got the logic right; the bugs left were small, like a loop that never moved on, and I'll show how I found them.

I learn with an AI tutor that asks me questions but never shows me code, so I type every line myself. I predict before I run anything, and I rebuild things from memory the next day.

Visitors will see my real notebook pages next to my real code, and can take away the same three steps to try with any algorithm.

Poster Sections:

1. Three steps: make it mine, paper first, then code
2. Translation wall: textbook idea → my version
3. The Bridge: my Dijkstra paper table beside the Python it became
4. Bugs I found, and how
5. Try it yourself: a one-card recipe
6. Links and a QR code