A personal repository showcasing Java, MySQL, and Data Structures & Algorithms practice through solutions from LeetCode . Continuously maintained for interview and placement preparation.
coding-practice/
├── Java/ # Java solutions to LeetCode problems
├── MySQL/ # MySQL solutions to LeetCode database problems
└── README.md
- Strengthen core Data Structures & Algorithms concepts.
- Practice SQL through LeetCode database problems.
- Build consistency through regular coding practice.
- Prepare for technical interviews and placement coding rounds.
This repository is updated regularly as new problems are solved.
- GitHub: @Dinesh8778
- LinkedIn: dinesh-kumar-s-it
- Portfolio: dinesh8778.github.io/portfolio
⭐ "Consistency beats intensity — one problem at a time."
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | Easy |
| Problem Name | Difficulty |
|---|---|
| 0628-maximum-product-of-three-numbers | Easy |
| 0713-subarray-product-less-than-k | Medium |
| 1464-maximum-product-of-two-elements-in-an-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 0713-subarray-product-less-than-k | Medium |
| Problem Name | Difficulty |
|---|---|
| 0713-subarray-product-less-than-k | Medium |
| Problem Name | Difficulty |
|---|---|
| 0713-subarray-product-less-than-k | Medium |
| Problem Name | Difficulty |
|---|---|
| 0197-rising-temperature | Easy |
| Problem Name | Difficulty |
|---|---|
| 0009-palindrome-number | Easy |
| 0628-maximum-product-of-three-numbers | Easy |
| 3014-minimum-number-of-pushes-to-type-word-i | Easy |
| 3536-maximum-product-of-two-digits | Easy |
| Problem Name | Difficulty |
|---|---|
| 0338-counting-bits | Easy |
| Problem Name | Difficulty |
|---|---|
| 0338-counting-bits | Easy |
| 0401-binary-watch | Easy |
| 0461-hamming-distance | Easy |
| 0476-number-complement | Easy |
| Problem Name | Difficulty |
|---|---|
| 0628-maximum-product-of-three-numbers | Easy |
| 1464-maximum-product-of-two-elements-in-an-array | Easy |
| 3016-minimum-number-of-pushes-to-type-word-ii | Medium |
| 3517-smallest-palindromic-rearrangement-i | Medium |
| 3536-maximum-product-of-two-digits | Easy |
| Problem Name | Difficulty |
|---|---|
| 1464-maximum-product-of-two-elements-in-an-array | Easy |
| Problem Name | Difficulty |
|---|---|
| 3014-minimum-number-of-pushes-to-type-word-i | Easy |
| 3016-minimum-number-of-pushes-to-type-word-ii | Medium |
| 3517-smallest-palindromic-rearrangement-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 3016-minimum-number-of-pushes-to-type-word-ii | Medium |
| 3517-smallest-palindromic-rearrangement-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 3014-minimum-number-of-pushes-to-type-word-i | Easy |
| 3016-minimum-number-of-pushes-to-type-word-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 3016-minimum-number-of-pushes-to-type-word-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0401-binary-watch | Easy |