How ashutosh-6603/leetcode-solutions works
This repository is a set of independent JavaScript solutions to LeetCode problems, not a single application or shared library. The user workflow is to choose a problem’s file, provide its expected inputs, and run that file’s solution to obtain a result; the sampled files also include local example calls. Solutions cover arrays, strings, numeric problems, and data structures or other techniques. Files do not import one another, and the README is empty, so no inter-solution call graph or common runtime is evidenced.
Components 34
Array Algorithms
- Two Sum
leetcode-1.js - Container Area
leetcode-11.js - Pascal Triangle
leetcode-118.js - Pascal Row
leetcode-119.js - Stock Profit
leetcode-121.js - Stock Trades
leetcode-122.js - Gas Circuit
leetcode-134.js - Candy Allocation
leetcode-135.js - Three Sum
leetcode-15.js - Sorted Two Sum
leetcode-167.js - Rotate Array
leetcode-189.js - Subarray Sum
leetcode-209.js - Array Duplicates
leetcode-217.js - Nearby Duplicate
leetcode-219.js - Product Except Self
leetcode-238.js - Remove Duplicates
leetcode-26.js - Remove Element
leetcode-27.js - Move Zeroes
leetcode-283.js - Sudoku Validation
leetcode-36.js - Rainwater Trap
leetcode-42.js - Jump Game II
leetcode-45.js - Jump Game
leetcode-55.js - Harmonious Subsequence
leetcode-594.js - Limited Duplicates
leetcode-80.js - Merge Sorted Arrays
leetcode-88.js
String Algorithms
- Integer to Roman
leetcode-12.js - Palindrome Check
leetcode-125.js - Roman to Integer
leetcode-13.js - Common Prefix
leetcode-14.js - Vowel Window
leetcode-1456.js - Reverse Words
leetcode-151.js - Phone Combinations
leetcode-17.js - Repeated DNA
leetcode-187.js
Data Structures
- Randomized Set
leetcode-380.js