Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/kms1601/leetcode
Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
https://github.com/kms1601/leetcode
Last synced: 8 days ago
JSON representation
Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
- Host: GitHub
- URL: https://github.com/kms1601/leetcode
- Owner: kms1601
- Created: 2024-05-14T02:00:21.000Z (6 months ago)
- Default Branch: main
- Last Pushed: 2024-08-20T02:55:20.000Z (3 months ago)
- Last Synced: 2024-08-21T03:54:29.796Z (3 months ago)
- Language: Java
- Size: 208 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leetcode
Collection of LeetCode questions to ace the coding interview! - Created using [LeetHub v2](https://github.com/arunbhardwaj/LeetHub-2.0)
# Array
| |
| ------- |
| [0075-sort-colors](https://github.com/kms1601/Leetcode/tree/master/0075-sort-colors) |
# Two Pointers
| |
| ------- |
| [0075-sort-colors](https://github.com/kms1601/Leetcode/tree/master/0075-sort-colors) |
# Sorting
| |
| ------- |
| [0075-sort-colors](https://github.com/kms1601/Leetcode/tree/master/0075-sort-colors) |
# Database
| |
| ------- |
| [0584-find-customer-referee](https://github.com/kms1601/Leetcode/tree/master/0584-find-customer-referee) |
| [0595-big-countries](https://github.com/kms1601/Leetcode/tree/master/0595-big-countries) |
| [1258-article-views-i](https://github.com/kms1601/Leetcode/tree/master/1258-article-views-i) |
| [1827-invalid-tweets](https://github.com/kms1601/Leetcode/tree/master/1827-invalid-tweets) |
| [1908-recyclable-and-low-fat-products](https://github.com/kms1601/Leetcode/tree/master/1908-recyclable-and-low-fat-products) |
# LeetCode Topics
## Tree
| |
| ------- |
| [0101-symmetric-tree](https://github.com/kms1601/Leetcode/tree/master/0101-symmetric-tree) |
| [0783-search-in-a-binary-search-tree](https://github.com/kms1601/Leetcode/tree/master/0783-search-in-a-binary-search-tree) |
## Depth-First Search
| |
| ------- |
| [0101-symmetric-tree](https://github.com/kms1601/Leetcode/tree/master/0101-symmetric-tree) |
| [2121-find-if-path-exists-in-graph](https://github.com/kms1601/Leetcode/tree/master/2121-find-if-path-exists-in-graph) |
## Breadth-First Search
| |
| ------- |
| [0101-symmetric-tree](https://github.com/kms1601/Leetcode/tree/master/0101-symmetric-tree) |
| [2121-find-if-path-exists-in-graph](https://github.com/kms1601/Leetcode/tree/master/2121-find-if-path-exists-in-graph) |
## Binary Tree
| |
| ------- |
| [0101-symmetric-tree](https://github.com/kms1601/Leetcode/tree/master/0101-symmetric-tree) |
| [0783-search-in-a-binary-search-tree](https://github.com/kms1601/Leetcode/tree/master/0783-search-in-a-binary-search-tree) |
## Binary Search Tree
| |
| ------- |
| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |
| [0783-search-in-a-binary-search-tree](https://github.com/kms1601/Leetcode/tree/master/0783-search-in-a-binary-search-tree) |
| [1352-maximum-profit-in-job-scheduling](https://github.com/kms1601/Leetcode/tree/master/1352-maximum-profit-in-job-scheduling) |
| [1832-minimum-operations-to-make-a-subsequence](https://github.com/kms1601/Leetcode/tree/master/1832-minimum-operations-to-make-a-subsequence) |
| [2634-minimum-common-value](https://github.com/kms1601/Leetcode/tree/master/2634-minimum-common-value) |
## Array
| |
| ------- |
| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |
| [0118-pascals-triangle](https://github.com/kms1601/Leetcode/tree/master/0118-pascals-triangle) |
| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |
| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
| [0502-ipo](https://github.com/kms1601/Leetcode/tree/master/0502-ipo) |
| [0561-array-partition](https://github.com/kms1601/Leetcode/tree/master/0561-array-partition) |
| [0747-min-cost-climbing-stairs](https://github.com/kms1601/Leetcode/tree/master/0747-min-cost-climbing-stairs) |
| [1352-maximum-profit-in-job-scheduling](https://github.com/kms1601/Leetcode/tree/master/1352-maximum-profit-in-job-scheduling) |
| [1832-minimum-operations-to-make-a-subsequence](https://github.com/kms1601/Leetcode/tree/master/1832-minimum-operations-to-make-a-subsequence) |
| [2163-kth-distinct-string-in-an-array](https://github.com/kms1601/Leetcode/tree/master/2163-kth-distinct-string-in-an-array) |
| [2398-check-if-matrix-is-x-matrix](https://github.com/kms1601/Leetcode/tree/master/2398-check-if-matrix-is-x-matrix) |
| [2634-minimum-common-value](https://github.com/kms1601/Leetcode/tree/master/2634-minimum-common-value) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
## Hash Table
| |
| ------- |
| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |
| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
| [1832-minimum-operations-to-make-a-subsequence](https://github.com/kms1601/Leetcode/tree/master/1832-minimum-operations-to-make-a-subsequence) |
| [2163-kth-distinct-string-in-an-array](https://github.com/kms1601/Leetcode/tree/master/2163-kth-distinct-string-in-an-array) |
| [2634-minimum-common-value](https://github.com/kms1601/Leetcode/tree/master/2634-minimum-common-value) |
## String
| |
| ------- |
| [2163-kth-distinct-string-in-an-array](https://github.com/kms1601/Leetcode/tree/master/2163-kth-distinct-string-in-an-array) |
## Counting
| |
| ------- |
| [2163-kth-distinct-string-in-an-array](https://github.com/kms1601/Leetcode/tree/master/2163-kth-distinct-string-in-an-array) |
## Bit Manipulation
| |
| ------- |
| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
## Queue
| |
| ------- |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
## Sliding Window
| |
| ------- |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
## Prefix Sum
| |
| ------- |
| [3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i](https://github.com/kms1601/Leetcode/tree/master/3475-minimum-operations-to-make-binary-array-elements-equal-to-one-i) |
## Math
| |
| ------- |
| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |
| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
## Design
| |
| ------- |
| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
## Randomized
| |
| ------- |
| [0380-insert-delete-getrandom-o1](https://github.com/kms1601/Leetcode/tree/master/0380-insert-delete-getrandom-o1) |
## Matrix
| |
| ------- |
| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |
| [2398-check-if-matrix-is-x-matrix](https://github.com/kms1601/Leetcode/tree/master/2398-check-if-matrix-is-x-matrix) |
## Two Pointers
| |
| ------- |
| [2634-minimum-common-value](https://github.com/kms1601/Leetcode/tree/master/2634-minimum-common-value) |
## Dynamic Programming
| |
| ------- |
| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |
| [0118-pascals-triangle](https://github.com/kms1601/Leetcode/tree/master/0118-pascals-triangle) |
| [0747-min-cost-climbing-stairs](https://github.com/kms1601/Leetcode/tree/master/0747-min-cost-climbing-stairs) |
| [1352-maximum-profit-in-job-scheduling](https://github.com/kms1601/Leetcode/tree/master/1352-maximum-profit-in-job-scheduling) |
## Stack
| |
| ------- |
| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |
## Monotonic Stack
| |
| ------- |
| [0085-maximal-rectangle](https://github.com/kms1601/Leetcode/tree/master/0085-maximal-rectangle) |
## Greedy
| |
| ------- |
| [0502-ipo](https://github.com/kms1601/Leetcode/tree/master/0502-ipo) |
| [0561-array-partition](https://github.com/kms1601/Leetcode/tree/master/0561-array-partition) |
| [1832-minimum-operations-to-make-a-subsequence](https://github.com/kms1601/Leetcode/tree/master/1832-minimum-operations-to-make-a-subsequence) |
## Sorting
| |
| ------- |
| [0268-missing-number](https://github.com/kms1601/Leetcode/tree/master/0268-missing-number) |
| [0502-ipo](https://github.com/kms1601/Leetcode/tree/master/0502-ipo) |
| [0561-array-partition](https://github.com/kms1601/Leetcode/tree/master/0561-array-partition) |
| [1352-maximum-profit-in-job-scheduling](https://github.com/kms1601/Leetcode/tree/master/1352-maximum-profit-in-job-scheduling) |
## Heap (Priority Queue)
| |
| ------- |
| [0502-ipo](https://github.com/kms1601/Leetcode/tree/master/0502-ipo) |
## Counting Sort
| |
| ------- |
| [0561-array-partition](https://github.com/kms1601/Leetcode/tree/master/0561-array-partition) |
## Graph
| |
| ------- |
| [1916-find-center-of-star-graph](https://github.com/kms1601/Leetcode/tree/master/1916-find-center-of-star-graph) |
| [2121-find-if-path-exists-in-graph](https://github.com/kms1601/Leetcode/tree/master/2121-find-if-path-exists-in-graph) |
## Union Find
| |
| ------- |
| [2121-find-if-path-exists-in-graph](https://github.com/kms1601/Leetcode/tree/master/2121-find-if-path-exists-in-graph) |