Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/markphamm/leetcode
Daily LeetCode solutions in Python, SQL, and more – featuring efficient algorithms, clean code, and a variety of problem-solving techniques.
https://github.com/markphamm/leetcode
leetcode-solutions python sql
Last synced: about 2 months ago
JSON representation
Daily LeetCode solutions in Python, SQL, and more – featuring efficient algorithms, clean code, and a variety of problem-solving techniques.
- Host: GitHub
- URL: https://github.com/markphamm/leetcode
- Owner: MarkPhamm
- Created: 2024-10-28T03:25:07.000Z (2 months ago)
- Default Branch: main
- Last Pushed: 2024-11-19T03:21:32.000Z (about 2 months ago)
- Last Synced: 2024-11-19T04:24:22.861Z (about 2 months ago)
- Topics: leetcode-solutions, python, sql
- Language: Python
- Homepage: https://leetcode.com/u/markphammm/
- Size: 889 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Leetcode
# LeetCode Topics
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/MarkPhamm/Leetcode/tree/master/0001-two-sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/MarkPhamm/Leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/MarkPhamm/Leetcode/tree/master/0027-remove-element) |
| [0035-search-insert-position](https://github.com/MarkPhamm/Leetcode/tree/master/0035-search-insert-position) |
| [0066-plus-one](https://github.com/MarkPhamm/Leetcode/tree/master/0066-plus-one) |
| [0074-search-a-2d-matrix](https://github.com/MarkPhamm/Leetcode/tree/master/0074-search-a-2d-matrix) |
| [0118-pascals-triangle](https://github.com/MarkPhamm/Leetcode/tree/master/0118-pascals-triangle) |
| [0119-pascals-triangle-ii](https://github.com/MarkPhamm/Leetcode/tree/master/0119-pascals-triangle-ii) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/MarkPhamm/Leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0136-single-number](https://github.com/MarkPhamm/Leetcode/tree/master/0136-single-number) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/MarkPhamm/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0169-majority-element](https://github.com/MarkPhamm/Leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/MarkPhamm/Leetcode/tree/master/0217-contains-duplicate) |
| [0228-summary-ranges](https://github.com/MarkPhamm/Leetcode/tree/master/0228-summary-ranges) |
| [0283-move-zeroes](https://github.com/MarkPhamm/Leetcode/tree/master/0283-move-zeroes) |
| [0347-top-k-frequent-elements](https://github.com/MarkPhamm/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0414-third-maximum-number](https://github.com/MarkPhamm/Leetcode/tree/master/0414-third-maximum-number) |
| [0485-max-consecutive-ones](https://github.com/MarkPhamm/Leetcode/tree/master/0485-max-consecutive-ones) |
| [0560-subarray-sum-equals-k](https://github.com/MarkPhamm/Leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0605-can-place-flowers](https://github.com/MarkPhamm/Leetcode/tree/master/0605-can-place-flowers) |
| [0682-baseball-game](https://github.com/MarkPhamm/Leetcode/tree/master/0682-baseball-game) |
| [0792-binary-search](https://github.com/MarkPhamm/Leetcode/tree/master/0792-binary-search) |
| [1019-squares-of-a-sorted-array](https://github.com/MarkPhamm/Leetcode/tree/master/1019-squares-of-a-sorted-array) |
| [1241-decompress-run-length-encoded-list](https://github.com/MarkPhamm/Leetcode/tree/master/1241-decompress-run-length-encoded-list) |
| [1407-group-the-people-given-the-group-size-they-belong-to](https://github.com/MarkPhamm/Leetcode/tree/master/1407-group-the-people-given-the-group-size-they-belong-to) |
| [1505-create-target-array-in-the-given-order](https://github.com/MarkPhamm/Leetcode/tree/master/1505-create-target-array-in-the-given-order) |
| [1603-running-sum-of-1d-array](https://github.com/MarkPhamm/Leetcode/tree/master/1603-running-sum-of-1d-array) |
| [1944-truncate-sentence](https://github.com/MarkPhamm/Leetcode/tree/master/1944-truncate-sentence) |
| [2137-final-value-of-variable-after-performing-operations](https://github.com/MarkPhamm/Leetcode/tree/master/2137-final-value-of-variable-after-performing-operations) |
| [2219-maximum-number-of-words-found-in-sentences](https://github.com/MarkPhamm/Leetcode/tree/master/2219-maximum-number-of-words-found-in-sentences) |
| [2350-find-closest-number-to-zero](https://github.com/MarkPhamm/Leetcode/tree/master/2350-find-closest-number-to-zero) |
| [2917-count-pairs-whose-sum-is-less-than-target](https://github.com/MarkPhamm/Leetcode/tree/master/2917-count-pairs-whose-sum-is-less-than-target) |
| [3331-minimum-operations-to-exceed-threshold-value-i](https://github.com/MarkPhamm/Leetcode/tree/master/3331-minimum-operations-to-exceed-threshold-value-i) |
| [3446-find-the-number-of-good-pairs-i](https://github.com/MarkPhamm/Leetcode/tree/master/3446-find-the-number-of-good-pairs-i) |
| [3577-convert-doubly-linked-list-to-array-i](https://github.com/MarkPhamm/Leetcode/tree/master/3577-convert-doubly-linked-list-to-array-i) |
| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/MarkPhamm/Leetcode/tree/master/3581-the-two-sneaky-numbers-of-digitville) |
| [3582-find-indices-of-stable-mountains](https://github.com/MarkPhamm/Leetcode/tree/master/3582-find-indices-of-stable-mountains) |
## Prefix Sum
| |
| ------- |
| [0560-subarray-sum-equals-k](https://github.com/MarkPhamm/Leetcode/tree/master/0560-subarray-sum-equals-k) |
| [1603-running-sum-of-1d-array](https://github.com/MarkPhamm/Leetcode/tree/master/1603-running-sum-of-1d-array) |
## Database
| |
| ------- |
| [0175-combine-two-tables](https://github.com/MarkPhamm/Leetcode/tree/master/0175-combine-two-tables) |
| [0176-second-highest-salary](https://github.com/MarkPhamm/Leetcode/tree/master/0176-second-highest-salary) |
| [0177-nth-highest-salary](https://github.com/MarkPhamm/Leetcode/tree/master/0177-nth-highest-salary) |
| [0178-rank-scores](https://github.com/MarkPhamm/Leetcode/tree/master/0178-rank-scores) |
| [0180-consecutive-numbers](https://github.com/MarkPhamm/Leetcode/tree/master/0180-consecutive-numbers) |
| [0181-employees-earning-more-than-their-managers](https://github.com/MarkPhamm/Leetcode/tree/master/0181-employees-earning-more-than-their-managers) |
| [0182-duplicate-emails](https://github.com/MarkPhamm/Leetcode/tree/master/0182-duplicate-emails) |
| [0183-customers-who-never-order](https://github.com/MarkPhamm/Leetcode/tree/master/0183-customers-who-never-order) |
| [0184-department-highest-salary](https://github.com/MarkPhamm/Leetcode/tree/master/0184-department-highest-salary) |
| [0185-department-top-three-salaries](https://github.com/MarkPhamm/Leetcode/tree/master/0185-department-top-three-salaries) |
| [0196-delete-duplicate-emails](https://github.com/MarkPhamm/Leetcode/tree/master/0196-delete-duplicate-emails) |
| [0197-rising-temperature](https://github.com/MarkPhamm/Leetcode/tree/master/0197-rising-temperature) |
| [0262-trips-and-users](https://github.com/MarkPhamm/Leetcode/tree/master/0262-trips-and-users) |
| [0569-median-employee-salary](https://github.com/MarkPhamm/Leetcode/tree/master/0569-median-employee-salary) |
| [0571-find-median-given-frequency-of-numbers](https://github.com/MarkPhamm/Leetcode/tree/master/0571-find-median-given-frequency-of-numbers) |
| [0574-winning-candidate](https://github.com/MarkPhamm/Leetcode/tree/master/0574-winning-candidate) |
| [0577-employee-bonus](https://github.com/MarkPhamm/Leetcode/tree/master/0577-employee-bonus) |
| [0578-get-highest-answer-rate-question](https://github.com/MarkPhamm/Leetcode/tree/master/0578-get-highest-answer-rate-question) |
| [0579-find-cumulative-salary-of-an-employee](https://github.com/MarkPhamm/Leetcode/tree/master/0579-find-cumulative-salary-of-an-employee) |
| [0580-count-student-number-in-departments](https://github.com/MarkPhamm/Leetcode/tree/master/0580-count-student-number-in-departments) |
| [0585-investments-in-2016](https://github.com/MarkPhamm/Leetcode/tree/master/0585-investments-in-2016) |
| [0586-customer-placing-the-largest-number-of-orders](https://github.com/MarkPhamm/Leetcode/tree/master/0586-customer-placing-the-largest-number-of-orders) |
| [0596-classes-more-than-5-students](https://github.com/MarkPhamm/Leetcode/tree/master/0596-classes-more-than-5-students) |
| [0597-friend-requests-i-overall-acceptance-rate](https://github.com/MarkPhamm/Leetcode/tree/master/0597-friend-requests-i-overall-acceptance-rate) |
| [0601-human-traffic-of-stadium](https://github.com/MarkPhamm/Leetcode/tree/master/0601-human-traffic-of-stadium) |
| [0602-friend-requests-ii-who-has-the-most-friends](https://github.com/MarkPhamm/Leetcode/tree/master/0602-friend-requests-ii-who-has-the-most-friends) |
| [0603-consecutive-available-seats](https://github.com/MarkPhamm/Leetcode/tree/master/0603-consecutive-available-seats) |
| [0607-sales-person](https://github.com/MarkPhamm/Leetcode/tree/master/0607-sales-person) |
| [0610-triangle-judgement](https://github.com/MarkPhamm/Leetcode/tree/master/0610-triangle-judgement) |
| [0612-shortest-distance-in-a-plane](https://github.com/MarkPhamm/Leetcode/tree/master/0612-shortest-distance-in-a-plane) |
| [0613-shortest-distance-in-a-line](https://github.com/MarkPhamm/Leetcode/tree/master/0613-shortest-distance-in-a-line) |
| [0614-second-degree-follower](https://github.com/MarkPhamm/Leetcode/tree/master/0614-second-degree-follower) |
| [0615-average-salary-departments-vs-company](https://github.com/MarkPhamm/Leetcode/tree/master/0615-average-salary-departments-vs-company) |
| [0618-students-report-by-geography](https://github.com/MarkPhamm/Leetcode/tree/master/0618-students-report-by-geography) |
| [0619-biggest-single-number](https://github.com/MarkPhamm/Leetcode/tree/master/0619-biggest-single-number) |
| [0626-exchange-seats](https://github.com/MarkPhamm/Leetcode/tree/master/0626-exchange-seats) |
| [0627-swap-salary](https://github.com/MarkPhamm/Leetcode/tree/master/0627-swap-salary) |
| [1135-customers-who-bought-all-products](https://github.com/MarkPhamm/Leetcode/tree/master/1135-customers-who-bought-all-products) |
| [1136-actors-and-directors-who-cooperated-at-least-three-times](https://github.com/MarkPhamm/Leetcode/tree/master/1136-actors-and-directors-who-cooperated-at-least-three-times) |
| [1153-product-sales-analysis-i](https://github.com/MarkPhamm/Leetcode/tree/master/1153-product-sales-analysis-i) |
| [1154-product-sales-analysis-ii](https://github.com/MarkPhamm/Leetcode/tree/master/1154-product-sales-analysis-ii) |
| [1162-project-employees-ii](https://github.com/MarkPhamm/Leetcode/tree/master/1162-project-employees-ii) |
| [1163-project-employees-iii](https://github.com/MarkPhamm/Leetcode/tree/master/1163-project-employees-iii) |
| [1172-sales-analysis-i](https://github.com/MarkPhamm/Leetcode/tree/master/1172-sales-analysis-i) |
| [1173-sales-analysis-ii](https://github.com/MarkPhamm/Leetcode/tree/master/1173-sales-analysis-ii) |
| [1179-game-play-analysis-i](https://github.com/MarkPhamm/Leetcode/tree/master/1179-game-play-analysis-i) |
| [1180-game-play-analysis-ii](https://github.com/MarkPhamm/Leetcode/tree/master/1180-game-play-analysis-ii) |
| [1181-game-play-analysis-iii](https://github.com/MarkPhamm/Leetcode/tree/master/1181-game-play-analysis-iii) |
| [1182-game-play-analysis-iv](https://github.com/MarkPhamm/Leetcode/tree/master/1182-game-play-analysis-iv) |
| [1193-game-play-analysis-v](https://github.com/MarkPhamm/Leetcode/tree/master/1193-game-play-analysis-v) |
| [1198-unpopular-books](https://github.com/MarkPhamm/Leetcode/tree/master/1198-unpopular-books) |
| [1204-new-users-daily-count](https://github.com/MarkPhamm/Leetcode/tree/master/1204-new-users-daily-count) |
| [1214-highest-grade-for-each-student](https://github.com/MarkPhamm/Leetcode/tree/master/1214-highest-grade-for-each-student) |
| [1215-reported-posts](https://github.com/MarkPhamm/Leetcode/tree/master/1215-reported-posts) |
| [1237-reported-posts-ii](https://github.com/MarkPhamm/Leetcode/tree/master/1237-reported-posts-ii) |
| [1246-user-activity-for-the-past-30-days-ii](https://github.com/MarkPhamm/Leetcode/tree/master/1246-user-activity-for-the-past-30-days-ii) |
| [1259-article-views-ii](https://github.com/MarkPhamm/Leetcode/tree/master/1259-article-views-ii) |
| [1269-market-analysis-ii](https://github.com/MarkPhamm/Leetcode/tree/master/1269-market-analysis-ii) |
| [1291-immediate-food-delivery-i](https://github.com/MarkPhamm/Leetcode/tree/master/1291-immediate-food-delivery-i) |
| [1318-tournament-winners](https://github.com/MarkPhamm/Leetcode/tree/master/1318-tournament-winners) |
| [1328-monthly-transactions-ii](https://github.com/MarkPhamm/Leetcode/tree/master/1328-monthly-transactions-ii) |
| [1339-team-scores-in-football-tournament](https://github.com/MarkPhamm/Leetcode/tree/master/1339-team-scores-in-football-tournament) |
| [1357-report-contiguous-dates](https://github.com/MarkPhamm/Leetcode/tree/master/1357-report-contiguous-dates) |
| [1377-number-of-comments-per-post](https://github.com/MarkPhamm/Leetcode/tree/master/1377-number-of-comments-per-post) |
| [1399-page-recommendations](https://github.com/MarkPhamm/Leetcode/tree/master/1399-page-recommendations) |
| [1405-all-people-report-to-the-given-manager](https://github.com/MarkPhamm/Leetcode/tree/master/1405-all-people-report-to-the-given-manager) |
| [1420-find-the-start-and-end-number-of-continuous-ranges](https://github.com/MarkPhamm/Leetcode/tree/master/1420-find-the-start-and-end-number-of-continuous-ranges) |
| [1425-weather-type-in-each-country](https://github.com/MarkPhamm/Leetcode/tree/master/1425-weather-type-in-each-country) |
| [1438-find-the-team-size](https://github.com/MarkPhamm/Leetcode/tree/master/1438-find-the-team-size) |
| [1439-running-total-for-different-genders](https://github.com/MarkPhamm/Leetcode/tree/master/1439-running-total-for-different-genders) |
| [1453-ads-performance](https://github.com/MarkPhamm/Leetcode/tree/master/1453-ads-performance) |
| [1481-students-with-invalid-departments](https://github.com/MarkPhamm/Leetcode/tree/master/1481-students-with-invalid-departments) |
| [1494-activity-participants](https://github.com/MarkPhamm/Leetcode/tree/master/1494-activity-participants) |
| [1495-number-of-trusted-contacts-of-a-customer](https://github.com/MarkPhamm/Leetcode/tree/master/1495-number-of-trusted-contacts-of-a-customer) |
| [1504-get-the-second-most-recent-activity](https://github.com/MarkPhamm/Leetcode/tree/master/1504-get-the-second-most-recent-activity) |
| [1536-customers-who-bought-products-a-and-b-but-not-c](https://github.com/MarkPhamm/Leetcode/tree/master/1536-customers-who-bought-products-a-and-b-but-not-c) |
| [1546-find-the-quiet-students-in-all-exams](https://github.com/MarkPhamm/Leetcode/tree/master/1546-find-the-quiet-students-in-all-exams) |
| [1551-npv-queries](https://github.com/MarkPhamm/Leetcode/tree/master/1551-npv-queries) |
| [1564-create-a-session-bar-chart](https://github.com/MarkPhamm/Leetcode/tree/master/1564-create-a-session-bar-chart) |
| [1565-evaluate-boolean-expression](https://github.com/MarkPhamm/Leetcode/tree/master/1565-evaluate-boolean-expression) |
| [1578-apples-oranges](https://github.com/MarkPhamm/Leetcode/tree/master/1578-apples-oranges) |
| [1579-active-users](https://github.com/MarkPhamm/Leetcode/tree/master/1579-active-users) |
| [1625-group-sold-products-by-the-date](https://github.com/MarkPhamm/Leetcode/tree/master/1625-group-sold-products-by-the-date) |
| [1639-friendly-movies-streamed-last-month](https://github.com/MarkPhamm/Leetcode/tree/master/1639-friendly-movies-streamed-last-month) |
| [1641-countries-you-can-safely-invest-in](https://github.com/MarkPhamm/Leetcode/tree/master/1641-countries-you-can-safely-invest-in) |
| [1654-customer-order-frequency](https://github.com/MarkPhamm/Leetcode/tree/master/1654-customer-order-frequency) |
| [1664-find-users-with-valid-e-mails](https://github.com/MarkPhamm/Leetcode/tree/master/1664-find-users-with-valid-e-mails) |
| [1686-fix-product-name-format](https://github.com/MarkPhamm/Leetcode/tree/master/1686-fix-product-name-format) |
| [1712-unique-orders-and-customers-per-month](https://github.com/MarkPhamm/Leetcode/tree/master/1712-unique-orders-and-customers-per-month) |
| [1718-warehouse-manager](https://github.com/MarkPhamm/Leetcode/tree/master/1718-warehouse-manager) |
| [1735-the-most-frequently-ordered-products-for-each-customer](https://github.com/MarkPhamm/Leetcode/tree/master/1735-the-most-frequently-ordered-products-for-each-customer) |
| [1749-sellers-with-no-sales](https://github.com/MarkPhamm/Leetcode/tree/master/1749-sellers-with-no-sales) |
| [1795-hopper-company-queries-iii](https://github.com/MarkPhamm/Leetcode/tree/master/1795-hopper-company-queries-iii) |
| [1821-products-worth-over-invoices](https://github.com/MarkPhamm/Leetcode/tree/master/1821-products-worth-over-invoices) |
| [1852-biggest-window-between-visits](https://github.com/MarkPhamm/Leetcode/tree/master/1852-biggest-window-between-visits) |
| [1898-leetflex-banned-accounts](https://github.com/MarkPhamm/Leetcode/tree/master/1898-leetflex-banned-accounts) |
| [1914-find-the-subtasks-that-did-not-execute](https://github.com/MarkPhamm/Leetcode/tree/master/1914-find-the-subtasks-that-did-not-execute) |
| [2092-users-that-actively-request-confirmation-messages](https://github.com/MarkPhamm/Leetcode/tree/master/2092-users-that-actively-request-confirmation-messages) |
| [2172-low-quality-problems](https://github.com/MarkPhamm/Leetcode/tree/master/2172-low-quality-problems) |
| [2214-the-winner-university](https://github.com/MarkPhamm/Leetcode/tree/master/2214-the-winner-university) |
| [2313-longest-winning-streak](https://github.com/MarkPhamm/Leetcode/tree/master/2313-longest-winning-streak) |
| [2336-the-number-of-users-that-are-eligible-for-discount](https://github.com/MarkPhamm/Leetcode/tree/master/2336-the-number-of-users-that-are-eligible-for-discount) |
| [2371-the-users-that-are-eligible-for-discount](https://github.com/MarkPhamm/Leetcode/tree/master/2371-the-users-that-are-eligible-for-discount) |
| [2853-consecutive-transactions-with-increasing-amounts](https://github.com/MarkPhamm/Leetcode/tree/master/2853-consecutive-transactions-with-increasing-amounts) |
| [3457-invalid-tweets-ii](https://github.com/MarkPhamm/Leetcode/tree/master/3457-invalid-tweets-ii) |
## Math
| |
| ------- |
| [0009-palindrome-number](https://github.com/MarkPhamm/Leetcode/tree/master/0009-palindrome-number) |
| [0013-roman-to-integer](https://github.com/MarkPhamm/Leetcode/tree/master/0013-roman-to-integer) |
| [0066-plus-one](https://github.com/MarkPhamm/Leetcode/tree/master/0066-plus-one) |
| [0067-add-binary](https://github.com/MarkPhamm/Leetcode/tree/master/0067-add-binary) |
| [0069-sqrtx](https://github.com/MarkPhamm/Leetcode/tree/master/0069-sqrtx) |
| [0070-climbing-stairs](https://github.com/MarkPhamm/Leetcode/tree/master/0070-climbing-stairs) |
| [0367-valid-perfect-square](https://github.com/MarkPhamm/Leetcode/tree/master/0367-valid-perfect-square) |
| [0412-fizz-buzz](https://github.com/MarkPhamm/Leetcode/tree/master/0412-fizz-buzz) |
| [1013-fibonacci-number](https://github.com/MarkPhamm/Leetcode/tree/master/1013-fibonacci-number) |
| [1406-subtract-the-product-and-sum-of-digits-of-an-integer](https://github.com/MarkPhamm/Leetcode/tree/master/1406-subtract-the-product-and-sum-of-digits-of-an-integer) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/MarkPhamm/Leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [1444-number-of-steps-to-reduce-a-number-to-zero](https://github.com/MarkPhamm/Leetcode/tree/master/1444-number-of-steps-to-reduce-a-number-to-zero) |
| [2481-strictly-palindromic-number](https://github.com/MarkPhamm/Leetcode/tree/master/2481-strictly-palindromic-number) |
| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/MarkPhamm/Leetcode/tree/master/3581-the-two-sneaky-numbers-of-digitville) |
## String
| |
| ------- |
| [0013-roman-to-integer](https://github.com/MarkPhamm/Leetcode/tree/master/0013-roman-to-integer) |
| [0014-longest-common-prefix](https://github.com/MarkPhamm/Leetcode/tree/master/0014-longest-common-prefix) |
| [0020-valid-parentheses](https://github.com/MarkPhamm/Leetcode/tree/master/0020-valid-parentheses) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/MarkPhamm/Leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0058-length-of-last-word](https://github.com/MarkPhamm/Leetcode/tree/master/0058-length-of-last-word) |
| [0067-add-binary](https://github.com/MarkPhamm/Leetcode/tree/master/0067-add-binary) |
| [0125-valid-palindrome](https://github.com/MarkPhamm/Leetcode/tree/master/0125-valid-palindrome) |
| [0242-valid-anagram](https://github.com/MarkPhamm/Leetcode/tree/master/0242-valid-anagram) |
| [0345-reverse-vowels-of-a-string](https://github.com/MarkPhamm/Leetcode/tree/master/0345-reverse-vowels-of-a-string) |
| [0383-ransom-note](https://github.com/MarkPhamm/Leetcode/tree/master/0383-ransom-note) |
| [0392-is-subsequence](https://github.com/MarkPhamm/Leetcode/tree/master/0392-is-subsequence) |
| [0412-fizz-buzz](https://github.com/MarkPhamm/Leetcode/tree/master/0412-fizz-buzz) |
| [0782-jewels-and-stones](https://github.com/MarkPhamm/Leetcode/tree/master/0782-jewels-and-stones) |
| [1089-remove-vowels-from-a-string](https://github.com/MarkPhamm/Leetcode/tree/master/1089-remove-vowels-from-a-string) |
| [1542-consecutive-characters](https://github.com/MarkPhamm/Leetcode/tree/master/1542-consecutive-characters) |
| [1797-goal-parser-interpretation](https://github.com/MarkPhamm/Leetcode/tree/master/1797-goal-parser-interpretation) |
| [1894-merge-strings-alternately](https://github.com/MarkPhamm/Leetcode/tree/master/1894-merge-strings-alternately) |
| [1944-truncate-sentence](https://github.com/MarkPhamm/Leetcode/tree/master/1944-truncate-sentence) |
| [1999-longer-contiguous-segments-of-ones-than-zeros](https://github.com/MarkPhamm/Leetcode/tree/master/1999-longer-contiguous-segments-of-ones-than-zeros) |
| [2128-reverse-prefix-of-word](https://github.com/MarkPhamm/Leetcode/tree/master/2128-reverse-prefix-of-word) |
| [2137-final-value-of-variable-after-performing-operations](https://github.com/MarkPhamm/Leetcode/tree/master/2137-final-value-of-variable-after-performing-operations) |
| [2219-maximum-number-of-words-found-in-sentences](https://github.com/MarkPhamm/Leetcode/tree/master/2219-maximum-number-of-words-found-in-sentences) |
| [3379-score-of-a-string](https://github.com/MarkPhamm/Leetcode/tree/master/3379-score-of-a-string) |
## Simulation
| |
| ------- |
| [0067-add-binary](https://github.com/MarkPhamm/Leetcode/tree/master/0067-add-binary) |
| [0412-fizz-buzz](https://github.com/MarkPhamm/Leetcode/tree/master/0412-fizz-buzz) |
| [0682-baseball-game](https://github.com/MarkPhamm/Leetcode/tree/master/0682-baseball-game) |
| [1505-create-target-array-in-the-given-order](https://github.com/MarkPhamm/Leetcode/tree/master/1505-create-target-array-in-the-given-order) |
| [2137-final-value-of-variable-after-performing-operations](https://github.com/MarkPhamm/Leetcode/tree/master/2137-final-value-of-variable-after-performing-operations) |
## Bit Manipulation
| |
| ------- |
| [0067-add-binary](https://github.com/MarkPhamm/Leetcode/tree/master/0067-add-binary) |
| [0136-single-number](https://github.com/MarkPhamm/Leetcode/tree/master/0136-single-number) |
| [1444-number-of-steps-to-reduce-a-number-to-zero](https://github.com/MarkPhamm/Leetcode/tree/master/1444-number-of-steps-to-reduce-a-number-to-zero) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/MarkPhamm/Leetcode/tree/master/0001-two-sum) |
| [0013-roman-to-integer](https://github.com/MarkPhamm/Leetcode/tree/master/0013-roman-to-integer) |
| [0141-linked-list-cycle](https://github.com/MarkPhamm/Leetcode/tree/master/0141-linked-list-cycle) |
| [0169-majority-element](https://github.com/MarkPhamm/Leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/MarkPhamm/Leetcode/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/MarkPhamm/Leetcode/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/MarkPhamm/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0383-ransom-note](https://github.com/MarkPhamm/Leetcode/tree/master/0383-ransom-note) |
| [0560-subarray-sum-equals-k](https://github.com/MarkPhamm/Leetcode/tree/master/0560-subarray-sum-equals-k) |
| [0782-jewels-and-stones](https://github.com/MarkPhamm/Leetcode/tree/master/0782-jewels-and-stones) |
| [1407-group-the-people-given-the-group-size-they-belong-to](https://github.com/MarkPhamm/Leetcode/tree/master/1407-group-the-people-given-the-group-size-they-belong-to) |
| [3359-linked-list-frequency](https://github.com/MarkPhamm/Leetcode/tree/master/3359-linked-list-frequency) |
| [3446-find-the-number-of-good-pairs-i](https://github.com/MarkPhamm/Leetcode/tree/master/3446-find-the-number-of-good-pairs-i) |
| [3581-the-two-sneaky-numbers-of-digitville](https://github.com/MarkPhamm/Leetcode/tree/master/3581-the-two-sneaky-numbers-of-digitville) |
## Two Pointers
| |
| ------- |
| [0026-remove-duplicates-from-sorted-array](https://github.com/MarkPhamm/Leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/MarkPhamm/Leetcode/tree/master/0027-remove-element) |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/MarkPhamm/Leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
| [0125-valid-palindrome](https://github.com/MarkPhamm/Leetcode/tree/master/0125-valid-palindrome) |
| [0141-linked-list-cycle](https://github.com/MarkPhamm/Leetcode/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/MarkPhamm/Leetcode/tree/master/0143-reorder-list) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/MarkPhamm/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0234-palindrome-linked-list](https://github.com/MarkPhamm/Leetcode/tree/master/0234-palindrome-linked-list) |
| [0283-move-zeroes](https://github.com/MarkPhamm/Leetcode/tree/master/0283-move-zeroes) |
| [0345-reverse-vowels-of-a-string](https://github.com/MarkPhamm/Leetcode/tree/master/0345-reverse-vowels-of-a-string) |
| [0392-is-subsequence](https://github.com/MarkPhamm/Leetcode/tree/master/0392-is-subsequence) |
| [0908-middle-of-the-linked-list](https://github.com/MarkPhamm/Leetcode/tree/master/0908-middle-of-the-linked-list) |
| [1019-squares-of-a-sorted-array](https://github.com/MarkPhamm/Leetcode/tree/master/1019-squares-of-a-sorted-array) |
| [1894-merge-strings-alternately](https://github.com/MarkPhamm/Leetcode/tree/master/1894-merge-strings-alternately) |
| [2128-reverse-prefix-of-word](https://github.com/MarkPhamm/Leetcode/tree/master/2128-reverse-prefix-of-word) |
| [2481-strictly-palindromic-number](https://github.com/MarkPhamm/Leetcode/tree/master/2481-strictly-palindromic-number) |
| [2917-count-pairs-whose-sum-is-less-than-target](https://github.com/MarkPhamm/Leetcode/tree/master/2917-count-pairs-whose-sum-is-less-than-target) |
## Dynamic Programming
| |
| ------- |
| [0070-climbing-stairs](https://github.com/MarkPhamm/Leetcode/tree/master/0070-climbing-stairs) |
| [0118-pascals-triangle](https://github.com/MarkPhamm/Leetcode/tree/master/0118-pascals-triangle) |
| [0119-pascals-triangle-ii](https://github.com/MarkPhamm/Leetcode/tree/master/0119-pascals-triangle-ii) |
| [0121-best-time-to-buy-and-sell-stock](https://github.com/MarkPhamm/Leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |
| [0392-is-subsequence](https://github.com/MarkPhamm/Leetcode/tree/master/0392-is-subsequence) |
| [1013-fibonacci-number](https://github.com/MarkPhamm/Leetcode/tree/master/1013-fibonacci-number) |
## Sorting
| |
| ------- |
| [0169-majority-element](https://github.com/MarkPhamm/Leetcode/tree/master/0169-majority-element) |
| [0217-contains-duplicate](https://github.com/MarkPhamm/Leetcode/tree/master/0217-contains-duplicate) |
| [0242-valid-anagram](https://github.com/MarkPhamm/Leetcode/tree/master/0242-valid-anagram) |
| [0347-top-k-frequent-elements](https://github.com/MarkPhamm/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0414-third-maximum-number](https://github.com/MarkPhamm/Leetcode/tree/master/0414-third-maximum-number) |
| [1019-squares-of-a-sorted-array](https://github.com/MarkPhamm/Leetcode/tree/master/1019-squares-of-a-sorted-array) |
| [2917-count-pairs-whose-sum-is-less-than-target](https://github.com/MarkPhamm/Leetcode/tree/master/2917-count-pairs-whose-sum-is-less-than-target) |
## Counting
| |
| ------- |
| [0169-majority-element](https://github.com/MarkPhamm/Leetcode/tree/master/0169-majority-element) |
| [0347-top-k-frequent-elements](https://github.com/MarkPhamm/Leetcode/tree/master/0347-top-k-frequent-elements) |
| [0383-ransom-note](https://github.com/MarkPhamm/Leetcode/tree/master/0383-ransom-note) |
| [3359-linked-list-frequency](https://github.com/MarkPhamm/Leetcode/tree/master/3359-linked-list-frequency) |
## Stack
| |
| ------- |
| [0020-valid-parentheses](https://github.com/MarkPhamm/Leetcode/tree/master/0020-valid-parentheses) |
| [0143-reorder-list](https://github.com/MarkPhamm/Leetcode/tree/master/0143-reorder-list) |
| [0155-min-stack](https://github.com/MarkPhamm/Leetcode/tree/master/0155-min-stack) |
| [0234-palindrome-linked-list](https://github.com/MarkPhamm/Leetcode/tree/master/0234-palindrome-linked-list) |
| [0682-baseball-game](https://github.com/MarkPhamm/Leetcode/tree/master/0682-baseball-game) |
| [2128-reverse-prefix-of-word](https://github.com/MarkPhamm/Leetcode/tree/master/2128-reverse-prefix-of-word) |
## String Matching
| |
| ------- |
| [0028-find-the-index-of-the-first-occurrence-in-a-string](https://github.com/MarkPhamm/Leetcode/tree/master/0028-find-the-index-of-the-first-occurrence-in-a-string) |
## Trie
| |
| ------- |
| [0014-longest-common-prefix](https://github.com/MarkPhamm/Leetcode/tree/master/0014-longest-common-prefix) |
## Binary Search
| |
| ------- |
| [0035-search-insert-position](https://github.com/MarkPhamm/Leetcode/tree/master/0035-search-insert-position) |
| [0069-sqrtx](https://github.com/MarkPhamm/Leetcode/tree/master/0069-sqrtx) |
| [0074-search-a-2d-matrix](https://github.com/MarkPhamm/Leetcode/tree/master/0074-search-a-2d-matrix) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/MarkPhamm/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0278-first-bad-version](https://github.com/MarkPhamm/Leetcode/tree/master/0278-first-bad-version) |
| [0367-valid-perfect-square](https://github.com/MarkPhamm/Leetcode/tree/master/0367-valid-perfect-square) |
| [0792-binary-search](https://github.com/MarkPhamm/Leetcode/tree/master/0792-binary-search) |
| [2917-count-pairs-whose-sum-is-less-than-target](https://github.com/MarkPhamm/Leetcode/tree/master/2917-count-pairs-whose-sum-is-less-than-target) |
## Memoization
| |
| ------- |
| [0070-climbing-stairs](https://github.com/MarkPhamm/Leetcode/tree/master/0070-climbing-stairs) |
| [1013-fibonacci-number](https://github.com/MarkPhamm/Leetcode/tree/master/1013-fibonacci-number) |
## Recursion
| |
| ------- |
| [0021-merge-two-sorted-lists](https://github.com/MarkPhamm/Leetcode/tree/master/0021-merge-two-sorted-lists) |
| [0143-reorder-list](https://github.com/MarkPhamm/Leetcode/tree/master/0143-reorder-list) |
| [0206-reverse-linked-list](https://github.com/MarkPhamm/Leetcode/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/MarkPhamm/Leetcode/tree/master/0234-palindrome-linked-list) |
| [1013-fibonacci-number](https://github.com/MarkPhamm/Leetcode/tree/master/1013-fibonacci-number) |
## Interactive
| |
| ------- |
| [0278-first-bad-version](https://github.com/MarkPhamm/Leetcode/tree/master/0278-first-bad-version) |
## Divide and Conquer
| |
| ------- |
| [0169-majority-element](https://github.com/MarkPhamm/Leetcode/tree/master/0169-majority-element) |
| [0347-top-k-frequent-elements](https://github.com/MarkPhamm/Leetcode/tree/master/0347-top-k-frequent-elements) |
## Heap (Priority Queue)
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/MarkPhamm/Leetcode/tree/master/0347-top-k-frequent-elements) |
## Bucket Sort
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/MarkPhamm/Leetcode/tree/master/0347-top-k-frequent-elements) |
## Quickselect
| |
| ------- |
| [0347-top-k-frequent-elements](https://github.com/MarkPhamm/Leetcode/tree/master/0347-top-k-frequent-elements) |
## Design
| |
| ------- |
| [0155-min-stack](https://github.com/MarkPhamm/Leetcode/tree/master/0155-min-stack) |
## Matrix
| |
| ------- |
| [0074-search-a-2d-matrix](https://github.com/MarkPhamm/Leetcode/tree/master/0074-search-a-2d-matrix) |
## Greedy
| |
| ------- |
| [0605-can-place-flowers](https://github.com/MarkPhamm/Leetcode/tree/master/0605-can-place-flowers) |
| [1407-group-the-people-given-the-group-size-they-belong-to](https://github.com/MarkPhamm/Leetcode/tree/master/1407-group-the-people-given-the-group-size-they-belong-to) |
## Linked List
| |
| ------- |
| [0021-merge-two-sorted-lists](https://github.com/MarkPhamm/Leetcode/tree/master/0021-merge-two-sorted-lists) |
| [0083-remove-duplicates-from-sorted-list](https://github.com/MarkPhamm/Leetcode/tree/master/0083-remove-duplicates-from-sorted-list) |
| [0141-linked-list-cycle](https://github.com/MarkPhamm/Leetcode/tree/master/0141-linked-list-cycle) |
| [0143-reorder-list](https://github.com/MarkPhamm/Leetcode/tree/master/0143-reorder-list) |
| [0206-reverse-linked-list](https://github.com/MarkPhamm/Leetcode/tree/master/0206-reverse-linked-list) |
| [0234-palindrome-linked-list](https://github.com/MarkPhamm/Leetcode/tree/master/0234-palindrome-linked-list) |
| [0237-delete-node-in-a-linked-list](https://github.com/MarkPhamm/Leetcode/tree/master/0237-delete-node-in-a-linked-list) |
| [0908-middle-of-the-linked-list](https://github.com/MarkPhamm/Leetcode/tree/master/0908-middle-of-the-linked-list) |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/MarkPhamm/Leetcode/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
| [3359-linked-list-frequency](https://github.com/MarkPhamm/Leetcode/tree/master/3359-linked-list-frequency) |
| [3577-convert-doubly-linked-list-to-array-i](https://github.com/MarkPhamm/Leetcode/tree/master/3577-convert-doubly-linked-list-to-array-i) |
## Brainteaser
| |
| ------- |
| [2481-strictly-palindromic-number](https://github.com/MarkPhamm/Leetcode/tree/master/2481-strictly-palindromic-number) |
## Doubly-Linked List
| |
| ------- |
| [3577-convert-doubly-linked-list-to-array-i](https://github.com/MarkPhamm/Leetcode/tree/master/3577-convert-doubly-linked-list-to-array-i) |