Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/kartikayakulshrestha/problem-solvings
https://github.com/kartikayakulshrestha/problem-solvings
Last synced: 24 days ago
JSON representation
- Host: GitHub
- URL: https://github.com/kartikayakulshrestha/problem-solvings
- Owner: kartikayakulshrestha
- Created: 2024-07-30T17:17:17.000Z (4 months ago)
- Default Branch: main
- Last Pushed: 2024-10-04T15:46:41.000Z (about 1 month ago)
- Last Synced: 2024-10-05T03:22:06.743Z (about 1 month ago)
- Language: Python
- Size: 88.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
## Array
| |
| ------- |
| [0064-minimum-path-sum](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0064-minimum-path-sum) |
| [0120-triangle](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0120-triangle) |
| [0198-house-robber](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0198-house-robber) |
| [0560-subarray-sum-equals-k](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0560-subarray-sum-equals-k) |
| [0747-min-cost-climbing-stairs](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0747-min-cost-climbing-stairs) |
| [0921-spiral-matrix-iii](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0921-spiral-matrix-iii) |
| [2163-kth-distinct-string-in-an-array](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/2163-kth-distinct-string-in-an-array) |
| [3515-find-if-digit-game-can-be-won](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3515-find-if-digit-game-can-be-won) |
## Math
| |
| ------- |
| [0070-climbing-stairs](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0070-climbing-stairs) |
| [1013-fibonacci-number](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1013-fibonacci-number) |
| [1236-n-th-tribonacci-number](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1236-n-th-tribonacci-number) |
| [3515-find-if-digit-game-can-be-won](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3515-find-if-digit-game-can-be-won) |
## Hash Table
| |
| ------- |
| [0560-subarray-sum-equals-k](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0560-subarray-sum-equals-k) |
| [2163-kth-distinct-string-in-an-array](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/2163-kth-distinct-string-in-an-array) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## String
| |
| ------- |
| [2163-kth-distinct-string-in-an-array](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/2163-kth-distinct-string-in-an-array) |
| [3195-separate-black-and-white-balls](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3195-separate-black-and-white-balls) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Counting
| |
| ------- |
| [2163-kth-distinct-string-in-an-array](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/2163-kth-distinct-string-in-an-array) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Greedy
| |
| ------- |
| [3195-separate-black-and-white-balls](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3195-separate-black-and-white-balls) |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Sorting
| |
| ------- |
| [3276-minimum-number-of-pushes-to-type-word-ii](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3276-minimum-number-of-pushes-to-type-word-ii) |
## Dynamic Programming
| |
| ------- |
| [0064-minimum-path-sum](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0064-minimum-path-sum) |
| [0070-climbing-stairs](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0070-climbing-stairs) |
| [0120-triangle](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0120-triangle) |
| [0198-house-robber](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0198-house-robber) |
| [0747-min-cost-climbing-stairs](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0747-min-cost-climbing-stairs) |
| [1013-fibonacci-number](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1013-fibonacci-number) |
| [1236-n-th-tribonacci-number](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1236-n-th-tribonacci-number) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0070-climbing-stairs) |
| [1013-fibonacci-number](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1013-fibonacci-number) |
| [1236-n-th-tribonacci-number](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1236-n-th-tribonacci-number) |
## Recursion
| |
| ------- |
| [1013-fibonacci-number](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1013-fibonacci-number) |
## Matrix
| |
| ------- |
| [0064-minimum-path-sum](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0064-minimum-path-sum) |
| [0921-spiral-matrix-iii](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0921-spiral-matrix-iii) |
## Simulation
| |
| ------- |
| [0921-spiral-matrix-iii](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0921-spiral-matrix-iii) |
## Bit Manipulation
| |
| ------- |
| [0476-number-complement](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0476-number-complement) |
## Prefix Sum
| |
| ------- |
| [0560-subarray-sum-equals-k](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0560-subarray-sum-equals-k) |
## Database
| |
| ------- |
| [0584-find-customer-referee](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0584-find-customer-referee) |
| [0595-big-countries](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/0595-big-countries) |
| [1258-article-views-i](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1258-article-views-i) |
| [1509-replace-employee-id-with-the-unique-identifier](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1509-replace-employee-id-with-the-unique-identifier) |
| [1908-recyclable-and-low-fat-products](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/1908-recyclable-and-low-fat-products) |
## Two Pointers
| |
| ------- |
| [3195-separate-black-and-white-balls](https://github.com/kartikayakulshrestha/Problem-Solvings/tree/master/3195-separate-black-and-white-balls) |