https://github.com/yashksaini-coder/october-leetcode-daily-2024
October Daily Leetcode Problems 2024
https://github.com/yashksaini-coder/october-leetcode-daily-2024
Last synced: 2 months ago
JSON representation
October Daily Leetcode Problems 2024
- Host: GitHub
- URL: https://github.com/yashksaini-coder/october-leetcode-daily-2024
- Owner: yashksaini-coder
- License: apache-2.0
- Created: 2024-10-01T08:26:43.000Z (9 months ago)
- Default Branch: main
- Last Pushed: 2024-12-27T01:19:12.000Z (6 months ago)
- Last Synced: 2025-03-25T10:51:17.686Z (3 months ago)
- Language: Java
- Homepage: https://yashksaini-coder.github.io/October-Leetcode-Daily-2024/
- Size: 110 KB
- Stars: 11
- Watchers: 0
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
![]()
## Solutions
| Leetcode Problem | Problem Statement | Solution |
|---:|:-----|:----:|
| [567](https://leetcode.com/problems/permutation-in-string/) | Permutation in String | [Solution](./567-permutation-in-string/permutation-in-string.java) |
| [632](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/) | Smallest Range Covering Elements from K Lists | [Solution](./632-smallest-range-covering-elements-from-k-lists/smallest-range-covering-elements-from-k-lists.java) |
| [670](https://leetcode.com/problems/maximum-swap/) | Maximum Swap | [Solution](./670-maximum-swap/maximum-swap.java) |
| [921](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/) | Minimum Add to Make Parentheses Valid | [Solution](./921-minimum-add-to-make-parentheses-valid/minimum-add-to-make-parentheses-valid.java) |
| [951](https://leetcode.com/problems/flip-equivalent-binary-trees/) | Flip Equivalent Binary Trees | [Solution](./951-flip-equivalent-binary-trees/flip-equivalent-binary-trees.java) |
| [962](https://leetcode.com/problems/maximum-width-ramp/) | Maximum Width Ramp | [Solution](./962-maximum-width-ramp/maximum-width-ramp.java) |
| [1106](https://leetcode.com/problems/parsing-a-boolean-expression/) | Parsing a Boolean Expression | [Solution](./1106-parsing-a-boolean-expression/parsing-a-boolean-expression.java) |
| [1302](https://leetcode.com/problems/delete-characters-to-make-fancy-string/) | Delete Characters to Make Fancy String | [Solution](./1302-delete-characters-to-make-fancy-string/delete-characters-to-make-fancy-string.java) |
| [1331](https://leetcode.com/problems/rank-transform-of-an-array/) | Rank Transform of an Array | [Solution](./1331-rank-transform-of-an-array/rank-transform-of-an-array.java) |
| [1402](https://leetcode.com/problems/count-square-submatrices-with-all-ones/) | Count Square Submatrices With all Ones | [Solution](./1402-count-square-submatrices-with-all-ones/count-square-submatrices-with-all-ones.java) |
| [1405](https://leetcode.com/problems/longest-happy-string/) | Longest Happy String | [Solution](./1405-longest-happy-string/longest-happy-string.java) |
| [1497](https://leetcode.com/problems/check-if-array-pairs-are-divisible-by-k/) | Check IF Array Pairs Are Divisible by K | [Solution](./1497-check-if-array-pairs-are-divisible-by-k/check-if-array-pairs-are-divisible-by-k.java) |
| [1545](https://leetcode.com/problems/find-kth-bit-in-nth-binary-string/) | Find Kth Bit in Nth Binary String | [Solution](./1545-find-kth-bit-in-nth-binary-string/find-kth-bit-in-nth-binary-string.java) |
| [1590](https://leetcode.com/problems/make-sum-divisible-by-p/) | Make Sum Divisible by P | [Solution](./1590-make-sum-divisible-by-p/make-sum-divisible-by-p.java) |
| [1593](https://leetcode.com/problems/split-a-string-into-the-max-number-of-unique-substrings/) | Split a String Into the Max Number of Unique Substrings | [Solution](./1593-split-a-string-into-the-max-number-of-unique-substrings/split-a-string-into-the-max-number-of-unique-substrings.java) |
| [1766](https://leetcode.com/problems/minimum-number-of-removals-to-make-mountain-array/) | Minimum Number of Removals to Make Mountain Array | [Solution](./1766-minimum-number-of-removals-to-make-mountain-array/minimum-number-of-removals-to-make-mountain-array.java) |
| [1813](https://leetcode.com/problems/sentence-similarity-iii/) | Sentence Similarity III | [Solution](./1813-sentence-similarity-iii/sentence-similarity-iii.java) |
| [1942](https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/) | The Number of the Smallest Unoccupied Chair | [Solution](./1942-the-number-of-the-smallest-unoccupied-chair/the-number-of-the-smallest-unoccupied-chair.java) |
| [1963](https://leetcode.com/problems/minimum-number-of-swaps-to-make-the-string-balanced/) | Minimum Number of Swaps to Make the String Balanced | [Solution](./1963-minimum-number-of-swaps-to-make-the-string-balanced/minimum-number-of-swaps-to-make-the-string-balanced.java) |
| [2044](https://leetcode.com/problems/count-number-of-maximum-bitwise-or-subsets/) | Count Number of Maximum Bitwise or Subsets | [Solution](./2044-count-number-of-maximum-bitwise-or-subsets/count-number-of-maximum-bitwise-or-subsets.java) |
| [2406](https://leetcode.com/problems/divide-intervals-into-minimum-number-of-groups/) | Divide Intervals Into Minimum Number of Groups | [Solution](./2406-divide-intervals-into-minimum-number-of-groups/divide-intervals-into-minimum-number-of-groups.java) |
| [2491](https://leetcode.com/problems/divide-players-into-teams-of-equal-skill/) | Divide Players Into Teams of Equal Skill | [Solution](./2491-divide-players-into-teams-of-equal-skill/divide-players-into-teams-of-equal-skill.java) |
| [2530](https://leetcode.com/problems/maximal-score-after-applying-k-operations/) | Maximal Score After Applying K Operations | [Solution](./2530-maximal-score-after-applying-k-operations/maximal-score-after-applying-k-operations.java) |
| [2554](https://leetcode.com/problems/minimum-total-distance-traveled/) | Minimum Total Distance Traveled | [Solution](./2554-minimum-total-distance-traveled/minimum-total-distance-traveled.java) |
| [2583](https://leetcode.com/problems/kth-largest-sum-in-a-binary-tree/) | Kth Largest Sum in a Binary Tree | [Solution](./2583-kth-largest-sum-in-a-binary-tree/kth-largest-sum-in-a-binary-tree.java) |
| [2586](https://leetcode.com/problems/longest-square-streak-in-an-array/) | Longest Square Streak in an Array | [Solution](./2586-longest-square-streak-in-an-array/longest-square-streak-in-an-array.java) |
| [2641](https://leetcode.com/problems/cousins-in-binary-tree-ii/) | Cousins in Binary Tree II | [Solution](./2641-cousins-in-binary-tree-ii/cousins-in-binary-tree-ii.java) |
| [2696](https://leetcode.com/problems/minimum-string-length-after-removing-substrings/) | Minimum String Length After Removing Substrings | [Solution](./2696-minimum-string-length-after-removing-substrings/minimum-string-length-after-removing-substrings.java) |
| [2794](https://leetcode.com/problems/maximum-number-of-moves-in-a-grid/) | Maximum Number of Moves in a Grid | [Solution](./2794-maximum-number-of-moves-in-a-grid/maximum-number-of-moves-in-a-grid.java) |
| [2938](https://leetcode.com/problems/separate-black-and-white-balls/) | Separate Black and White Balls | [Solution](./2938-separate-black-and-white-balls/separate-black-and-white-balls.java) |
| [NaN](https://leetcode.com/problems//) | | [Solution](./scripts/.java) |