Loading repository data…
Loading repository data…
Tamilvendhan23 / repository
Welcome to the Leetcode Solutions repository! This repository is dedicated to providing solutions to various Leetcode problems, primarily written in Java (77.3%) and Python (22.7%).
A transparent discovery signal based on current public GitHub metadata.
This score does not audit code, security, maintainers, documentation quality, or suitability. Verify the repository and its current documentation before adoption.
Welcome to the Leetcode Solutions repository! This repository contains solutions to a wide range of LeetCode problems to help with learning algorithms and preparing for technical interviews.
Each problem is organized in its own folder, typically named with the problem number and title (for example 0008-string-to-integer-atoi/). Solutions are written primarily in Java and Python. Use the folder names to quickly locate solutions for specific problems.
Example layout:
0008-string-to-integer-atoi/
0009-palindrome-number/
...
3169-count-days-without-meetings/
README.md
javac/java or using an IDE. Run Python solutions with python3.Contributions are welcome! If you would like to:
please open a pull request. If you plan to contribute many files, open an issue first to discuss structure and naming.
This repository is provided for learning and practice. If you want a specific license, add a LICENSE file (e.g., MIT) or let me know and I can add one for you.
Happy coding!
| Problem Name | Difficulty |
|---|---|
| 0033-search-in-rotated-sorted-array | Medium |
| 0048-rotate-image | Medium |
| 0153-find-minimum-in-rotated-sorted-array | Medium |
| 0154-find-minimum-in-rotated-sorted-array-ii | Hard |
| 0396-rotate-function | Medium |
| 0874-walking-robot-simulation | Medium |
| 1288-remove-covered-intervals | Medium |
| 1301-number-of-paths-with-max-score | Hard |
| 1306-jump-game-iii | Medium |
| 1331-rank-transform-of-an-array | Easy |
| 1340-jump-game-v | Hard |
| 1345-jump-game-iv | Hard |
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| 1536-minimum-swaps-to-arrange-a-binary-grid | Medium |
| 1559-detect-cycles-in-2d-grid | Medium |
| 1582-special-positions-in-a-binary-matrix | Easy |
| 1594-maximum-non-negative-product-in-a-matrix | Medium |
| 1665-minimum-initial-energy-to-finish-tasks | Hard |
| 1674-minimum-moves-to-make-array-complementary | Medium |
| 1722-minimize-hamming-distance-after-swap-operations | Medium |
| 1727-largest-submatrix-with-rearrangements | Medium |
| 1732-find-the-highest-altitude | Easy |
| 1752-check-if-array-is-sorted-and-rotated | Easy |
| 1833-maximum-ice-cream-bars | Medium |
| 1840-maximum-building-height | Hard |
| 1846-maximum-element-after-decreasing-and-rearranging | Medium |
| 1848-minimum-distance-to-the-target-element | Easy |
| 1855-maximum-distance-between-a-pair-of-values | Medium |
| 1861-rotating-the-box | Medium |
| 1878-get-biggest-three-rhombus-sums-in-a-grid | Medium |
| 1886-determine-whether-matrix-can-be-obtained-by-rotation | Easy |
| 1914-cyclically-rotating-a-grid | Medium |
| 1967-number-of-strings-that-appear-as-substrings-in-word | Easy |
| 1979-find-greatest-common-divisor-of-array | Easy |
| 1980-find-unique-binary-string | Medium |
| 2033-minimum-operations-to-make-a-uni-value-grid | Medium |
| 2078-two-furthest-houses-with-different-colors | Easy |
| 2126-destroying-asteroids | Medium |
| 2144-minimum-cost-of-buying-candies-with-discount | Easy |
| 2161-partition-array-according-to-given-pivot | Medium |
| 2196-create-binary-tree-from-descriptions | Medium |
| 2452-words-within-two-edits-of-dictionary | Medium |
| 2463-minimum-total-distance-traveled | Hard |
| 2515-shortest-distance-to-target-string-in-a-circular-array | Easy |
| 2540-minimum-common-value | Easy |
| 2553-separate-the-digits-in-an-array | Easy |
| 2573-find-the-string-with-lcp | Hard |
| 2574-left-and-right-sum-differences | Easy |
| 2615-sum-of-distances | Medium |
| 2657-find-the-prefix-common-array-of-two-arrays | Medium |
| 2751-robot-collisions | Hard |
| 2770-maximum-number-of-jumps-to-reach-the-last-index | Medium |
| 2784-check-if-array-is-good | Easy |
| 2812-find-the-safest-path-in-a-grid | Medium |
| 2906-construct-product-matrix | Medium |
| 2946-matrix-similarity-after-cyclic-shifts | Easy |
| 3020-find-the-maximum-number-of-elements-in-subset | Medium |
| 3043-find-the-length-of-the-longest-common-prefix | Medium |
| 3070-count-submatrices-with-top-left-element-and-sum-less-than-k | Medium |
| 3093-longest-common-suffix-queries | Hard |
| 3161-block-placement-queries | Hard |
| 3212-count-submatrices-with-equal-frequency-of-x-and-y | Medium |
| 3225-maximum-score-from-grid-operations | Hard |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3296-minimum-number-of-seconds-to-make-mountain-height-zero | Medium |
| 3300-minimum-element-after-replacement-with-digit-sum | Easy |
| 3312-sorted-gcd-pair-queries | Hard |
| 3336-find-the-number-of-subsequences-with-equal-gcd | Hard |
| 3418-maximum-amount-of-money-robot-can-earn | Medium |
| 3464-maximize-the-distance-between-points-on-a-square | Hard |
| [3488-closest-equal-element-queries](https:/ |