Hi, I'm Dhairya Sommanek
Computer Science & AI Student at UpGrad School of Technology | Competitive Programmer & ICPC Aspirant
Driven by algorithm design, time complexity analysis, and high-performance C++ problem-solving.
01 — ABOUT
Education & Algorithmic Foundation
Building a strong core in computer science, AI, and competitive problem solving.
UpGrad School of Technology (SoT)
A rigorous, industry-aligned program blending core CS fundamentals with applied AI & ML. As a 1st-year student, my focus is deep algorithmic training and consistent contest practice toward ICPC.
- 100+ problems solved across CodeChef, LeetCode & Codeforces
- CodeChef debut rating 1163 (1★) at Starters 249
- C++ STL, fast I/O, and asymptotic optimization
- Preparing for ICPC through weekly contest practice
Current Focus
Data Structures & Algorithms, C++ Standard Template Library (STL), and Time Complexity Optimization.
Philosophy
Focus on clean math formulas, optimal asymptotic bounds, and write-ups over brute-force loops.
Based In
India · Working remotely with teams worldwide.
02 — SKILLS
Problem Solving Toolbox
A focused stack for contest programming and algorithmic depth.
Languages
C++ as my contest language, with Python and Java for practice.
Problem Solving & Core
The algorithmic core behind every contest submission.
Tools
A minimal setup that keeps practice sessions fast.
03 — COMPETITIVE PROGRAMMING
Problem Solving & Profiles
Live contest profiles and the reasoning behind my favourite solutions.
CodeChef
rating: 1163 ★
division: 4
CodeChef
Rating: 1163 (1★) — Active contestant in Div 4 (debuted in Starters 249).
Codeforces
practice: Div 3 / Div 4
focus: greedy, math
Codeforces
Active contestant — practicing Div 3/4 problem sets with a focus on speed and accuracy.
LeetCode
arrays · two pointers
STL drills
LeetCode
DSA practice — topic-wise arrays, two pointers, and STL.
Logic & Editorial Highlights
Short write-ups on how I reduced complexity instead of brute-forcing.
Up-Down Palindrome (CodeChef UPDWPAL)
O(N) symmetry check using lower/upper bounding limits for X, avoiding any search over candidate values.
Product Exceed
Replaced O(P) step-by-step greedy loops with O(√P) math ceiling-division arithmetic.
Let's Build Something
Have an idea, a role, or a project? Drop a message — I reply fast.
Location
India · Remote-friendly
Response Time
Usually within 24 hours