This repository contains my solutions to LeetCode problems categorized into JavaScript, Data Structures and Algorithms (DSA), and database-specific challenges. 🌟 Features: | JavaScript Solutions: Clear and concise implementations of LeetCode problems in JavaScript. | | DSA Implementations: Efficient algorithms and data structures tailored for LeetCode's challenges. | | Database Queries: SQL solutions to database-specific problems on LeetCode. |
| 0345-reverse-vowels-of-a-string |
| 0392-is-subsequence |
| 0443-string-compression |
| 1798-max-number-of-k-sum-pairs |
| 0345-reverse-vowels-of-a-string |
| 0392-is-subsequence |
| 0443-string-compression |
| 1146-greatest-common-divisor-of-strings |
| 1567-maximum-number-of-vowels-in-a-substring-of-given-length |
| 0940-fruit-into-baskets |
| 1798-max-number-of-k-sum-pairs |
| 1798-max-number-of-k-sum-pairs |
| 0392-is-subsequence |
| 1586-longest-subarray-of-1s-after-deleting-one-element |
| 1046-max-consecutive-ones-iii |
| 0724-find-pivot-index |
| 1046-max-consecutive-ones-iii |
| 1146-greatest-common-divisor-of-strings |
| 0605-can-place-flowers |
| 0042-trapping-rain-water |
| 1319-unique-number-of-occurrences |
| 1392-find-the-difference-of-two-arrays |
| 0076-minimum-window-substring |
| 1319-unique-number-of-occurrences |
| 1392-find-the-difference-of-two-arrays |
| 1777-determine-if-two-strings-are-close |
| 1777-determine-if-two-strings-are-close |
| 1777-determine-if-two-strings-are-close |
| 0394-decode-string |
| 2470-removing-stars-from-a-string |
| 0042-trapping-rain-water |
| 0042-trapping-rain-water |
| 0042-trapping-rain-water |
| 0076-minimum-window-substring |
| 0232-implement-queue-using-stacks |
| 0232-implement-queue-using-stacks |
| 0957-minimum-add-to-make-parentheses-valid |
| 1648-minimum-insertions-to-balance-a-parentheses-string |