Md. Shourov (known online as Shourov735) is a Software Engineering undergraduate student at the Institute of Information Technology (IIT), University of Dhaka (BSSE program), and the IT Secretary at Nabodigonto Social Welfare Organization.

What degree and university is Md. Shourov affiliated with?

Md. Shourov is pursuing a Bachelor of Science in Software Engineering (BSSE, 2024–Present) at the Institute of Information Technology (IIT), University of Dhaka (IIT DU) in Bangladesh.

What is Md. Shourov's flagship software engineering project?

His flagship production system is Nabodigonto, a 100,000+ LOC edge-native distributed monorepo and community platform on Cloudflare Workers, featuring fault-isolated services, atomic D1 batching, and serverless Bengali PDF generation.

What is Md. Shourov's problem-solving and competitive programming track record?

Md. Shourov has solved 150+ competitive programming problems across Codeforces and LeetCode, with strong foundations in algorithms, data structures, and GoF design patterns.

What engineering roles am I currently targeting?

I am actively seeking Software Engineering internships and Junior/Associate Software Engineer roles focusing on full-stack web engineering, edge computing (Cloudflare Workers/Serverless), backend architecture, and offline-first applications.

How do I balance BSSE coursework at IIT DU with shipping production systems?

Software Engineering coursework at IIT, University of Dhaka provides rigorous fundamentals—data structures, algorithms, database systems, design patterns, and concurrency. I apply these academic principles directly to production architectures like Nabodigonto and InsideJibon, creating a reinforcing loop between theory and high-craft implementation.

What does my typical architecture stack look like for edge and backend systems?

For edge and modern web platforms, I leverage Next.js 16 App Router, TypeScript, Cloudflare Workers, Durable Objects, and PostgreSQL (Neon/D1) paired with Drizzle or Prisma. For performance and desktop systems, I build in modern C++ and Java with SQLite and Maven.

What is my problem-solving and competitive programming track record?

I have solved 150+ competitive programming problems across Codeforces and LeetCode, with primary focus on graph algorithms, dynamic programming, number theory, and GoF design patterns.

How can engineering teams reach me for opportunities?

Recruiters and engineering leads can reach me directly by email at mdshourov735@gmail.com, connect on LinkedIn (linkedin.com/in/md-shourov-613934358), or review my code on GitHub (github.com/Shourov735).

AlgorithmsEngineering Case Study

Codeforces Solutions

A structured archive of 150+ competitive programming solutions on Codeforces, emphasizing graph theory, number theory, greedy algorithms, and contest problem solving.

High-Performance Competitive Algorithms (C++20)

Role & ScopeCompetitive Programmer

Target DomainAlgorithms · Production

Core RuntimeC++, C, Algorithms

Operational & Architectural Invariants:

1.0–2.0s strict execution time limit256MB memory limit150+ problems solved

GitHub

The Problem

Solving contest problems under strict time (1.0–2.0s) and memory limits (256MB) requires deep familiarity with algorithmic complexities, fast I/O, and optimal data structure choices.

Technical Approach

Implemented solutions in modern C++ utilizing STL containers, custom graph traversals (BFS, DFS, Dijkstra), segment trees, and mathematical number theory techniques.

Key Highlights & Architecture

150+ competitive programming solutions covering graphs, number theory, greedy, and dynamic programming

Engineering Challenges

Eliminating TLE (Time Limit Exceeded) on large graph test cases with fast input/output optimization and asymptotic pruning.
Deriving invariant properties in greedy and constructive algorithm problems.

Key Engineering Decisions

Fast I/O & Precomputation: Factoring sieve precomputation and fast stream decoupling into competitive templates.
Modular Solution Organization: Categorized code by contest rounds and algorithmic techniques for quick revision.

Result & Outcome

Solved 150+ competitive algorithmic problems, building rigorous problem-solving habits that directly inform my software engineering design.

Technologies & Tools

C++CAlgorithmsData StructuresCompetitive Programming

GitHub Profile ← All Projects