LeetCode in Python 🐍 | Solving challenges, sharpening skills 🚀
| Problem Name | Difficulty |
|---|---|
| 0933-number-of-recent-calls | Easy |
| 1483-kth-ancestor-of-a-tree-node | Hard |
| Problem Name | Difficulty |
|---|---|
| 0933-number-of-recent-calls | Easy |
| Problem Name | Difficulty |
|---|---|
| 0933-number-of-recent-calls | Easy |
| Problem Name | Difficulty |
|---|---|
| 0069-sqrtx | Easy |
| 0167-two-sum-ii-input-array-is-sorted | Medium |
| 0287-find-the-duplicate-number | Medium |
| 0852-peak-index-in-a-mountain-array | Medium |
| 1483-kth-ancestor-of-a-tree-node | Hard |
| 2812-find-the-safest-path-in-a-grid | Medium |
| 2824-count-pairs-whose-sum-is-less-than-target | Easy |
| 3620-network-recovery-pathways | Hard |
| 3633-earliest-finish-time-for-land-and-water-rides-i | Easy |
| 3635-earliest-finish-time-for-land-and-water-rides-ii | Medium |
| Problem Name | Difficulty |
|---|---|
| 0019-remove-nth-node-from-end-of-list | Medium |
| 0141-linked-list-cycle | Easy |
| 0142-linked-list-cycle-ii | 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 |
| Problem Name | Difficulty |
|---|---|
| 0069-sqrtx | Easy |
| 0202-happy-number | Easy |
| 0231-power-of-two | Easy |
| 1281-subtract-the-product-and-sum-of-digits-of-an-integer | Easy |
| 1344-angle-between-hands-of-a-clock | Medium |
| 1840-maximum-building-height | Hard |
| 2963-count-the-number-of-good-partitions | Hard |
| 3558-number-of-ways-to-assign-edge-weights-i | Medium |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0191-number-of-1-bits | Easy |
| 0231-power-of-two | Easy |
| 0287-find-the-duplicate-number | Medium |
| 1009-complement-of-base-10-integer | Easy |
| 1483-kth-ancestor-of-a-tree-node | Hard |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 0700-search-in-a-binary-search-tree | Easy |
| 1483-kth-ancestor-of-a-tree-node | Hard |
| 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 |
|---|---|
| 0700-search-in-a-binary-search-tree | Easy |
| Problem Name | Difficulty |
|---|---|
| 0700-search-in-a-binary-search-tree | Easy |
| 2196-create-binary-tree-from-descriptions | Medium |
| Problem Name | Difficulty |
|---|---|
| 1483-kth-ancestor-of-a-tree-node | Hard |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| 3620-network-recovery-pathways | Hard |
| 3699-number-of-zigzag-arrays-i | Hard |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 3020-find-the-maximum-number-of-elements-in-subset | Medium |
| 3751-total-waviness-of-numbers-in-range-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0724-find-pivot-index | Easy |
| 1732-find-the-highest-altitude | Easy |
| 2574-left-and-right-sum-differences | Easy |
| 3699-number-of-zigzag-arrays-i | Hard |
| 3737-count-subarrays-with-majority-element-i | Medium |
| 3739-count-subarrays-with-majority-element-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 2161-partition-array-according-to-given-pivot | Medium |
| 3612-process-string-with-special-operations-i | Medium |
| 3614-process-string-with-special-operations-ii | Hard |
| 3838-weighted-word-mapping | Easy |
| Problem Name | Difficulty |
|---|---|
| 3691-maximum-total-subarray-value-ii | Hard |
| 3737-count-subarrays-with-majority-element-i | Medium |
| 3739-count-subarrays-with-majority-element-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3620-network-recovery-pathways | Hard |
| 3691-maximum-total-subarray-value-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 1483-kth-ancestor-of-a-tree-node | Hard |
| 2492-minimum-score-of-a-path-between-two-cities | Medium |
| 3558-number-of-ways-to-assign-edge-weights-i | Medium |
| 3559-number-of-ways-to-assign-edge-weights-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 1483-kth-ancestor-of-a-tree-node | Hard |
| 2492-minimum-score-of-a-path-between-two-cities | Medium |
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 2130-maximum-twin-sum-of-a-linked-list | Medium |
| Problem Name | Difficulty |
|---|---|
| 1189-maximum-number-of-balloons | Easy |
| 1833-maximum-ice-cream-bars | Medium |
| 3737-count-subarrays-with-majority-element-i | Medium |
| Problem Name | Difficulty |
|---|---|
| 0191-number-of-1-bits | Easy |
| 3737-count-subarrays-with-majority-element-i | Medium |
| 3739-count-subarrays-with-majority-element-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 3737-count-subarrays-with-majority-element-i | Medium |
| 3739-count-subarrays-with-majority-element-ii | Hard |
| Problem Name | Difficulty |
|---|---|
| 1358-number-of-substrings-containing-all-three-characters | Medium |
| Problem Name | Difficulty |
|---|---|
| 2492-minimum-score-of-a-path-between-two-cities | Medium |
| 2812-find-the-safest-path-in-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 2812-find-the-safest-path-in-a-grid | Medium |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| Problem Name | Difficulty |
|---|---|
| 2492-minimum-score-of-a-path-between-two-cities | Medium |
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 3286-find-a-safe-walk-through-a-grid | Medium |
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 3620-network-recovery-pathways | Hard |
| Problem Name | Difficulty |
|---|---|
| 0231-power-of-two | Easy |
| Problem Name | Difficulty |
|---|---|
| 2963-count-the-number-of-good-partitions | Hard |