Tejas Mahajan
I like knowing how things work underneath, and the surest way I know is to build them myself. Mostly that means search engines and distributed systems. The rest of the time it is contest problems, and writing down whatever finally clicked.
work
- sift
Fast, local semantic search over code, docs and notes, from the terminal. No cloud, no database.
- search-engine-go
A small, thread-safe document search engine in Go, built on an inverted index.
- distributed-broadcast
A gossip protocol that stays available and eventually consistent across a 25-node cluster under 100 ms latency.
- arxiv-mcp
A Model Context Protocol server that lets AI assistants search arXiv and read paper details.
- ArQiv
A search engine for arXiv papers that layers boolean, BM25, TF-IDF, vector and BERT ranking over one index.
Patches merged upstream into npm/cli, rsyslog/loganalyzer, and goodroot/hyprwhspr.
contests
- Codeforces
- specialist at peak, rated 1414; 240 problems over 44 rated rounds
- LeetCode
- 772 solved, 111 of them hard; contest rating 1692, top 14.7%
- ICPC
- regionals