Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/prathamkandari/leetcode_problems

Last synced: 8 days ago
JSON representation

Host: GitHub
URL: https://github.com/prathamkandari/leetcode_problems
Owner: prathamkandari
Created: 2023-10-07T18:09:37.000Z (about 1 year ago)
Default Branch: main
Last Pushed: 2024-06-14T18:33:37.000Z (5 months ago)
Last Synced: 2024-06-15T08:29:30.709Z (5 months ago)
Language: Java
Size: 36.1 KB
Stars: 0
Watchers: 1
Forks: 0
Open Issues: 0
Metadata Files:
- Readme: README.md

Awesome Lists containing this project

README

        # Leetcode_Problems

# Array

|  |

| ------- |

| [0053-maximum-subarray](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0053-maximum-subarray) |

| [0121-best-time-to-buy-and-sell-stock](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0121-best-time-to-buy-and-sell-stock) |

| [0152-maximum-product-subarray](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0152-maximum-product-subarray) |

| [0153-find-minimum-in-rotated-sorted-array](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0153-find-minimum-in-rotated-sorted-array) |

| [0238-product-of-array-except-self](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0238-product-of-array-except-self) |

| [0287-find-the-duplicate-number](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0287-find-the-duplicate-number) |

| [0442-find-all-duplicates-in-an-array](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0442-find-all-duplicates-in-an-array) |

# Dynamic Programming

|  |

| ------- |

| [0053-maximum-subarray](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0053-maximum-subarray) |

| [0121-best-time-to-buy-and-sell-stock](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0121-best-time-to-buy-and-sell-stock) |

| [0152-maximum-product-subarray](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0152-maximum-product-subarray) |

# Two Pointers

|  |

| ------- |

| [0287-find-the-duplicate-number](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0287-find-the-duplicate-number) |

# Binary Search

|  |

| ------- |

| [0153-find-minimum-in-rotated-sorted-array](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0153-find-minimum-in-rotated-sorted-array) |

| [0287-find-the-duplicate-number](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0287-find-the-duplicate-number) |

# Bit Manipulation

|  |

| ------- |

| [0287-find-the-duplicate-number](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0287-find-the-duplicate-number) |

# Hash Table

|  |

| ------- |

| [0442-find-all-duplicates-in-an-array](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0442-find-all-duplicates-in-an-array) |

# Prefix Sum

|  |

| ------- |

| [0238-product-of-array-except-self](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0238-product-of-array-except-self) |

# Divide and Conquer

|  |

| ------- |

| [0053-maximum-subarray](https://github.com/prathamkandari/Leetcode_Problems/tree/master/0053-maximum-subarray) |