Available for internships ยท Summer 2026

Hello, I'm
Ankit Ram ๐Ÿ‘‹

I'm a builder. I've been coding for 7 years โ€” started because I wanted to make games, stayed because I fell in love with algorithms.

CS at IILM Delhi. I grind competitive programming daily and build full-stack products that actually work.

I don't believe I'm the best programmer in the world, But I believe in relentless progress.

// stats.json
โ€”
CF Rating
โ€”
Peak Rating
7yr
Coding
2nd
Sem, B.Tech CS
Handle codecrusader69
Rank โ€”
Status open to work
Rating progress โ€” / 2000

Things I've built

Full-stack products, from idea to live deployment. No tutorials โ€” real problems I wanted to solve.

๐Ÿญ
3D Factory Simulation
Built a real-time 3D factory simulation in OptiSim to optimize production efficiency. Won 1st Runner-Up at IIT Kharagpur Hackathon competing against teams from across India.
OptiSim 3D Simulation Optimization IIT KGP Hackathon
๐Ÿ† 1st Runner-Up โ†’
๐Ÿค–
ML Classifier
Python-based ML classifier trained and evaluated on Kaggle. End-to-end: data cleaning, feature engineering, model selection, evaluation.
Python scikit-learn Kaggle Pandas
View on GitHub โ†’

What I've done

๐Ÿ†
1st Runner-Up โ€” IIT Kharagpur Hackathon
Built a 3D factory simulation in OptiSim to optimize production efficiency. Competed against teams from top engineering colleges across India.
โšก
Codeforces Rating: โ€” ยท Peak: โ€”
Active competitive programmer.Consistent grind toward expert-level rating.
๐ŸŒ
GSoC 2026 Contributor โ€” omegaUp
Open PR #9605 โ€” global key rename across the codebase. Under review. Lint passing. Reviewer: pabo99.
๐Ÿ“
JEE Advanced
One of the toughest engineering entrance exams in the world. Cleared it, moved on, kept building.

The algorithm grind

The mental models I've internalized. Not tricks โ€” ways of seeing problems differently.

๐Ÿง  Core Concepts
โ†’ GCD as divisibility aggregator โ€” gcd(aยทb, bยทc) = b when gcd(a,c)=1
โ†’ Parity โ€” subtraction = addition mod 2
โ†’ "What if" queries โ€” compute delta, never mutate the array
โ†’ Manhattan distance โ€” maximize by picking diagonal corner pairs
โ†’ Consecutive coprimality โ€” two consecutive integers never share a divisor โ‰ฅ 2
โ†’ LCM trick โ€” for finding divisor intervals efficiently
๐Ÿ“ˆ Progress
CF Rating โ€” โ†’ 2000
Div 2 A/B solve rate strong
Handlecodecrusader69
PlatformCodeforces + LeetCode
// contact
Let's build something.
Open to internships for Summer 2026. If you're building something interesting or want to talk algorithms, reach out.