Small games, and the code behind them.
Codesarray makes calm mobile games for Android, and short videos and articles that show how code works, one idea at a time.
Games
Open, play a round, put the phone down. No accounts, and every game plays offline.
-
Blockfall
A calm 8x8 block puzzle with a daily challenge and a Play Games leaderboard.
-
Paws & Perils
A cute paper cut-out roguelike with an idle RPG underneath: pick a hero, walk the trail, choose your path at every fork.
Coming to Google Play About Paws & Perils -
Synapsy
A calm daily memory game: pairs, sequences, grids and spot the change, with a three-minute Daily Workout.
Coming to Google Play About Synapsy
Videos
Coding, algorithms and data structures, one language at a time. Every example on screen is real code with its real output. Python comes first.
-
Video11 min 3 s
Python dynamic programming: memoisation, tabulation and lru_cache
Why recursive Fibonacci repeats work, memoisation with lru_cache vs a tabulated table, then knapsack, the longest increasing subsequence and edit distance with real output.
-
Video7 min 31 s
Python Dijkstra's algorithm with heapq: the cheapest path in a weighted graph
Find the cheapest route through a weighted graph with heapq, trace relaxation by hand, and learn why a negative weight gives a wrong answer and how Bellman-Ford fixes it.
-
Video2 min 31 s
Python graphs: BFS and DFS explained, with the shortest path
Store a graph as an adjacency list, find the shortest path with breadth first search and a deque, and see when depth first search is the better walk.
Articles
The same lessons, written down, with code you can copy.
-
PythonAdvanced
Python dynamic programming: memoisation, tabulation and lru_cache
How dynamic programming works in Python: why recursive Fibonacci repeats work, memoisation with lru_cache vs tabulation, then knapsack, the longest increasing subsequence and edit distance, each with real output.
-
PythonAdvanced
Python Dijkstra's algorithm with heapq: the cheapest path in a weighted graph
How to find the cheapest path through a weighted graph in Python with Dijkstra's algorithm and heapq, how relaxation works, why a negative weight gives a wrong answer, and how Bellman-Ford fixes it. Two short functions with their real output.
-
PythonAdvanced
Python graphs: BFS and DFS explained, with the shortest path
How to store a graph in Python as an adjacency list, find the shortest path with breadth first search and a deque, and when depth first search is the better walk. One small function with its real output.
Work
Codesarray is created by Anand Rathore, a software developer. The day job, for more than five years, has been payment systems.
Payment gateways, settlement and reconciliation: software where every write is audited and a wrong number is somebody's money. That work covers the whole path, from gathering requirements and designing the system to building, deploying and running it.
Open to freelance and contract projects, to full-time roles, and to collaborations and sponsorship on the YouTube channel. Remote only.
- Experience
- 5+ years in fintech
- Backend
- Python, Java, Django, Spring Boot, Node.js
- Data
- PostgreSQL, MySQL, MongoDB, Kafka
- Frontend
- React, TypeScript, Tailwind CSS
- Also
- Android games in Kotlin
- Where
- India, working remotely