Welcome to my collection of LeetCode solutions! This repository contains my implementations for a variety of problems from LeetCode, covering different data structures, algorithms, and problem-solving techniques. Each solution is carefully crafted to be efficient and easy to understand.
This repository serves as a personal log of my journey through LeetCode, where I continuously work to improve my problem-solving skills. You'll find solutions written in multiple programming languages, with a focus on Python and C++. Each problem is clearly categorized by its difficulty level (Easy, Medium, Hard) and topic (e.g., Arrays, Stack, Hash Tables, LL, BST).
- Improve Problem-Solving Skills: By consistently solving problems, I aim to sharpen my problem-solving abilities and prepare for technical interviews.
- Master Data Structures and Algorithms: This collection helps me to deepen my understanding of key data structures and algorithms, which are crucial for coding interviews.
- Document Learning: I use this repository to document my thought process and the different approaches I take to solve each problem.
Each problem's solution is stored in a separate file, with the following structure:
- Problem Description: A brief summary of the problem, along with a link to the original LeetCode problem.
- Approach: Explanation of the approach taken to solve the problem.
- Solution: The code implementation, optimized for efficiency.
Feel free to explore the solutions, and if you're working on a similar problem, you might find different perspectives or techniques that can help you.
| 1086-divisor-game |
| 2503-longest-subarray-with-maximum-bitwise-and |
| 2533-bitwise-xor-of-all-pairings |
| 3462-vowels-game-in-a-string |
| 1086-divisor-game |
| 3462-vowels-game-in-a-string |
| 0149-max-points-on-a-line |
| 0830-largest-triangle-area |
| 0919-projection-area-of-3d-shapes |
| 0547-number-of-provinces |
| 0871-keys-and-rooms |
| 1325-path-with-maximum-probability |
| 1576-reorder-routes-to-make-all-paths-lead-to-the-city-zero |
| 2220-find-all-possible-recipes-from-given-supplies |
| 1325-path-with-maximum-probability |
| 0204-count-primes |
| 2307-replace-non-coprime-numbers-in-array |
| 2903-insert-greatest-common-divisors-in-linked-list |
| 3768-check-if-digits-are-equal-in-string-after-operations-i |
| 0023-merge-k-sorted-lists |
| 0053-maximum-subarray |
| 0169-majority-element |
| 0215-kth-largest-element-in-an-array |
| 0493-reverse-pairs |
| 0225-implement-stack-using-queues |
| 0232-implement-queue-using-stacks |
| 0859-design-circular-deque |
| 3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 0812-rotate-string |
| 1524-string-matching-in-an-array |
| 2292-counting-words-with-a-given-prefix |
| 3309-count-prefix-and-suffix-pairs-i |
| 0128-longest-consecutive-sequence |
| 0547-number-of-provinces |
| 1396-count-servers-that-communicate |
| 0451-sort-characters-by-frequency |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 3790-fruits-into-baskets-ii |
| 0023-merge-k-sorted-lists |
| 0493-reverse-pairs |
| 0493-reverse-pairs |
| 2413-smallest-number-in-infinite-set |
| 3790-fruits-into-baskets-ii |
| 0070-climbing-stairs |
| 1013-fibonacci-number |
| 1236-n-th-tribonacci-number |
| 0062-unique-paths |
| 1993-sum-of-all-subset-xor-totals |
| 2324-find-triangular-sum-of-an-array |
| 3768-check-if-digits-are-equal-in-string-after-operations-i |
| 0095-unique-binary-search-trees-ii |
| 0096-unique-binary-search-trees |
| 0098-validate-binary-search-tree |
| 0099-recover-binary-search-tree |
| 0450-delete-node-in-a-bst |
| 0783-search-in-a-binary-search-tree |
| 0215-kth-largest-element-in-an-array |
| 0374-guess-number-higher-or-lower |
| 0937-online-stock-span |
| 1477-product-of-the-last-k-numbers |
| 3309-count-prefix-and-suffix-pairs-i |
| 3309-count-prefix-and-suffix-pairs-i |
| 2220-find-all-possible-recipes-from-given-supplies |