This repository contains my official submissions and optimized solutions for Meta Hacker Cup 2025, Meta’s international competitive programming championship designed to push the limits of algorithmic thinking, optimization, and computational precision.
I successfully advanced through the Practice, Round 1, and Round 2 (Advanced Round) of Meta Hacker Cup 2025, securing a position among the Top 5% programmers worldwide. Competing against over 80,000 elite participants, including ICPC medalists and top global programmers, this achievement highlights my expertise in algorithmic design, logical reasoning, and high-performance problem-solving.
- Global Rank: Top 4,000 out of 80,000+ participants (Top 5%)
- National Rank: Top 80 in Pakistan
- Competition Level: International (organized by Meta, formerly Facebook)
- Core Strengths: Algorithm design, data structures, optimization under time constraints
The Practice Round served as the warm-up phase for the competition, allowing participants to familiarize themselves with the problem format, scoring system, and time constraints.
I successfully completed and cleared the Practice Round, ensuring eligibility for the official rounds.
After the practice phase, I participated in the official competitive rounds of Meta Hacker Cup 2025, organized by Meta (Facebook).
- Advanced through Round 1 with high accuracy and optimized submissions.
- Officially qualified for Round 2 (Advanced Round), performing among the world’s top 5%.
- Achieved ranking within the Top 4,000 globally and Top 80 in Pakistan, competing against thousands of elite programmers worldwide.
Below is a glimpse of my performance and progression in the Meta Hacker Cup 2025.
| Problem ID | Title | Points | Core Concepts |
|---|---|---|---|
| A1 | Snake Scales (Chapter 1) | 9 | Greedy algorithms, pattern computation |
| A2 | Snake Scales (Chapter 2) | 13 | Dynamic programming, state optimization |
| B1 | Final Product (Chapter 1) | 10 | Modular arithmetic, integer transformations |
| B2 | Final Product (Chapter 2) | 23 | Algorithmic complexity reduction |
| C | Narrowing Down | 24 | Binary search, mathematical modeling |
| D | Crash Course | 26 | Graph theory, combinatorial optimization |
All problems were implemented and tested in Python, following computational efficiency and clean code design principles.
- Algorithmic Thinking: Translating abstract mathematical logic into structured, efficient code.
- Optimization: Designing scalable and time-efficient algorithms.
- Precision: Maintaining numerical accuracy under modular constraints.
- Code Readability: Writing clean, modular, and reusable functions.
- Performance Engineering: Ensuring solutions perform consistently across large datasets.
- Learned to perform under real-time contest pressure and large input constraints.
- Strengthened understanding of brute-force vs. greedy vs. dynamic programming trade-offs.
- Gained mastery in algorithmic complexity analysis and Python optimization.
- Built efficient debugging and testing workflows for high-stakes competitive programming.
- Realized that persistence is key — even when my machine froze during a problem, I adapted and kept going without giving up.
- Meta Hacker Cup Official Website
- GitHub Repository
- Author: Eesha Tariq
- Achievement: Qualified for Round 2 (Top 5% Worldwide, Top 80 Pakistan)
Takeaway: Never give up, no matter how tough the challenge seems. Consistency, patience, and a learning mindset always win in the end.