Naitik Singh Bhadoriya

Skip to content

Projects

room / two-sum.tsAN

1function twoSum(nums: number[], target: number) {

2 const seen = new Map<number, number>();

3 for (let i = 0; i < nums.length; i++) {

4 const need = target - nums[i];Aarav

5 if (seen.has(need)) return [seen.get(need)!, i];

6 seen.set(nums[i], i);Naitik

8}

Run3 / 3 tests passed12 ms

CodeSyncReal-time collaborative code editor

TypeScriptWebSocketsCRDTNode.js

ChessMindA chess engine that searches millions of moves

C++MinimaxAlpha-betaBitboards

ResumeIQnaitik_resume.pdfvs Backend Intern JD

Matched skills

PythonREST APIsSQLGitReact

Missing

DockerAWSCI/CD

Suggestions

Add one quantified result to your top project, for example how many requests it handles.

ResumeIQScores a resume against a job description

PythonNLPspaCyFastAPI

MarketPulseNews sentiment next to price, in one dashboard

PythonNLPFastAPINext.js

Stack

What I reach for

Playground

Sorting algorithms, live

Algorithm Size Speed

Comparisons 0Writes 0

Terminal

Type help

Now

Studying computer scienceIndore
Building full-stack productsDaily
Practising algorithmsLeetCode

Education

B.Tech, Computer ScienceIn progress
Data structures and algorithmsFocus
Operating systems and networksFocus

Writing

Learning data science without drowning in tutorialsOct 2026
What 100 LeetCode problems taught me about thinkingAug 2026
My first full-stack app, and everything that brokeMar 2026

Research

Text classification on small datasets: how far a simple model goesOngoing
Finding patterns in stock price data with Python2025