This repository contains my solutions to LeetCode problems implemented in C++.
I solve problems daily to strengthen my Data Structures & Algorithms and prepare for Software Engineering interviews.
Not all my problems are uploaded yet will update them slowly.
- Problems Solved: 400+
- Language: C++
- Platform: LeetCode
- Focus: DSA | Competitive Programming | Interview Prep
https://leetcode.com/u/darkspirit1/
| Problem Name | Difficulty |
|---|---|
| 0053-maximum-subarray | |
| 0169-majority-element | Easy |
| 3653-xor-after-range-multiplication-queries-i | Medium |
| 3655-xor-after-range-multiplication-queries-ii | Hard |
| 3737-count-subarrays-with-majority-element-i | Medium |
| 3739-count-subarrays-with-majority-element-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | |
| 0061-rotate-list | Medium |
| 0876-middle-of-the-linked-list | Easy |
| 2095-delete-the-middle-node-of-a-linked-list | Medium |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| 3510-minimum-pair-removal-to-sort-array-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0021-merge-two-sorted-lists | |
| 0231-power-of-two |
| Problem Name | Difficulty |
|---|---|
| 0169-majority-element | Easy |
| 0767-reorganize-string | |
| 1189-maximum-number-of-balloons | Easy |
| 2833-furthest-point-from-origin | Easy |
| 3737-count-subarrays-with-majority-element-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 1622-fancy-sequence | Hard |
| 3161-block-placement-queries | Hard |
| 3454-separate-squares-ii | Hard |
| 3691-maximum-total-subarray-value-ii | Hard |
| 3721-longest-balanced-subarray-ii | Hard |
| 3737-count-subarrays-with-majority-element-i | Medium |
| 3739-count-subarrays-with-majority-element-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 2092-find-all-people-with-secret | Hard |
| 2977-minimum-cost-to-convert-string-ii | Hard |
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 2452-words-within-two-edits-of-dictionary | Medium |
| 2977-minimum-cost-to-convert-string-ii | Hard |
| 3043-find-the-length-of-the-longest-common-prefix | Medium |
| 3093-longest-common-suffix-queries | Hard |
| Problem Name | Difficulty |
|---|---|
| 2977-minimum-cost-to-convert-string-ii | Hard |
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 3510-minimum-pair-removal-to-sort-array-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 3510-minimum-pair-removal-to-sort-array-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0020-valid-parentheses | Easy |
| 0085-maximal-rectangle | Hard |
| 0496-next-greater-element-i | Easy |
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| 2751-robot-collisions | Hard |
| Problem Name | Difficulty |
|---|---|
| 0085-maximal-rectangle | Hard |
| 0496-next-greater-element-i | Easy |
| Problem Name | Difficulty |
|---|---|
| 0104-maximum-depth-of-binary-tree | Easy |
| 0226-invert-binary-tree | Easy |
| 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 |
| 2092-find-all-people-with-secret | Hard |
| 3558-number-of-ways-to-assign-edge-weights-i | Medium |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0104-maximum-depth-of-binary-tree | Easy |
| 0226-invert-binary-tree | Easy |
| 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 |
| 2092-find-all-people-with-secret | Hard |
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3629-minimum-jumps-to-reach-end-via-prime-teleportation | 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 |
| 2092-find-all-people-with-secret | Hard |
| 2573-find-the-string-with-lcp | Hard |
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 0131-palindrome-partitioning | Medium |
| 1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n | Medium |
| 1980-find-unique-binary-string | Medium |
| 3955-valid-binary-strings-with-cost-limit | Medium |
| Problem Name | Difficulty |
|---|---|
| 3600-maximize-spanning-tree-stability-with-upgrades | Hard |
| Problem Name | Difficulty |
|---|---|
| 1622-fancy-sequence | Hard |
| 2069-walking-robot-simulation-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 3020-find-the-maximum-number-of-elements-in-subset | Medium |
| 3546-equal-sum-grid-partition-i | Medium |
| 3548-equal-sum-grid-partition-ii | Hard |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| 3954-sum-of-compatible-numbers-in-range-i | Easy |
| 3955-valid-binary-strings-with-cost-limit | Medium |
| Problem Name | Difficulty |
|---|---|
| 0796-rotate-string | Easy |
| 3474-lexicographically-smallest-generated-string | Hard |
| Problem Name | Difficulty |
|---|---|
| 3464-maximize-the-distance-between-points-on-a-square | Hard |
| Problem Name | Difficulty |
|---|---|
| 3629-minimum-jumps-to-reach-end-via-prime-teleportation | Medium |
| Problem Name | Difficulty |
|---|---|
| 0104-maximum-depth-of-binary-tree | Easy |
| 0226-invert-binary-tree | Easy |
| 2196-create-binary-tree-from-descriptions | Medium |
| 3558-number-of-ways-to-assign-edge-weights-i | Medium |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0104-maximum-depth-of-binary-tree | Easy |
| 0226-invert-binary-tree | Easy |
| 2196-create-binary-tree-from-descriptions | Medium |
| Problem Name | Difficulty |
|---|---|
| 3161-block-placement-queries | Hard |
| Problem Name | Difficulty |
|---|---|
| 1833-maximum-ice-cream-bars | Medium |
| Problem Name | Difficulty |
|---|---|
| 3737-count-subarrays-with-majority-element-i | Medium |
| 3739-count-subarrays-with-majority-element-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 3454-separate-squares-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 3620-network-recovery-pathways | Hard |