Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/meet57/leetcode
https://github.com/meet57/leetcode
Last synced: about 2 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/meet57/leetcode
- Owner: Meet57
- Created: 2024-10-24T22:05:03.000Z (3 months ago)
- Default Branch: main
- Last Pushed: 2024-11-02T20:21:26.000Z (2 months ago)
- Last Synced: 2024-11-02T20:26:23.477Z (2 months ago)
- Language: Python
- Size: 85.9 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
## Tree
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0110-balanced-binary-tree) |
| [0226-invert-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0226-invert-binary-tree) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Meet57/LeetCode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0543-diameter-of-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0543-diameter-of-binary-tree) |
## Depth-First Search
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0110-balanced-binary-tree) |
| [0226-invert-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0226-invert-binary-tree) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Meet57/LeetCode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0543-diameter-of-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0543-diameter-of-binary-tree) |
| [0733-flood-fill](https://github.com/Meet57/LeetCode/tree/master/0733-flood-fill) |
## Binary Tree
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0110-balanced-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0110-balanced-binary-tree) |
| [0226-invert-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0226-invert-binary-tree) |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Meet57/LeetCode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0543-diameter-of-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0543-diameter-of-binary-tree) |
## Binary Search Tree
| |
| ------- |
| [0235-lowest-common-ancestor-of-a-binary-search-tree](https://github.com/Meet57/LeetCode/tree/master/0235-lowest-common-ancestor-of-a-binary-search-tree) |
| [0278-first-bad-version](https://github.com/Meet57/LeetCode/tree/master/0278-first-bad-version) |
| [0792-binary-search](https://github.com/Meet57/LeetCode/tree/master/0792-binary-search) |
## Array
| |
| ------- |
| [0169-majority-element](https://github.com/Meet57/LeetCode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/Meet57/LeetCode/tree/master/0217-contains-duplicate) |
| [0733-flood-fill](https://github.com/Meet57/LeetCode/tree/master/0733-flood-fill) |
| [0792-binary-search](https://github.com/Meet57/LeetCode/tree/master/0792-binary-search) |
## Breadth-First Search
| |
| ------- |
| [0104-maximum-depth-of-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0104-maximum-depth-of-binary-tree) |
| [0226-invert-binary-tree](https://github.com/Meet57/LeetCode/tree/master/0226-invert-binary-tree) |
| [0733-flood-fill](https://github.com/Meet57/LeetCode/tree/master/0733-flood-fill) |
## Matrix
| |
| ------- |
| [0733-flood-fill](https://github.com/Meet57/LeetCode/tree/master/0733-flood-fill) |
## Hash Table
| |
| ------- |
| [0141-linked-list-cycle](https://github.com/Meet57/LeetCode/tree/master/0141-linked-list-cycle) |
| [0169-majority-element](https://github.com/Meet57/LeetCode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/Meet57/LeetCode/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/Meet57/LeetCode/tree/master/0242-valid-anagram) |
| [0383-ransom-note](https://github.com/Meet57/LeetCode/tree/master/0383-ransom-note) |
| [0409-longest-palindrome](https://github.com/Meet57/LeetCode/tree/master/0409-longest-palindrome) |
## String
| |
| ------- |
| [0067-add-binary](https://github.com/Meet57/LeetCode/tree/master/0067-add-binary) |
| [0125-valid-palindrome](https://github.com/Meet57/LeetCode/tree/master/0125-valid-palindrome) |
| [0242-valid-anagram](https://github.com/Meet57/LeetCode/tree/master/0242-valid-anagram) |
| [0383-ransom-note](https://github.com/Meet57/LeetCode/tree/master/0383-ransom-note) |
| [0409-longest-palindrome](https://github.com/Meet57/LeetCode/tree/master/0409-longest-palindrome) |
## Sorting
| |
| ------- |
| [0169-majority-element](https://github.com/Meet57/LeetCode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/Meet57/LeetCode/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/Meet57/LeetCode/tree/master/0242-valid-anagram) |
## Two Pointers
| |
| ------- |
| [0125-valid-palindrome](https://github.com/Meet57/LeetCode/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/Meet57/LeetCode/tree/master/0141-linked-list-cycle) |
| [0908-middle-of-the-linked-list](https://github.com/Meet57/LeetCode/tree/master/0908-middle-of-the-linked-list) |
## Linked List
| |
| ------- |
| [0141-linked-list-cycle](https://github.com/Meet57/LeetCode/tree/master/0141-linked-list-cycle) |
| [0206-reverse-linked-list](https://github.com/Meet57/LeetCode/tree/master/0206-reverse-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/Meet57/LeetCode/tree/master/0908-middle-of-the-linked-list) |
## Interactive
| |
| ------- |
| [0278-first-bad-version](https://github.com/Meet57/LeetCode/tree/master/0278-first-bad-version) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/Meet57/LeetCode/tree/master/0169-majority-element) |
| [0383-ransom-note](https://github.com/Meet57/LeetCode/tree/master/0383-ransom-note) |
## Math
| |
| ------- |
| [0067-add-binary](https://github.com/Meet57/LeetCode/tree/master/0067-add-binary) |
| [0070-climbing-stairs](https://github.com/Meet57/LeetCode/tree/master/0070-climbing-stairs) |
## Dynamic Programming
| |
| ------- |
| [0070-climbing-stairs](https://github.com/Meet57/LeetCode/tree/master/0070-climbing-stairs) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/Meet57/LeetCode/tree/master/0070-climbing-stairs) |
## Greedy
| |
| ------- |
| [0409-longest-palindrome](https://github.com/Meet57/LeetCode/tree/master/0409-longest-palindrome) |
## Recursion
| |
| ------- |
| [0206-reverse-linked-list](https://github.com/Meet57/LeetCode/tree/master/0206-reverse-linked-list) |
## Divide and Conquer
| |
| ------- |
| [0169-majority-element](https://github.com/Meet57/LeetCode/tree/master/0169-majority-element) |
## Bit Manipulation
| |
| ------- |
| [0067-add-binary](https://github.com/Meet57/LeetCode/tree/master/0067-add-binary) |
## Simulation
| |
| ------- |
| [0067-add-binary](https://github.com/Meet57/LeetCode/tree/master/0067-add-binary) |