O(N)
dp[i][j]
CP Showcase

Competitive Programming

Turning complex algorithm problems into elegant and optimized solutions.

Problem solving is my passion. Diving deep into data structures, dynamic programming, and mathematics challenges my cognitive thinking and keeps me sharp. Here is a chronicle of my competitive programming journey, profiles, accomplishments, and current milestones.

Status: Training for ICPC regional contests and mastering advanced graph optimization algorithms.
View Platforms
solution.cpp

#include <bits/stdc++.h>

using namespace std;

int solve(int n) {

    vector<int> dp(n + 1, 0);

    dp[1] = 1;

    for(int i = 2; i <= n; ++i) {

        dp[i] = dp[i-1] + dp[i-2];

    }

    return dp[n];

}

Complexity: O(N)STATUS: ACCEPTED

Online Judge Profiles

Where I practice, solve algorithm problems, and participate in active contests.

Skill Focus & Topics

Technical topics, programming languages, and algorithms I focus on in problem solving.

Achievements & Awards

Contests won, certificates earned, workshops completed, and milestones reached.

Milestones & Current Goals

What I am currently pursuing in terms of training, ratings, and milestones.

"Competitive programming isn't just about rating or badges; it's about training the mind to decompose any complex real-world challenge into simple, solvable algorithms."
JOY SARKARCompetitive Programmer & Software Engineer