Hello, I'm

Anik Mazumder

|

I build robust backend systems and solve complex algorithmic problems. Obsessed with efficiency and clean code.

View Work Contact Me

About Me

Anik Mazumder
50+ LeetCode
Solved

Driven by Logic,
Powered by Code.

I am a Computer Science student at Meghnad Saha Institute of Technology, deeply invested in the world of Data Structures & Algorithms.

My journey is defined by a relentless pursuit of optimization. Whether it's reducing an algorithm's complexity from O(n²) to O(n) or architecting a scalable backend, I believe in writing code that matters.

Java Main Language
Kolkata Based In

Tech Stack

Languages

Java
Java
C
C / C++

Tools & Systems

Git
Git
GitHub
GitHub

Core Competencies

⚡

DSA

Arrays, Trees, Graphs

🧠

Problem Solving

Dynamic Programming

🚀

Optimization

Time & Space Complexity

Selected Works

Sorting & Arrays

Implementation of efficient sorting algorithms (QuickSort, MergeSort) and O(n) solutions for complex array problems using two-pointer techniques.

  • Java
  • Algorithms
  • Optimization

String Algorithms

Pattern matching engines including KMP and Rabin-Karp implementations. Palindrome detection optimized from O(n²) to O(n).

  • Java
  • String Manipulation

Dynamic Programming

Solving complex optimization problems (Knapsack, LCS) using memoization and tabulation. Focused on space-time tradeoff analysis.

  • Java
  • DP
  • Tabulation

Matrix Operations

Specialized algorithms for 2D grid traversals, spiral printing, and efficient search in sorted matrices.

  • Java
  • 2D Arrays
View Full GitHub

Let's Connect

Currently seeking internship opportunities.
Whether you have a question or just want to say hi, my inbox is open!

Say Hello
GitHub LinkedIn LeetCode