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.
-
Video2 min 12 s
Python heaps and priority queues with heapq
A heap keeps the smallest item on top. Pop and push cost O(log n), and heapq turns a plain list into a priority queue for a tiny task scheduler.
-
Video2 min 30 s
Python binary search explained: low, high and mid
Check the middle of a sorted list and drop half. Move low and high past the middle, and see why a million items take about 20 steps.
-
Video2 min 31 s
Python sorting algorithms: bubble sort, merge sort, sorted()
Bubble sort swaps neighbours and is O(n squared), merge sort splits and merges in O(n log n), and sorted() with key does the job in real code.
Articles
The same lessons, written down, with code you can copy.
-
PythonIntermediate
Python heapq: heaps and priority queues explained
How a Python heap always gives you the smallest item first. The heap rule, pop and push at O(log n), heapq on a plain list, and a tiny task scheduler with its real output.
-
PythonIntermediate
Python hash tables: how a dict finds a key so fast
How a Python dict works inside: the key becomes a hash, the hash picks a slot, so lookup is O(1). Collisions, why a list cannot be a key, and how a set fits in.
-
PythonIntermediate
Python sorting algorithms: bubble sort, merge sort, sorted()
How sorting works in Python: bubble sort swaps neighbours in O(n squared), merge sort splits and merges in O(n log n), and sorted() with key does the job for you in real code.
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