01 / CONTEXT 1ST YEAR UNDERGRADUATE • CS & AI

Curious about how software operates at its foundations.

I am a first-year computer science undergraduate at St. Mary's Rehabilitation University × Newton School of Technology. My work centers on understanding core computational principles from the ground up—building primarily in Python and Java, with practical experience in JavaScript for the web.

My interest in computing began with curiosity about how logical instructions translate into working programs. I value clarity over cleverness, systematic problem analysis, and deliberate practice.

02 / ASPIRATION COMPETITIVE PROGRAMMING

The Road to ICPC

Approaching competitive programming not as a credential, but as a rigorous crucible for algorithmic thinking.

My ultimate competitive ambition is to represent my institution at the International Collegiate Programming Contest (ICPC) alongside my university peers.

I view competitive programming as a training ground for precision. Under the clock, there is no room for vague assumptions: algorithms must be provably correct, time bounds must respect asymptotic limits, and edge cases must be reasoned through before submission.

This aspiration drives my day-to-day practice. I use platforms like LeetCode and Codeforces to systematically study data structures, dissect problem constraints, and learn to write deterministic code under pressure.

TRAINING LEDGERS & ACTIVE PROFILES
LEETCODE @Huma1d
Focused on foundational data structures, array techniques, binary search mechanics, and recursive patterns.
Active Practice (2026+) Inspect Profile
CODEFORCES @huma1dd
Participating in live contest rounds, practicing time-constrained deduction, and upsolving challenging problems.
Active Contestant (2026+) Inspect Profile
GITHUB @huma1d
Personal code repository workspace and version control history spanning back to 2021.
Account Since 2021 Inspect Repositories
03 / TECHNICAL ARSENAL LANGUAGES & APPLIED CAPABILITIES

Languages & Applied Foundations

A restrained and factual inventory of languages actively used for academic computing, problem solving, and software exploration.

A

Primary Languages

The two languages in which I have the most active daily practice and foundational comfort.

Python

Used for algorithmic problem solving, scripting, data manipulation, and rapid computational prototypes.

Java

Applied to Object-Oriented Programming (OOP) concepts, class hierarchies, and algorithm implementations.

B

Applied Web

Frontend web technologies practiced for building client-side interfaces and interactive tools.

JavaScript

DOM manipulation, state management, event modeling, and client-side simulation logic.

HTML5 & CSS3

Semantic markup, responsive layouts with Flexbox and CSS Grid, and custom property design systems.

C

Tooling & Practices

Development environment, version control workflows, and core academic concepts.

Git & GitHub

Account active since 2021. Basic version control, branching, committing, and repository management.

Core CS Foundations

Asymptotic time/space complexity analysis, basic linear data structures, and algorithmic patterns.

04 / THE WORKSHOP PROJECTS IN PROGRESS

THE WORKSHOP

A workspace for things worth building.

I believe in publishing software only when it is thoughtfully architected, thoroughly tested, and solves a real problem. Rather than showcasing placeholder templates or unfinished repositories, my focus during this foundational first year is on writing clean, purposeful code.

Upcoming projects in Python, Java, and web systems will be documented here as they reach completed milestones. In the meantime, all active code commits and explorations live directly on GitHub.

ACTIVE REPOSITORY SPACE: github.com/huma1d
Follow Work on GitHub
05 / CHRONICLE EDUCATIONAL PROGRESSION

Educational Chronicle

The chronological path of academic training and independent technical exploration.

2026 — PRESENT CURRENT DEGREE

St. Mary's Rehabilitation University × Newton School of Technology

B.Tech in Computer Science & Artificial Intelligence

Joined in 2026 as a first-year undergraduate. Immersed in foundational computational concepts, core programming, discrete logic, and active collegiate peer learning.

  • Primary academic development in Python and Java.
  • Daily problem-solving practice on LeetCode and Codeforces with an eye toward ICPC.
2023 — 2025 COMPLETED

Aligarh Muslim University (AMU)

Senior Secondary Education — Class 11th & 12th

Completed two years of rigorous senior secondary schooling at AMU with an academic emphasis on physics, chemistry, and mathematics (PCM).

  • Developed mathematical curiosity and logical reasoning.
  • Solidified the analytical interest that directly led into computer science.
2021 ACCOUNT GENESIS

GitHub Community

First Steps in Code & Version Control

Created my GitHub account in 2021, beginning the process of learning version control, understanding repository workflows, and exploring software projects.

06 / LABORATORY INTERACTIVE CS BENCH — EXPLORATION ANNEX

The Computational Laboratory

An interactive computational annex exploring foundational algorithmic mechanics. A hands-on workbench examining asymptotic behavior and mathematical search invariants.

EXPERIMENT 01

Invariant Binary Search

ASYNCHRONOUS COMPLEXITY: O(log₂ N)

Theoretical Principle: Binary search operates by maintaining a strict invariant: if the target exists within a sorted array, it must reside within the index range $[L, R]$. By evaluating the midpoint element $M = \lfloor (L + R) / 2 \rfloor$, half of the remaining candidate elements can be eliminated in a single comparison.

SORTED ARRAY STATE [N = 13]:
SEARCH INTERVAL [L, R] [0, 12] 13 elements remaining
MIDPOINT EVALUATION (M) M = 6 (arr[6] = 46) M = ⌊(0 + 12) / 2⌋
COMPARISONS PERFORMED 0 Theoretical Max: ⌈log₂(13)⌉ = 4
STEP ELIMINATION ANALYSIS AWAITING EXECUTION

The initial search space covers indices 0 through 12. Click Step Forward to evaluate the first midpoint element.

EXPERIMENT 02

Complexity Growth Comparator: O(N) vs. O(log₂ N)

ASYMPTOTIC ANALYSIS

Theoretical Principle: As dataset size $N$ expands, linear scan complexity $O(N)$ grows in direct proportion to the input, while binary search $O(\log_2 N)$ grows logarithmically. At large values of $N$, logarithmic scaling reduces hundreds of thousands of operations to a negligible constant factor.

DATASET SIZE (N):
LINEAR SCAN — O(N) Worst Case: N comparisons
1,024

Must evaluate every single item in worst-case or un-found scenarios.

BINARY SEARCH — O(log₂ N) Worst Case: ⌈log₂(N + 1)⌉ comparisons
11

Halves the remaining candidate set at every single decision node.

For N = 1,024, Binary Search requires ~93× fewer comparisons than a Linear Scan.
07 / DISPATCH DIRECT COMMUNICATION

Direct Dispatch

Have a question about my work, want to discuss an algorithmic problem, or simply want to say hello? I am always happy to connect directly.