Skip to content

rampravesh19-96/javascript-dsa-patterns

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

JavaScript & TypeScript DSA Patterns

A pattern-based collection of JavaScript/TypeScript solutions for LeetCode problems and frontend interview utility implementations.

This repository is organized for fast review, recruiter scanning, and steady interview prep. It highlights practical TypeScript fluency, strong problem-solving fundamentals, and frontend-adjacent JavaScript utility work in one clean codebase.

Why This Repo

  • Shows problem solving across core interview patterns
  • Shows TypeScript fluency with readable, interview-explainable code
  • Shows frontend interview preparation beyond framework APIs
  • Covers both DSA and JavaScript utility coding

Tech Stack

  • TypeScript
  • Node.js
  • JavaScript
  • Data Structures & Algorithms

Progress

  • Total target: 210
  • Total problems implemented: 210
  • Pending: 0

Category Count

Order Category Count
01 Arrays & Hash Map 27
02 Two Pointers 18
03 Sliding Window 13
04 Stack & Queue 17
05 Binary Search 15
06 Linked List 15
07 Trees 21
08 Heap / Priority Queue 15
09 Backtracking 6
10 Graphs 18
11 Intervals 5
12 Dynamic Programming 15
13 JavaScript / Frontend Utilities 21
Total All Categories 210

Featured Frontend Utility Problems

  • Debounce
  • Throttle
  • Memoize
  • Promise Time Limit
  • Cache With Time Limit
  • Flatten Deeply Nested Array
  • Group By
  • Chunk Array
  • Function Composition
  • LRU Cache

How To Run

npm install
npm run typecheck
npm run problem src/01-arrays-hashmap/001-two-sum.ts

You can run any individual solution file the same way:

npm run problem src/05-binary-search/163-median-of-two-sorted-arrays.ts

Repo Structure

javascript-dsa-patterns/
├── docs/
│   ├── patterns.md
│   ├── progress-tracker.md
│   └── study-plan.md
├── src/
│   ├── 01-arrays-hashmap/
│   ├── 02-two-pointers/
│   ├── 03-sliding-window/
│   ├── 04-stack-queue/
│   ├── 05-binary-search/
│   ├── 06-linked-list/
│   ├── 07-trees/
│   ├── 08-heap-priority-queue/
│   ├── 09-backtracking/
│   ├── 10-graphs/
│   ├── 11-intervals/
│   ├── 12-dynamic-programming/
│   ├── 13-javascript-frontend-utilities/
│   └── utils/
├── package.json
├── tsconfig.json
└── README.md

Notes

  • Every problem file includes the title, link, difficulty, pattern, approach, time complexity, space complexity, and a small runTests() example.
  • Premium-style questions such as Meeting Rooms, Meeting Rooms II, Walls and Gates, and Number of Connected Components in an Undirected Graph are implemented with standard interview-friendly TypeScript signatures.
  • Shared helpers live in src/utils/ for linked lists, trees, and priority queues.

Resume Line

Solved 200+ JavaScript/TypeScript DSA problems across arrays, strings, hash maps, sliding window, stacks, trees, graphs, dynamic programming, and frontend utility implementations.

About

No description, website, or topics provided.

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

No releases published

Packages

 
 
 

Contributors