A collection of LeetCode solutions implemented in TypeScript. This repository contains my solutions to various LeetCode problems, organized by problem ID and name.
Each problem is organized in its own directory following the format:
{problem_id}-{problem_name}/ βββ README.md # Problem description and constraints βββ Solution.md # Solution explanation and approach βββ {problem_id}-{problem_name}.ts # TypeScript solution implementation - Navigate to the problem directory you're interested in
- Read the
README.mdfor problem description and constraints - Check the
Solution.mdfor detailed solution explanation, approach, and complexity analysis - Review the
{problem_id}-{problem_name}.tsfile for the TypeScript implementation
π Arrays
-
1498. Number of Subsequences That Satisfy the Given Sum Condition
-
3480. Maximize Subarrays After Removing One Conflicting Pair
-
3505. Minimum Operations to Make Elements Within K Subarrays Equal
-
3529. Count Cells in Overlapping Horizontal and Vertical Substrings
-
3572. Maximize Y Sum by Picking a Triplet of Distinct X Values
-
3529. Count Cells In Overlapping Horizontal And Vertical Substrings
-
3529. Count Cells In Overlapping Horizontal And Vertical Substrings
-
3423. Maximum Difference Between Adjacent Elements in a Circular Array
-
1498. Number Of Subsequences That Satisfy The Given Sum Condition
-
1498. Number Of Subsequences That Satisfy The Given Sum Condition
π€ Strings
-
2434. Using a Robot to Print the Lexicographically Smallest String
-
3306. Count of Substrings Containing Every Vowel and K Consonants II
-
3403. Find the Lexicographically Largest String from the Box I
-
3598. Longest Common Prefix Between Adjacent Strings After Removals
-
3306. Count Of Substrings Containing Every Vowel And K Consonants Ii
-
3403. Find The Lexicographically Largest String From The Box I
-
3306. Count Of Substrings Containing Every Vowel And K Consonants Ii
-
3403. Find The Lexicographically Largest String From The Box I
π³ Trees & Graphs
π Hash Tables & Dictionaries
π’ Math & Bit Manipulation
-
3509. Maximum Product of Subsequences with an Alternating Sum Equal to K
-
3373. Maximize The Number Of Target Nodes After Connecting Trees Ii
-
3405. Count The Number Of Arrays With K Matching Adjacent Elements
-
3423. Maximum Difference Between Adjacent Elements In A Circular Array
-
3480. Maximize Subarrays After Removing One Conflicting Pair
-
3505. Minimum Operations To Make Elements Within K Subarrays Equal
-
3509. Maximum Product Of Subsequences With An Alternating Sum Equal To K
-
3572. Maximize Ysum By Picking A Triplet Of Distinct Xvalues
-
3584. Maximum Product Of First And Last Elements Of A Subsequence
-
3598. Longest Common Prefix Between Adjacent Strings After Removals
-
3373. Maximize The Number Of Target Nodes After Connecting Trees Ii
-
3405. Count The Number Of Arrays With K Matching Adjacent Elements
-
3423. Maximum Difference Between Adjacent Elements In A Circular Array
-
3480. Maximize Subarrays After Removing One Conflicting Pair
-
3505. Minimum Operations To Make Elements Within K Subarrays Equal
-
3509. Maximum Product Of Subsequences With An Alternating Sum Equal To K
-
3572. Maximize Ysum By Picking A Triplet Of Distinct Xvalues
-
3584. Maximum Product Of First And Last Elements Of A Subsequence
-
3598. Longest Common Prefix Between Adjacent Strings After Removals
πΎ System Design
π SQL
While this is primarily my personal collection of solutions, I welcome any suggestions or improvements. Feel free to:
- Report bugs or issues
- Suggest optimizations
- Share alternative solutions
This project is licensed under the MIT License - see the LICENSE file for details.
Solutions are automatically synced using LeetHub 3.0, a Chrome extension that automatically pushes your LeetCode solutions to GitHub.