Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/sendoud/leetcode-daily-practice
https://github.com/sendoud/leetcode-daily-practice
Last synced: 2 days ago
JSON representation
- Host: GitHub
- URL: https://github.com/sendoud/leetcode-daily-practice
- Owner: SendouD
- Created: 2023-09-21T14:39:33.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-08-24T15:52:36.000Z (5 months ago)
- Last Synced: 2024-08-24T17:22:50.772Z (5 months ago)
- Language: Java
- Size: 181 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
A collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
# LeetCode Topics
## Array
| |
| ------- |
| [0064-minimum-path-sum](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0064-minimum-path-sum) |
| [0217-contains-duplicate](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0217-contains-duplicate) |
| [0560-subarray-sum-equals-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0560-subarray-sum-equals-k) |
| [1428-jump-game-iii](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1428-jump-game-iii) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/2394-count-subarrays-with-score-less-than-k) |
## Hash Table
| |
| ------- |
| [0217-contains-duplicate](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0217-contains-duplicate) |
| [0560-subarray-sum-equals-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0560-subarray-sum-equals-k) |
## Sorting
| |
| ------- |
| [0217-contains-duplicate](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0217-contains-duplicate) |
## Linked List
| |
| ------- |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
## Math
| |
| ------- |
| [0007-reverse-integer](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0007-reverse-integer) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
## Binary Search
| |
| ------- |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/2394-count-subarrays-with-score-less-than-k) |
## Sliding Window
| |
| ------- |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/2394-count-subarrays-with-score-less-than-k) |
## Prefix Sum
| |
| ------- |
| [0560-subarray-sum-equals-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0560-subarray-sum-equals-k) |
| [2394-count-subarrays-with-score-less-than-k](https://github.com/SendouD/Leetcode-daily-practice/tree/master/2394-count-subarrays-with-score-less-than-k) |
## Dynamic Programming
| |
| ------- |
| [0064-minimum-path-sum](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0064-minimum-path-sum) |
## Matrix
| |
| ------- |
| [0064-minimum-path-sum](https://github.com/SendouD/Leetcode-daily-practice/tree/master/0064-minimum-path-sum) |
## Depth-First Search
| |
| ------- |
| [1428-jump-game-iii](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1428-jump-game-iii) |
## Breadth-First Search
| |
| ------- |
| [1428-jump-game-iii](https://github.com/SendouD/Leetcode-daily-practice/tree/master/1428-jump-game-iii) |