This repository contains my solutions to LeetCode problems implemented in Java.
I consistently practice Data Structures and Algorithms to improve problem-solving skills and prepare for technical interviews.
- 💻 Language: Java
- 📈 Daily DSA Practice
- 🧠 Focus on clean and optimized solutions
- 📂 Organized by topics
- ⭐ Problems Solved: 100+
- 🔥 Current Focus: DSA in Java
To build strong problem-solving skills and crack top tech internships.
https://leetcode.com/u/mukul_parashar/
⭐ If you find this helpful, feel free to star the repo!
| 0042-trapping-rain-water |
| 0062-unique-paths |
| 0063-unique-paths-ii |
| 0072-edit-distance |
| 0120-triangle |
| 0198-house-robber |
| 0410-split-array-largest-sum |
| 0509-fibonacci-number |
| 1143-longest-common-subsequence |
| 0410-split-array-largest-sum |
| 1386-cinema-seat-allocation |
| 1561-maximum-number-of-coins-you-can-get |
| 1833-maximum-ice-cream-bars |
| 1838-frequency-of-the-most-frequent-element |
| 0303-range-sum-query-immutable |
| 0410-split-array-largest-sum |
| 1480-running-sum-of-1d-array |
| 1838-frequency-of-the-most-frequent-element |
| 0278-first-bad-version |
| 0374-guess-number-higher-or-lower |
| 0042-trapping-rain-water |
| 0094-binary-tree-inorder-traversal |
| 0144-binary-tree-preorder-traversal |
| 0042-trapping-rain-water |
| 0050-powx-n |
| 0231-power-of-two |
| 0326-power-of-three |
| 0342-power-of-four |
| 0509-fibonacci-number |
| 1823-find-the-winner-of-the-circular-game |
| 1823-find-the-winner-of-the-circular-game |
| 0566-reshape-the-matrix |
| 0832-flipping-an-image |
| 1260-shift-2d-grid |
| 1823-find-the-winner-of-the-circular-game |
| 3069-distribute-elements-into-two-arrays-i |
| 1704-determine-if-string-halves-are-alike |
| 1833-maximum-ice-cream-bars |
| 1561-maximum-number-of-coins-you-can-get |
| 0004-median-of-two-sorted-arrays |
| 0191-number-of-1-bits |
| 0240-search-a-2d-matrix-ii |
| 0003-longest-substring-without-repeating-characters |
| 1838-frequency-of-the-most-frequent-element |
| 0509-fibonacci-number |
| 0102-binary-tree-level-order-traversal |
| 0104-maximum-depth-of-binary-tree |
| 0111-minimum-depth-of-binary-tree |
| 0207-course-schedule |
| 0210-course-schedule-ii |
| 0547-number-of-provinces |
| 0994-rotting-oranges |
| 0098-validate-binary-search-tree |
| 0450-delete-node-in-a-bst |
| 0700-search-in-a-binary-search-tree |
| 0701-insert-into-a-binary-search-tree |
| 0547-number-of-provinces |
| 0207-course-schedule |
| 0210-course-schedule-ii |
| 0547-number-of-provinces |
| 0207-course-schedule |
| 0210-course-schedule-ii |
| 0062-unique-paths |
| 3116-kth-smallest-amount-with-single-denomination-combination |
| 0208-implement-trie-prefix-tree |
| 0303-range-sum-query-immutable |
| 0208-implement-trie-prefix-tree |
| 0720-longest-word-in-dictionary |
| 3116-kth-smallest-amount-with-single-denomination-combination |
| 3658-gcd-of-odd-and-even-sums |
| 1464-maximum-product-of-two-elements-in-an-array |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |
| 0028-find-the-index-of-the-first-occurrence-in-a-string |