Contact person: Business Client

Phone:Show

Email:Show

Location: Central, India

Budget: Recommended by industry experts

Time to start: As soon as possible

Project description:
"Hey there! I’m looking to collaborate with a sharp and reliable competitive programmer who genuinely enjoys tackling Codeforces Div. 1/2–style problems and can deliver high-quality solutions in both C++ (C++17 or newer) and Python 3.

This is for a queue of algorithmically intense problems, where correctness, efficiency, and clean code matter just as much as speed. If you're someone who thrives on solving tricky edge cases, optimizing to the limit, and writing elegant explanations for your solutions—you’ll fit right in.

Problem Scope

Expect problems covering a wide range of competitive programming topics, including:
Core DSA: Arrays, Strings, Linked Lists, Stacks, Queues, Hash Maps
Advanced Structures: Trees, Heaps, Tries, Union-Find
Graph Theory: BFS, DFS, Topological Sort
Techniques: Sliding Window, Two Pointers, Binary Search, Recursion, Divide & Conquer
Paradigms: Backtracking, Dynamic Programming, Greedy, Bit Tricks, Math tricks, etc.

Ideal Candidate

You actively compete on Codeforces, CodeChef, LeetCode, or similar platforms
You’re fluent in both C++ STL (including PBDS) and Pythonic libraries (like itertools, bisect, etc.)
You enjoy deep dives into tricky problems and are comfortable with tight deadlines (usually 24 hours turnaround per problem)" (client-provided description)