{"id":19484031,"url":"https://github.com/akshaya13/leetcode","last_synced_at":"2026-06-19T10:32:26.447Z","repository":{"id":259304752,"uuid":"805064173","full_name":"akshaya13/Leetcode","owner":"akshaya13","description":"Leetcode question with solutions!","archived":false,"fork":false,"pushed_at":"2024-10-23T20:30:59.000Z","size":52,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-10-24T08:05:13.839Z","etag":null,"topics":["blind75","data-structures"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/akshaya13.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-05-23T20:13:29.000Z","updated_at":"2024-10-23T20:31:02.000Z","dependencies_parsed_at":"2024-10-24T08:07:17.888Z","dependency_job_id":"a5043419-47af-461e-a89a-279f5cfaa5d2","html_url":"https://github.com/akshaya13/Leetcode","commit_stats":null,"previous_names":["akshaya13/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/akshaya13/Leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaya13%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaya13%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaya13%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaya13%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/akshaya13","download_url":"https://codeload.github.com/akshaya13/Leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/akshaya13%2FLeetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34528134,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-19T02:00:06.005Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["blind75","data-structures"],"created_at":"2024-11-10T20:18:58.212Z","updated_at":"2026-06-19T10:32:26.425Z","avatar_url":"https://github.com/akshaya13.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode\nCollection of LeetCode questions to ace the coding interview! \n1. Data Structure\n2. Blind75\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/akshaya13/Leetcode/tree/master/0001-two-sum) |\n| [0049-group-anagrams](https://github.com/akshaya13/Leetcode/tree/master/0049-group-anagrams) |\n| [0128-longest-consecutive-sequence](https://github.com/akshaya13/Leetcode/tree/master/0128-longest-consecutive-sequence) |\n| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |\n| [0217-contains-duplicate](https://github.com/akshaya13/Leetcode/tree/master/0217-contains-duplicate) |\n| [0219-contains-duplicate-ii](https://github.com/akshaya13/Leetcode/tree/master/0219-contains-duplicate-ii) |\n| [0242-valid-anagram](https://github.com/akshaya13/Leetcode/tree/master/0242-valid-anagram) |\n| [0290-word-pattern](https://github.com/akshaya13/Leetcode/tree/master/0290-word-pattern) |\n| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0387-first-unique-character-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0387-first-unique-character-in-a-string) |\n| [0424-longest-repeating-character-replacement](https://github.com/akshaya13/Leetcode/tree/master/0424-longest-repeating-character-replacement) |\n| [0438-find-all-anagrams-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0438-find-all-anagrams-in-a-string) |\n| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |\n| [0535-encode-and-decode-tinyurl](https://github.com/akshaya13/Leetcode/tree/master/0535-encode-and-decode-tinyurl) |\n| [0560-subarray-sum-equals-k](https://github.com/akshaya13/Leetcode/tree/master/0560-subarray-sum-equals-k) |\n| [0965-unique-email-addresses](https://github.com/akshaya13/Leetcode/tree/master/0965-unique-email-addresses) |\n| [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) |\n| [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) |\n## String\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/akshaya13/Leetcode/tree/master/0020-valid-parentheses) |\n| [0049-group-anagrams](https://github.com/akshaya13/Leetcode/tree/master/0049-group-anagrams) |\n| [0058-length-of-last-word](https://github.com/akshaya13/Leetcode/tree/master/0058-length-of-last-word) |\n| [0125-valid-palindrome](https://github.com/akshaya13/Leetcode/tree/master/0125-valid-palindrome) |\n| [0242-valid-anagram](https://github.com/akshaya13/Leetcode/tree/master/0242-valid-anagram) |\n| [0290-word-pattern](https://github.com/akshaya13/Leetcode/tree/master/0290-word-pattern) |\n| [0387-first-unique-character-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0387-first-unique-character-in-a-string) |\n| [0392-is-subsequence](https://github.com/akshaya13/Leetcode/tree/master/0392-is-subsequence) |\n| [0424-longest-repeating-character-replacement](https://github.com/akshaya13/Leetcode/tree/master/0424-longest-repeating-character-replacement) |\n| [0438-find-all-anagrams-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0438-find-all-anagrams-in-a-string) |\n| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [0535-encode-and-decode-tinyurl](https://github.com/akshaya13/Leetcode/tree/master/0535-encode-and-decode-tinyurl) |\n| [0680-valid-palindrome-ii](https://github.com/akshaya13/Leetcode/tree/master/0680-valid-palindrome-ii) |\n| [0965-unique-email-addresses](https://github.com/akshaya13/Leetcode/tree/master/0965-unique-email-addresses) |\n| [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) |\n| [1250-longest-common-subsequence](https://github.com/akshaya13/Leetcode/tree/master/1250-longest-common-subsequence) |\n| [2346-largest-3-same-digit-number-in-string](https://github.com/akshaya13/Leetcode/tree/master/2346-largest-3-same-digit-number-in-string) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/akshaya13/Leetcode/tree/master/0015-3sum) |\n| [0049-group-anagrams](https://github.com/akshaya13/Leetcode/tree/master/0049-group-anagrams) |\n| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |\n| [0217-contains-duplicate](https://github.com/akshaya13/Leetcode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/akshaya13/Leetcode/tree/master/0242-valid-anagram) |\n| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/akshaya13/Leetcode/tree/master/0001-two-sum) |\n| [0011-container-with-most-water](https://github.com/akshaya13/Leetcode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/akshaya13/Leetcode/tree/master/0015-3sum) |\n| [0049-group-anagrams](https://github.com/akshaya13/Leetcode/tree/master/0049-group-anagrams) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/akshaya13/Leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [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) |\n| [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) |\n| [0128-longest-consecutive-sequence](https://github.com/akshaya13/Leetcode/tree/master/0128-longest-consecutive-sequence) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/akshaya13/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |\n| [0217-contains-duplicate](https://github.com/akshaya13/Leetcode/tree/master/0217-contains-duplicate) |\n| [0219-contains-duplicate-ii](https://github.com/akshaya13/Leetcode/tree/master/0219-contains-duplicate-ii) |\n| [0238-product-of-array-except-self](https://github.com/akshaya13/Leetcode/tree/master/0238-product-of-array-except-self) |\n| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |\n| [0560-subarray-sum-equals-k](https://github.com/akshaya13/Leetcode/tree/master/0560-subarray-sum-equals-k) |\n| [0713-subarray-product-less-than-k](https://github.com/akshaya13/Leetcode/tree/master/0713-subarray-product-less-than-k) |\n| [0932-monotonic-array](https://github.com/akshaya13/Leetcode/tree/master/0932-monotonic-array) |\n| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |\n| [0965-unique-email-addresses](https://github.com/akshaya13/Leetcode/tree/master/0965-unique-email-addresses) |\n| [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) |\n| [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) |\n| [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) |\n| [2058-concatenation-of-array](https://github.com/akshaya13/Leetcode/tree/master/2058-concatenation-of-array) |\n| [2195-time-needed-to-buy-tickets](https://github.com/akshaya13/Leetcode/tree/master/2195-time-needed-to-buy-tickets) |\n## Prefix Sum\n|  |\n| ------- |\n| [0238-product-of-array-except-self](https://github.com/akshaya13/Leetcode/tree/master/0238-product-of-array-except-self) |\n| [0560-subarray-sum-equals-k](https://github.com/akshaya13/Leetcode/tree/master/0560-subarray-sum-equals-k) |\n| [0713-subarray-product-less-than-k](https://github.com/akshaya13/Leetcode/tree/master/0713-subarray-product-less-than-k) |\n## Sliding Window\n|  |\n| ------- |\n| [0219-contains-duplicate-ii](https://github.com/akshaya13/Leetcode/tree/master/0219-contains-duplicate-ii) |\n| [0424-longest-repeating-character-replacement](https://github.com/akshaya13/Leetcode/tree/master/0424-longest-repeating-character-replacement) |\n| [0438-find-all-anagrams-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0438-find-all-anagrams-in-a-string) |\n| [0713-subarray-product-less-than-k](https://github.com/akshaya13/Leetcode/tree/master/0713-subarray-product-less-than-k) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |\n| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |\n## Bucket Sort\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/akshaya13/Leetcode/tree/master/0169-majority-element) |\n| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |\n| [0387-first-unique-character-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0387-first-unique-character-in-a-string) |\n| [0451-sort-characters-by-frequency](https://github.com/akshaya13/Leetcode/tree/master/0451-sort-characters-by-frequency) |\n| [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) |\n| [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) |\n## Quickselect\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/akshaya13/Leetcode/tree/master/0347-top-k-frequent-elements) |\n## Two Pointers\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/akshaya13/Leetcode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/akshaya13/Leetcode/tree/master/0015-3sum) |\n| [0125-valid-palindrome](https://github.com/akshaya13/Leetcode/tree/master/0125-valid-palindrome) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/akshaya13/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0392-is-subsequence](https://github.com/akshaya13/Leetcode/tree/master/0392-is-subsequence) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |\n| [0680-valid-palindrome-ii](https://github.com/akshaya13/Leetcode/tree/master/0680-valid-palindrome-ii) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/akshaya13/Leetcode/tree/master/0020-valid-parentheses) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/akshaya13/Leetcode/tree/master/0070-climbing-stairs) |\n| [0121-best-time-to-buy-and-sell-stock](https://github.com/akshaya13/Leetcode/tree/master/0121-best-time-to-buy-and-sell-stock) |\n| [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) |\n| [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) |\n| [0392-is-subsequence](https://github.com/akshaya13/Leetcode/tree/master/0392-is-subsequence) |\n| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |\n| [1250-longest-common-subsequence](https://github.com/akshaya13/Leetcode/tree/master/1250-longest-common-subsequence) |\n## Binary Search\n|  |\n| ------- |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/akshaya13/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0532-k-diff-pairs-in-an-array](https://github.com/akshaya13/Leetcode/tree/master/0532-k-diff-pairs-in-an-array) |\n| [0713-subarray-product-less-than-k](https://github.com/akshaya13/Leetcode/tree/master/0713-subarray-product-less-than-k) |\n## Database\n|  |\n| ------- |\n| [0183-customers-who-never-order](https://github.com/akshaya13/Leetcode/tree/master/0183-customers-who-never-order) |\n| [0584-find-customer-referee](https://github.com/akshaya13/Leetcode/tree/master/0584-find-customer-referee) |\n| [0595-big-countries](https://github.com/akshaya13/Leetcode/tree/master/0595-big-countries) |\n| [0620-not-boring-movies](https://github.com/akshaya13/Leetcode/tree/master/0620-not-boring-movies) |\n| [0627-swap-salary](https://github.com/akshaya13/Leetcode/tree/master/0627-swap-salary) |\n| [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) |\n| [1153-product-sales-analysis-i](https://github.com/akshaya13/Leetcode/tree/master/1153-product-sales-analysis-i) |\n| [1179-game-play-analysis-i](https://github.com/akshaya13/Leetcode/tree/master/1179-game-play-analysis-i) |\n| [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) |\n| [1258-article-views-i](https://github.com/akshaya13/Leetcode/tree/master/1258-article-views-i) |\n| [1301-reformat-department-table](https://github.com/akshaya13/Leetcode/tree/master/1301-reformat-department-table) |\n| [1509-replace-employee-id-with-the-unique-identifier](https://github.com/akshaya13/Leetcode/tree/master/1509-replace-employee-id-with-the-unique-identifier) |\n| [1541-top-travellers](https://github.com/akshaya13/Leetcode/tree/master/1541-top-travellers) |\n| [1670-patients-with-a-condition](https://github.com/akshaya13/Leetcode/tree/master/1670-patients-with-a-condition) |\n| [1811-fix-names-in-a-table](https://github.com/akshaya13/Leetcode/tree/master/1811-fix-names-in-a-table) |\n| [1827-invalid-tweets](https://github.com/akshaya13/Leetcode/tree/master/1827-invalid-tweets) |\n| [1908-recyclable-and-low-fat-products](https://github.com/akshaya13/Leetcode/tree/master/1908-recyclable-and-low-fat-products) |\n| [2024-calculate-special-bonus](https://github.com/akshaya13/Leetcode/tree/master/2024-calculate-special-bonus) |\n| [2041-the-latest-login-in-2020](https://github.com/akshaya13/Leetcode/tree/master/2041-the-latest-login-in-2020) |\n## Union Find\n|  |\n| ------- |\n| [0128-longest-consecutive-sequence](https://github.com/akshaya13/Leetcode/tree/master/0128-longest-consecutive-sequence) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/akshaya13/Leetcode/tree/master/0011-container-with-most-water) |\n| [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) |\n| [0680-valid-palindrome-ii](https://github.com/akshaya13/Leetcode/tree/master/0680-valid-palindrome-ii) |\n## Simulation\n|  |\n| ------- |\n| [2058-concatenation-of-array](https://github.com/akshaya13/Leetcode/tree/master/2058-concatenation-of-array) |\n| [2195-time-needed-to-buy-tickets](https://github.com/akshaya13/Leetcode/tree/master/2195-time-needed-to-buy-tickets) |\n## Queue\n|  |\n| ------- |\n| [0387-first-unique-character-in-a-string](https://github.com/akshaya13/Leetcode/tree/master/0387-first-unique-character-in-a-string) |\n| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |\n| [2195-time-needed-to-buy-tickets](https://github.com/akshaya13/Leetcode/tree/master/2195-time-needed-to-buy-tickets) |\n## Design\n|  |\n| ------- |\n| [0535-encode-and-decode-tinyurl](https://github.com/akshaya13/Leetcode/tree/master/0535-encode-and-decode-tinyurl) |\n## Hash Function\n|  |\n| ------- |\n| [0535-encode-and-decode-tinyurl](https://github.com/akshaya13/Leetcode/tree/master/0535-encode-and-decode-tinyurl) |\n## Monotonic Queue\n|  |\n| ------- |\n| [0954-maximum-sum-circular-subarray](https://github.com/akshaya13/Leetcode/tree/master/0954-maximum-sum-circular-subarray) |\n## Math\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/akshaya13/Leetcode/tree/master/0070-climbing-stairs) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/akshaya13/Leetcode/tree/master/0070-climbing-stairs) |\n## Linked List\n|  |\n| ------- |\n| [0206-reverse-linked-list](https://github.com/akshaya13/Leetcode/tree/master/0206-reverse-linked-list) |\n## Recursion\n|  |\n| ------- |\n| [0206-reverse-linked-list](https://github.com/akshaya13/Leetcode/tree/master/0206-reverse-linked-list) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakshaya13%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fakshaya13%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fakshaya13%2Fleetcode/lists"}