https://github.com/akshaya13/leetcode
Leetcode question with solutions!
https://github.com/akshaya13/leetcode
blind75 data-structures
Last synced: 8 months ago
JSON representation
Leetcode question with solutions!
- Host: GitHub
- URL: https://github.com/akshaya13/leetcode
- Owner: akshaya13
- Created: 2024-05-23T20:13:29.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-10-23T20:30:59.000Z (12 months ago)
- Last Synced: 2024-10-24T08:05:13.839Z (12 months ago)
- Topics: blind75, data-structures
- Language: Python
- Homepage:
- Size: 50.8 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leetcode
Collection of LeetCode questions to ace the coding interview!
1. Data Structure
2. Blind75
# LeetCode Topics
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/akshaya13/Leetcode/tree/master/0001-two-sum) |
| [0049-group-anagrams](https://github.com/akshaya13/Leetcode/tree/master/0049-group-anagrams) |
| [0128-longest-consecutive-sequence](https://github.com/akshaya13/Leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/akshaya13/Leetcode/tree/master/0217-contains-duplicate) |
| [0219-contains-duplicate-ii](https://github.com/akshaya13/Leetcode/tree/master/0219-contains-duplicate-ii) |
| [0242-valid-anagram](https://github.com/akshaya13/Leetcode/tree/master/0242-valid-anagram) |
| [0290-word-pattern](https://github.com/akshaya13/Leetcode/tree/master/0290-word-pattern) |
| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0387-first-unique-character-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0387-first-unique-character-in-a-string) |
| [0424-longest-repeating-character-replacement](https://github.com/akshaya13/Leetcode/tree/master/0424-longest-repeating-character-replacement) |
| [0438-find-all-anagrams-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0438-find-all-anagrams-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |
| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |
| [0535-encode-and-decode-tinyurl](https://github.com/akshaya13/Leetcode/tree/master/0535-encode-and-decode-tinyurl) |
| [0560-subarray-sum-equals-k](https://github.com/akshaya13/Leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0965-unique-email-addresses](https://github.com/akshaya13/Leetcode/tree/master/0965-unique-email-addresses) |
| [1112-find-words-that-can-be-formed-by-characters](https://github.com/akshaya13/Leetcode/tree/master/1112-find-words-that-can-be-formed-by-characters) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/akshaya13/Leetcode/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
## String
| |
| ------- |
| [0020-valid-parentheses](https://github.com/akshaya13/Leetcode/tree/master/0020-valid-parentheses) |
| [0049-group-anagrams](https://github.com/akshaya13/Leetcode/tree/master/0049-group-anagrams) |
| [0058-length-of-last-word](https://github.com/akshaya13/Leetcode/tree/master/0058-length-of-last-word) |
| [0125-valid-palindrome](https://github.com/akshaya13/Leetcode/tree/master/0125-valid-palindrome) |
| [0242-valid-anagram](https://github.com/akshaya13/Leetcode/tree/master/0242-valid-anagram) |
| [0290-word-pattern](https://github.com/akshaya13/Leetcode/tree/master/0290-word-pattern) |
| [0387-first-unique-character-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0387-first-unique-character-in-a-string) |
| [0392-is-subsequence](https://github.com/akshaya13/Leetcode/tree/master/0392-is-subsequence) |
| [0424-longest-repeating-character-replacement](https://github.com/akshaya13/Leetcode/tree/master/0424-longest-repeating-character-replacement) |
| [0438-find-all-anagrams-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0438-find-all-anagrams-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |
| [0535-encode-and-decode-tinyurl](https://github.com/akshaya13/Leetcode/tree/master/0535-encode-and-decode-tinyurl) |
| [0680-valid-palindrome-ii](https://github.com/akshaya13/Leetcode/tree/master/0680-valid-palindrome-ii) |
| [0965-unique-email-addresses](https://github.com/akshaya13/Leetcode/tree/master/0965-unique-email-addresses) |
| [1112-find-words-that-can-be-formed-by-characters](https://github.com/akshaya13/Leetcode/tree/master/1112-find-words-that-can-be-formed-by-characters) |
| [1250-longest-common-subsequence](https://github.com/akshaya13/Leetcode/tree/master/1250-longest-common-subsequence) |
| [2346-largest-3-same-digit-number-in-string](https://github.com/akshaya13/Leetcode/tree/master/2346-largest-3-same-digit-number-in-string) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/akshaya13/Leetcode/tree/master/0015-3sum) |
| [0049-group-anagrams](https://github.com/akshaya13/Leetcode/tree/master/0049-group-anagrams) |
| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/akshaya13/Leetcode/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/akshaya13/Leetcode/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |
| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/akshaya13/Leetcode/tree/master/0001-two-sum) |
| [0011-container-with-most-water](https://github.com/akshaya13/Leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/akshaya13/Leetcode/tree/master/0015-3sum) |
| [0049-group-anagrams](https://github.com/akshaya13/Leetcode/tree/master/0049-group-anagrams) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/akshaya13/Leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/akshaya13/Leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/akshaya13/Leetcode/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0128-longest-consecutive-sequence](https://github.com/akshaya13/Leetcode/tree/master/0128-longest-consecutive-sequence) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/akshaya13/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/akshaya13/Leetcode/tree/master/0217-contains-duplicate) |
| [0219-contains-duplicate-ii](https://github.com/akshaya13/Leetcode/tree/master/0219-contains-duplicate-ii) |
| [0238-product-of-array-except-self](https://github.com/akshaya13/Leetcode/tree/master/0238-product-of-array-except-self) |
| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |
| [0560-subarray-sum-equals-k](https://github.com/akshaya13/Leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0713-subarray-product-less-than-k](https://github.com/akshaya13/Leetcode/tree/master/0713-subarray-product-less-than-k) |
| [0932-monotonic-array](https://github.com/akshaya13/Leetcode/tree/master/0932-monotonic-array) |
| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |
| [0965-unique-email-addresses](https://github.com/akshaya13/Leetcode/tree/master/0965-unique-email-addresses) |
| [1112-find-words-that-can-be-formed-by-characters](https://github.com/akshaya13/Leetcode/tree/master/1112-find-words-that-can-be-formed-by-characters) |
| [1231-replace-elements-with-greatest-element-on-right-side](https://github.com/akshaya13/Leetcode/tree/master/1231-replace-elements-with-greatest-element-on-right-side) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/akshaya13/Leetcode/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
| [2058-concatenation-of-array](https://github.com/akshaya13/Leetcode/tree/master/2058-concatenation-of-array) |
| [2195-time-needed-to-buy-tickets](https://github.com/akshaya13/Leetcode/tree/master/2195-time-needed-to-buy-tickets) |
## Prefix Sum
| |
| ------- |
| [0238-product-of-array-except-self](https://github.com/akshaya13/Leetcode/tree/master/0238-product-of-array-except-self) |
| [0560-subarray-sum-equals-k](https://github.com/akshaya13/Leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0713-subarray-product-less-than-k](https://github.com/akshaya13/Leetcode/tree/master/0713-subarray-product-less-than-k) |
## Sliding Window
| |
| ------- |
| [0219-contains-duplicate-ii](https://github.com/akshaya13/Leetcode/tree/master/0219-contains-duplicate-ii) |
| [0424-longest-repeating-character-replacement](https://github.com/akshaya13/Leetcode/tree/master/0424-longest-repeating-character-replacement) |
| [0438-find-all-anagrams-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0438-find-all-anagrams-in-a-string) |
| [0713-subarray-product-less-than-k](https://github.com/akshaya13/Leetcode/tree/master/0713-subarray-product-less-than-k) |
## Divide and Conquer
| |
| ------- |
| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |
| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |
## Heap (Priority Queue)
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |
| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0387-first-unique-character-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0387-first-unique-character-in-a-string) |
| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |
| [1112-find-words-that-can-be-formed-by-characters](https://github.com/akshaya13/Leetcode/tree/master/1112-find-words-that-can-be-formed-by-characters) |
| [1620-check-if-array-pairs-are-divisible-by-k](https://github.com/akshaya13/Leetcode/tree/master/1620-check-if-array-pairs-are-divisible-by-k) |
## Quickselect
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |
## Two Pointers
| |
| ------- |
| [0011-container-with-most-water](https://github.com/akshaya13/Leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/akshaya13/Leetcode/tree/master/0015-3sum) |
| [0125-valid-palindrome](https://github.com/akshaya13/Leetcode/tree/master/0125-valid-palindrome) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/akshaya13/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0392-is-subsequence](https://github.com/akshaya13/Leetcode/tree/master/0392-is-subsequence) |
| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |
| [0680-valid-palindrome-ii](https://github.com/akshaya13/Leetcode/tree/master/0680-valid-palindrome-ii) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/akshaya13/Leetcode/tree/master/0020-valid-parentheses) |
## Dynamic Programming
| |
| ------- |
| [0070-climbing-stairs](https://github.com/akshaya13/Leetcode/tree/master/0070-climbing-stairs) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/akshaya13/Leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/akshaya13/Leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0123-best-time-to-buy-and-sell-stock-iii](https://github.com/akshaya13/Leetcode/tree/master/0123-best-time-to-buy-and-sell-stock-iii) |
| [0392-is-subsequence](https://github.com/akshaya13/Leetcode/tree/master/0392-is-subsequence) |
| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |
| [1250-longest-common-subsequence](https://github.com/akshaya13/Leetcode/tree/master/1250-longest-common-subsequence) |
## Binary Search
| |
| ------- |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/akshaya13/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |
| [0713-subarray-product-less-than-k](https://github.com/akshaya13/Leetcode/tree/master/0713-subarray-product-less-than-k) |
## Database
| |
| ------- |
| [0183-customers-who-never-order](https://github.com/akshaya13/Leetcode/tree/master/0183-customers-who-never-order) |
| [0584-find-customer-referee](https://github.com/akshaya13/Leetcode/tree/master/0584-find-customer-referee) |
| [0595-big-countries](https://github.com/akshaya13/Leetcode/tree/master/0595-big-countries) |
| [0620-not-boring-movies](https://github.com/akshaya13/Leetcode/tree/master/0620-not-boring-movies) |
| [0627-swap-salary](https://github.com/akshaya13/Leetcode/tree/master/0627-swap-salary) |
| [1136-actors-and-directors-who-cooperated-at-least-three-times](https://github.com/akshaya13/Leetcode/tree/master/1136-actors-and-directors-who-cooperated-at-least-three-times) |
| [1153-product-sales-analysis-i](https://github.com/akshaya13/Leetcode/tree/master/1153-product-sales-analysis-i) |
| [1179-game-play-analysis-i](https://github.com/akshaya13/Leetcode/tree/master/1179-game-play-analysis-i) |
| [1245-user-activity-for-the-past-30-days-i](https://github.com/akshaya13/Leetcode/tree/master/1245-user-activity-for-the-past-30-days-i) |
| [1258-article-views-i](https://github.com/akshaya13/Leetcode/tree/master/1258-article-views-i) |
| [1301-reformat-department-table](https://github.com/akshaya13/Leetcode/tree/master/1301-reformat-department-table) |
| [1509-replace-employee-id-with-the-unique-identifier](https://github.com/akshaya13/Leetcode/tree/master/1509-replace-employee-id-with-the-unique-identifier) |
| [1541-top-travellers](https://github.com/akshaya13/Leetcode/tree/master/1541-top-travellers) |
| [1670-patients-with-a-condition](https://github.com/akshaya13/Leetcode/tree/master/1670-patients-with-a-condition) |
| [1811-fix-names-in-a-table](https://github.com/akshaya13/Leetcode/tree/master/1811-fix-names-in-a-table) |
| [1827-invalid-tweets](https://github.com/akshaya13/Leetcode/tree/master/1827-invalid-tweets) |
| [1908-recyclable-and-low-fat-products](https://github.com/akshaya13/Leetcode/tree/master/1908-recyclable-and-low-fat-products) |
| [2024-calculate-special-bonus](https://github.com/akshaya13/Leetcode/tree/master/2024-calculate-special-bonus) |
| [2041-the-latest-login-in-2020](https://github.com/akshaya13/Leetcode/tree/master/2041-the-latest-login-in-2020) |
## Union Find
| |
| ------- |
| [0128-longest-consecutive-sequence](https://github.com/akshaya13/Leetcode/tree/master/0128-longest-consecutive-sequence) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/akshaya13/Leetcode/tree/master/0011-container-with-most-water) |
| [0122-best-time-to-buy-and-sell-stock-ii](https://github.com/akshaya13/Leetcode/tree/master/0122-best-time-to-buy-and-sell-stock-ii) |
| [0680-valid-palindrome-ii](https://github.com/akshaya13/Leetcode/tree/master/0680-valid-palindrome-ii) |
## Simulation
| |
| ------- |
| [2058-concatenation-of-array](https://github.com/akshaya13/Leetcode/tree/master/2058-concatenation-of-array) |
| [2195-time-needed-to-buy-tickets](https://github.com/akshaya13/Leetcode/tree/master/2195-time-needed-to-buy-tickets) |
## Queue
| |
| ------- |
| [0387-first-unique-character-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0387-first-unique-character-in-a-string) |
| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |
| [2195-time-needed-to-buy-tickets](https://github.com/akshaya13/Leetcode/tree/master/2195-time-needed-to-buy-tickets) |
## Design
| |
| ------- |
| [0535-encode-and-decode-tinyurl](https://github.com/akshaya13/Leetcode/tree/master/0535-encode-and-decode-tinyurl) |
## Hash Function
| |
| ------- |
| [0535-encode-and-decode-tinyurl](https://github.com/akshaya13/Leetcode/tree/master/0535-encode-and-decode-tinyurl) |
## Monotonic Queue
| |
| ------- |
| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |
## Math
| |
| ------- |
| [0070-climbing-stairs](https://github.com/akshaya13/Leetcode/tree/master/0070-climbing-stairs) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/akshaya13/Leetcode/tree/master/0070-climbing-stairs) |
## Linked List
| |
| ------- |
| [0206-reverse-linked-list](https://github.com/akshaya13/Leetcode/tree/master/0206-reverse-linked-list) |
## Recursion
| |
| ------- |
| [0206-reverse-linked-list](https://github.com/akshaya13/Leetcode/tree/master/0206-reverse-linked-list) |