This repository contains solutions for LeetCode problems implemented in TypeScript (JavaScript) and Python.
The purpose of this repository is to provide clear, efficient, and well-explained solutions for various LeetCode problems. Each solution is accompanied by detailed comments that explain the logic and approach used to solve the problem.
- TypeScript
- JavaScript
- Python
- Java
Each problem has its own directory, and within each problem's directory, you will find a solution file for both TypeScript and JavaScript. Feel free to explore and use these solutions to understand and solve LeetCode problems more effectively.
Contributions are welcome! If you have a better solution or a solution to a problem that is not currently in the repository, feel free to make a pull request.
| Problem Name | Difficulty |
|---|---|
| 1545-find-kth-bit-in-nth-binary-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 0657-robot-return-to-origin | Easy |
| 0874-walking-robot-simulation | Medium |
| 1545-find-kth-bit-in-nth-binary-string | Medium |
| 1914-cyclically-rotating-a-grid | Medium |
| 2069-walking-robot-simulation-ii | Medium |
| 2075-decode-the-slanted-ciphertext | Medium |
| 2553-separate-the-digits-in-an-array | Easy |
| 2751-robot-collisions | Hard |
| 2946-matrix-similarity-after-cyclic-shifts | Easy |
| 3653-xor-after-range-multiplication-queries-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 1871-jump-game-vii | Medium |
| 1888-minimum-number-of-flips-to-make-the-binary-string-alternating | Medium |
| Problem Name | Difficulty |
|---|---|
| 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n | Medium |
| 1980-find-unique-binary-string | Medium |
| Problem Name | Difficulty |
|---|---|
| 1009-complement-of-base-10-integer | Easy |
| 2657-find-the-prefix-common-array-of-two-arrays | Medium |
| Problem Name | Difficulty |
|---|---|
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| 1559-detect-cycles-in-2d-grid | Medium |
| 1722-minimize-hamming-distance-after-swap-operations | Medium |
| 2573-find-the-string-with-lcp | Hard |
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 1878-get-biggest-three-rhombus-sums-in-a-grid | Medium |
| 3296-minimum-number-of-seconds-to-make-mountain-height-zero | Medium |
| Problem Name | Difficulty |
|---|---|
| 1622-fancy-sequence | Hard |
| 2069-walking-robot-simulation-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 1622-fancy-sequence | Hard |
| Problem Name | Difficulty |
|---|---|
| 0061-rotate-list | Medium |
| 1855-maximum-distance-between-a-pair-of-values | Medium |
| 1861-rotating-the-box | Medium |
| 2540-minimum-common-value | Easy |
| 3643-flip-square-submatrix-vertically | Easy |
| Problem Name | Difficulty |
|---|---|
| 3546-equal-sum-grid-partition-i | Medium |
| 3548-equal-sum-grid-partition-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 3474-lexicographically-smallest-generated-string | Hard |
| Problem Name | Difficulty |
|---|---|
| 2751-robot-collisions | Hard |
| Problem Name | Difficulty |
|---|---|
| 3653-xor-after-range-multiplication-queries-i | Medium |
| 3655-xor-after-range-multiplication-queries-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 1306-jump-game-iii | Medium |
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| 1559-detect-cycles-in-2d-grid | Medium |
| 1722-minimize-hamming-distance-after-swap-operations | Medium |
| Problem Name | Difficulty |
|---|---|
| 2452-words-within-two-edits-of-dictionary | Medium |
| 3043-find-the-length-of-the-longest-common-prefix | Medium |
| Problem Name | Difficulty |
|---|---|
| 2833-furthest-point-from-origin | Easy |
| Problem Name | Difficulty |
|---|---|
| 3464-maximize-the-distance-between-points-on-a-square | Hard |
| Problem Name | Difficulty |
|---|---|
| 1306-jump-game-iii | Medium |
| 1345-jump-game-iv | Hard |
| 1391-check-if-there-is-a-valid-path-in-a-grid | Medium |
| 1559-detect-cycles-in-2d-grid | Medium |
| 3629-minimum-jumps-to-reach-end-via-prime-teleportation | Medium |
| Problem Name | Difficulty |
|---|---|
| 0061-rotate-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 3629-minimum-jumps-to-reach-end-via-prime-teleportation | Medium |