{"id":48341361,"url":"https://github.com/mbtakanov/leet-code","last_synced_at":"2026-04-05T05:02:07.456Z","repository":{"id":320444587,"uuid":"1081356851","full_name":"mbtakanov/leet-code","owner":"mbtakanov","description":"LeetCode solutions in Python organized by algorithmic patterns. Each solution includes problem description, and time/space complexity analysis.","archived":false,"fork":false,"pushed_at":"2025-11-21T19:57:15.000Z","size":46,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-11-21T21:21:35.580Z","etag":null,"topics":["algorithms","data-structures","interview-preparation","leetcode","programming-challenges","python"],"latest_commit_sha":null,"homepage":"https://leetcode.com/","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/mbtakanov.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-10-22T17:06:35.000Z","updated_at":"2025-11-21T19:57:18.000Z","dependencies_parsed_at":"2025-10-23T21:30:38.343Z","dependency_job_id":"5234ee18-ca57-41a4-bc3b-539fe0f08179","html_url":"https://github.com/mbtakanov/leet-code","commit_stats":null,"previous_names":["mbtakanov/leet-code"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/mbtakanov/leet-code","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbtakanov%2Fleet-code","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbtakanov%2Fleet-code/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbtakanov%2Fleet-code/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbtakanov%2Fleet-code/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mbtakanov","download_url":"https://codeload.github.com/mbtakanov/leet-code/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mbtakanov%2Fleet-code/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31424931,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-05T02:22:46.605Z","status":"ssl_error","status_checked_at":"2026-04-05T02:22:33.263Z","response_time":75,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["algorithms","data-structures","interview-preparation","leetcode","programming-challenges","python"],"created_at":"2026-04-05T05:02:06.758Z","updated_at":"2026-04-05T05:02:07.451Z","avatar_url":"https://github.com/mbtakanov.png","language":"Python","readme":"LeetCode\n========\n| # | Title | Solution | Algorithm | Difficulty |\n|---| ----- | -------- | --------- | ---------- |\n|0001|[Two Sum](https://leetcode.com/problems/two-sum)|[Python](./algorithms/hashmap/0001_two_sum.py)|Hashmap|![](https://img.shields.io/badge/Easy-green)|\n|0002|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers)|[Python](./algorithms/linked_list/0002_add_two_numbers.py)|Linked List|![](https://img.shields.io/badge/Medium-orange)|\n|0003|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)|[Python](./algorithms/sliding_window/0003_longest_substring_without_repeating_characters.py)|Sliding Window|![](https://img.shields.io/badge/Medium-orange)|\n|0011|[Container With Most Water](https://leetcode.com/problems/container-with-most-water)|[Python](./algorithms/two_pointers/0011_container_with_most_water.py)|Two Pointers|![](https://img.shields.io/badge/Easy-green)|\n|0012|[Integer to Roman](https://leetcode.com/problems/integer-to-roman)|[Python](./algorithms/array_string/0012_integer_to_roman.py)|Array \u0026 String|![](https://img.shields.io/badge/Medium-orange)|\n|0013|[Roman to Integer](https://leetcode.com/problems/roman-to-integer)|[Python](./algorithms/array_string/0013_roman_to_integer.py)|Array \u0026 String|![](https://img.shields.io/badge/Easy-green)|\n|0014|[Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix)|[Python](./algorithms/array_string/0014_longest_common_prefix.py)|Array \u0026 String|![](https://img.shields.io/badge/Easy-green)|\n|0015|[3Sum](https://leetcode.com/problems/3sum)|[Python](./algorithms/two_pointers/0015_3sum.py)|Two Pointers|![](https://img.shields.io/badge/Medium-orange)|\n|0020|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses)|[Python](./algorithms/stack/0020_valid_parentheses.py)|Stack|![](https://img.shields.io/badge/Easy-green)|\n|0021|[Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)|[Python](./algorithms/linked_list/0021_merge_two_sorted_lists.py)|Linked List|![](https://img.shields.io/badge/Easy-green)|\n|0026|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array)|[Python](./algorithms/array_string/0026_remove_duplicates_from_sorted_array.py)|Array \u0026 String|![](https://img.shields.io/badge/Easy-green)|\n|0027|[Remove Element](https://leetcode.com/problems/remove-element)|[Python](./algorithms/array_string/0027_remove_element.py)|Array \u0026 String|![](https://img.shields.io/badge/Easy-green)|\n|0028|[Find the Index of the First Occurrence in a String](https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string)|[Python](./algorithms/array_string/0028_find_the_index_of_the_first_occurrence_in_a_string.py)|Array \u0026 String|![](https://img.shields.io/badge/Easy-green)|\n|0045|[Jump Game II](https://leetcode.com/problems/jump-game-ii)|[Python](./algorithms/array_string/0045_jump_game_ii.py)|Array \u0026 String|![](https://img.shields.io/badge/Medium-orange)|\n|0049|[Group Anagrams](https://leetcode.com/problems/group-anagrams)|[Python](./algorithms/hashmap/0049_group_anagrams.py)|Hashmap|![](https://img.shields.io/badge/Medium-orange)|\n|0055|[Jump Game](https://leetcode.com/problems/jump-game)|[Python](./algorithms/array_string/0055_jump_game.py)|Array \u0026 String|![](https://img.shields.io/badge/Medium-orange)|\n|0056|[Merge Intervals](https://leetcode.com/problems/merge-intervals)|[Python](./algorithms/intervals/0056_merge_intervals.py)|Intervals|![](https://img.shields.io/badge/Medium-orange)|\n|0057|[Insert Interval](https://leetcode.com/problems/insert-interval)|[Python](./algorithms/intervals/0057_insert_interval.py)|Intervals|![](https://img.shields.io/badge/Medium-orange)|\n|0058|[Length of Last Word](https://leetcode.com/problems/length-of-last-word)|[Python](./algorithms/array_string/0058_length_of_last_word.py)|Array \u0026 String|![](https://img.shields.io/badge/Easy-green)|\n|0080|[Remove Duplicates from Sorted Array II](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii)|[Python](./algorithms/array_string/0080_remove_duplicates_from_sorted_array_ii.py)|Array \u0026 String|![](https://img.shields.io/badge/Medium-orange)|\n|0088|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array)|[Python](./algorithms/array_string/0088_merge_sorted_array.py)|Array \u0026 String|![](https://img.shields.io/badge/Easy-green)|\n|0092|[Reverse Linked List II](https://leetcode.com/problems/reverse-linked-list-ii)|[Python](./algorithms/linked_list/0092_reverse_linked_list_ii.py)|Linked List|![](https://img.shields.io/badge/Medium-orange)|\n|0121|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)|[Python](./algorithms/array_string/0121_best_time_to_buy_and_sell_stock.py)|Array \u0026 String|![](https://img.shields.io/badge/Easy-green)|\n|0122|[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii)|[Python](./algorithms/array_string/0122_best_time_to_buy_and_sell_stock_ii.py)|Array \u0026 String|![](https://img.shields.io/badge/Medium-orange)|\n|0125|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome)|[Python](./algorithms/two_pointers/0125_valid_palindrome.py)|Two Pointers|![](https://img.shields.io/badge/Easy-green)|\n|0128|[Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence)|[Python](./algorithms/hashmap/0128_longest_consecutive_sequence.py)|Hashmap|![](https://img.shields.io/badge/Medium-orange)|\n|0141|[Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)|[Python](./algorithms/linked_list/0141_linked_list_cycle.py)|Linked List|![](https://img.shields.io/badge/Easy-green)|\n|0146|[LRU Cache](https://leetcode.com/problems/lru-cache)|[Python](./algorithms/linked_list/0146_lru_cache.py)|Linked List|![](https://img.shields.io/badge/Medium-orange)|\n|0151|[Reverse Words in a String](https://leetcode.com/problems/reverse-words-in-a-string)|[Python](./algorithms/array_string/0151_reverse_words_in_a_string.py)|Array \u0026 String|![](https://img.shields.io/badge/Medium-orange)|\n|0167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted)|[Python](./algorithms/two_pointers/0167_two_sum_ii_input_array_is_sorted.py)|Two Pointers|![](https://img.shields.io/badge/Medium-orange)|\n|0169|[Majority Element](https://leetcode.com/problems/majority-element)|[Python](./algorithms/array_string/0169_majority_element.py)|Array \u0026 String|![](https://img.shields.io/badge/Easy-green)|\n|0202|[Happy Number](https://leetcode.com/problems/happy-number)|[Python](./algorithms/hashmap/0202_happy_number.py)|Hashmap|![](https://img.shields.io/badge/Easy-green)|\n|0205|[Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings)|[Python](./algorithms/hashmap/0205_isomorphic_strings.py)|Hashmap|![](https://img.shields.io/badge/Easy-green)|\n|0209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum)|[Python](./algorithms/sliding_window/0209_minimum_size_subarray_sum.py)|Sliding Window|![](https://img.shields.io/badge/Medium-orange)|\n|0219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii)|[Python](./algorithms/hashmap/0219_contains_duplicate_ii.py)|Hashmap|![](https://img.shields.io/badge/Easy-green)|\n|0228|[Summary Ranges](https://leetcode.com/problems/summary-ranges)|[Python](./algorithms/intervals/0228_summary_ranges.py)|Intervals|![](https://img.shields.io/badge/Easy-green)|\n|0242|[Valid Anagram](https://leetcode.com/problems/valid-anagram)|[Python](./algorithms/hashmap/0242_valid_anagram.py)|Hashmap|![](https://img.shields.io/badge/Easy-green)|\n|0274|[H-Index](https://leetcode.com/problems/h-index)|[Python](./algorithms/array_string/0274_h_index.py)|Array \u0026 String|![](https://img.shields.io/badge/Medium-orange)|\n|0290|[Word Pattern](https://leetcode.com/problems/word-pattern)|[Python](./algorithms/hashmap/0290_word_pattern.py)|Hashmap|![](https://img.shields.io/badge/Easy-green)|\n|0380|[Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1)|[Python](./algorithms/array_string/0380_insert_delete_get_random_o(1).py)|Array \u0026 String|![](https://img.shields.io/badge/Medium-orange)|\n|0383|[Ransom Note](https://leetcode.com/problems/ransom-note)|[Python](./algorithms/hashmap/0383_ransom_note.py)|Hashmap|![](https://img.shields.io/badge/Easy-green)|\n|0392|[Is Subsequence](https://leetcode.com/problems/is-subsequence)|[Python](./algorithms/two_pointers/0392_is_subsequence.py)|Two Pointers|![](https://img.shields.io/badge/Easy-green)|\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmbtakanov%2Fleet-code","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmbtakanov%2Fleet-code","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmbtakanov%2Fleet-code/lists"}