https://github.com/yashksaini-coder/september-leetcode-daily-2024
September Daily Leetcode Problems 2024
https://github.com/yashksaini-coder/september-leetcode-daily-2024
Last synced: 2 months ago
JSON representation
September Daily Leetcode Problems 2024
- Host: GitHub
- URL: https://github.com/yashksaini-coder/september-leetcode-daily-2024
- Owner: yashksaini-coder
- License: mit
- Created: 2024-09-01T12:27:22.000Z (10 months ago)
- Default Branch: main
- Last Pushed: 2024-11-04T18:15:59.000Z (8 months ago)
- Last Synced: 2025-03-25T10:51:18.283Z (3 months ago)
- Language: Java
- Homepage: https://yashksaini-coder.github.io/September-Leetcode-Daily-2024/
- Size: 493 KB
- Stars: 12
- 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 |
|---:|:-----|:----:|
| [179](https://leetcode.com/problems/largest-number/) | Largest Number | [Solution](./179-largest-number/largest-number.java) |
| [214](https://leetcode.com/problems/shortest-palindrome/) | Shortest Palindrome | [Solution](./214-shortest-palindrome/shortest-palindrome.java) |
| [241](https://leetcode.com/problems/different-ways-to-add-parentheses/) | Different Ways to Add Parentheses | [Solution](./241-different-ways-to-add-parentheses/different-ways-to-add-parentheses.java) |
| [386](https://leetcode.com/problems/lexicographical-numbers/) | Lexicographical Numbers | [Solution](./386-lexicographical-numbers/lexicographical-numbers.java) |
| [432](https://leetcode.com/problems/all-oone-data-structure/) | All Oone Data Structure | [Solution](./432-all-oone-data-structure/all-oone-data-structure.java) |
| [440](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order/) | K Th Smallest in Lexicographical Order | [Solution](./440-k-th-smallest-in-lexicographical-order/k-th-smallest-in-lexicographical-order.java) |
| [539](https://leetcode.com/problems/minimum-time-difference/) | Minimum Time Difference | [Solution](./539-minimum-time-difference/minimum-time-difference.java) |
| [641](https://leetcode.com/problems/design-circular-deque/) | Design Circular Deque | [Solution](./641-design-circular-deque/design-circular-deque.java) |
| [725](https://leetcode.com/problems/split-linked-list-in-parts/) | Split Linked List in Parts | [Solution](./725-split-linked-list-in-parts/split-linked-list-in-parts.java) |
| [729](https://leetcode.com/problems/my-calendar-i/) | My Calendar I | [Solution](./729-my-calendar-i/my-calendar-i.java) |
| [731](https://leetcode.com/problems/my-calendar-ii/) | My Calendar II | [Solution](./731-my-calendar-ii/my-calendar-ii.java) |
| [874](https://leetcode.com/problems/walking-robot-simulation/) | Walking Robot Simulation | [Solution](./874-walking-robot-simulation/walking-robot-simulation.java) |
| [884](https://leetcode.com/problems/uncommon-words-from-two-sentences/) | Uncommon Words from Two Sentences | [Solution](./884-uncommon-words-from-two-sentences/uncommon-words-from-two-sentences.java) |
| [1310](https://leetcode.com/problems/xor-queries-of-a-subarray/) | Xor Queries of a Subarray | [Solution](./1310-xor-queries-of-a-subarray/xor-queries-of-a-subarray.java) |
| [1367](https://leetcode.com/problems/linked-list-in-binary-tree/) | Linked List in Binary Tree | [Solution](./1367-linked-list-in-binary-tree/linked-list-in-binary-tree.java) |
| [1371](https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts/) | Find the Longest Substring Containing Vowels in Even Counts | [Solution](./1371-find-the-longest-substring-containing-vowels-in-even-counts/find-the-longest-substring-containing-vowels-in-even-counts.java) |
| [1381](https://leetcode.com/problems/design-a-stack-with-increment-operation/) | Design a Stack With Increment Operation | [Solution](./1381-design-a-stack-with-increment-operation/design-a-stack-with-increment-operation.java) |
| [1684](https://leetcode.com/problems/count-the-number-of-consistent-strings/) | Count the Number of Consistent Strings | [Solution](./1684-count-the-number-of-consistent-strings/count-the-number-of-consistent-strings.java) |
| [1894](https://leetcode.com/problems/find-the-student-that-will-replace-the-chalk/) | Find the Student That will Replace the Chalk | [Solution](./1894-find-the-student-that-will-replace-the-chalk/find-the-student-that-will-replace-the-chalk.java) |
| [1945](https://leetcode.com/problems/sum-of-digits-of-string-after-convert/) | Sum of Digits of String After Convert | [Solution](./1945-sum-of-digits-of-string-after-convert/sum-of-digits-of-string-after-convert.java) |
| [2028](https://leetcode.com/problems/find-missing-observations/) | Find Missing Observations | [Solution](./2028-find-missing-observations/find-missing-observations.java) |
| [2132](https://leetcode.com/problems/convert-1d-array-into-2d-array/) | Convert 1d Array Into 2d Array | [Solution](./2132-convert-1d-array-into-2d-array/convert-1d-array-into-2d-array.java) |
| [2220](https://leetcode.com/problems/minimum-bit-flips-to-convert-number/) | Minimum Bit Flips to Convert Number | [Solution](./2220-minimum-bit-flips-to-convert-number/minimum-bit-flips-to-convert-number.java) |
| [2326](https://leetcode.com/problems/spiral-matrix-iv/) | Spiral Matrix IV | [Solution](./2326-spiral-matrix-iv/spiral-matrix-iv.java) |
| [2416](https://leetcode.com/problems/sum-of-prefix-scores-of-strings/) | Sum of Prefix Scores of Strings | [Solution](./2416-sum-of-prefix-scores-of-strings/sum-of-prefix-scores-of-strings.java) |
| [2419](https://leetcode.com/problems/longest-subarray-with-maximum-bitwise-and/) | Longest Subarray With Maximum Bitwise and | [Solution](./2419-longest-subarray-with-maximum-bitwise-and/longest-subarray-with-maximum-bitwise-and.java) |
| [2707](https://leetcode.com/problems/extra-characters-in-a-string/) | Extra Characters in a String | [Solution](./2707-extra-characters-in-a-string/extra-characters-in-a-string.java) |
| [2807](https://leetcode.com/problems/insert-greatest-common-divisors-in-linked-list/) | Insert Greatest Common Divisors in Linked List | [Solution](./2807-insert-greatest-common-divisors-in-linked-list/insert-greatest-common-divisors-in-linked-list.java) |
| [3043](https://leetcode.com/problems/find-the-length-of-the-longest-common-prefix/) | Find the Length of the Longest Common Prefix | [Solution](./3043-find-the-length-of-the-longest-common-prefix/find-the-length-of-the-longest-common-prefix.java) |
| [3217](https://leetcode.com/problems/delete-nodes-from-linked-list-present-in-array/) | Delete Nodes from Linked List Present in Array | [Solution](./3217-delete-nodes-from-linked-list-present-in-array/delete-nodes-from-linked-list-present-in-array.java) |
| [NaN](https://leetcode.com/problems//) | | [Solution](./scripts/.java) |