{"id":22799705,"url":"https://github.com/git-vish/leetcode-python","last_synced_at":"2025-08-15T18:42:39.886Z","repository":{"id":255913831,"uuid":"330571621","full_name":"git-vish/leetcode-python","owner":"git-vish","description":"LeetCode Coding interview questions solved in Python.","archived":false,"fork":false,"pushed_at":"2021-04-28T04:06:43.000Z","size":81,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-07-18T05:36:29.892Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/git-vish.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":"2021-01-18T06:10:44.000Z","updated_at":"2021-04-28T04:06:45.000Z","dependencies_parsed_at":"2024-09-07T20:42:13.959Z","dependency_job_id":null,"html_url":"https://github.com/git-vish/leetcode-python","commit_stats":null,"previous_names":["git-vish/leetcode-python"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/git-vish/leetcode-python","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/git-vish%2Fleetcode-python","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/git-vish%2Fleetcode-python/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/git-vish%2Fleetcode-python/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/git-vish%2Fleetcode-python/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/git-vish","download_url":"https://codeload.github.com/git-vish/leetcode-python/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/git-vish%2Fleetcode-python/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":269356128,"owners_count":24403504,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-08-08T02:00:09.200Z","response_time":72,"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":[],"created_at":"2024-12-12T07:09:42.322Z","updated_at":"2025-08-15T18:42:39.825Z","avatar_url":"https://github.com/git-vish.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Python\nLeetCode Coding interview questions solved in Python.\n\n| Index | Problem | Solution |\n| --- | --- | ---| \n|1|[Number of Islands](https://leetcode.com/problems/number-of-islands/) | [solution](Problems/island.py)|\n|2|[Power of Two](https://leetcode.com/problems/power-of-two/)| [solution](Problems/power_of_two.py)|\n|3|[Valid Parentheses](https://leetcode.com/problems/valid-parentheses/)| [solution](Problems/valid_parentheses.py)|\n|4|[Single Number](https://leetcode.com/problems/single-number/)| [solution](Problems/single_number.py)|\n|5|[Fizz Buzz](https://leetcode.com/problems/fizz-buzz/)| [solution](Problems/fizz_buzz.py)|\n|6|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)|[solution](Problems/contains_duplicate.py)|\n|7|[Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/)|[solution](Problems/stocks.py)|\n|8|[First Unique Character in a String](https://leetcode.com/problems/first-unique-character-in-a-string/)|[solution](Problems/first_unique_char.py)|\n|9|[Valid Anagram](https://leetcode.com/problems/valid-anagram/)|[solution](Problems/valid_anagram.py)|\n|10|[Find Peak Element](https://leetcode.com/problems/find-peak-element/)|[solution](Problems/find_peak.py)|\n|11|[Two Sum](https://leetcode.com/problems/two-sum/)|[solution](Problems/two_sum.py)|\n|12|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)|[solution](Problems/backspace_string.py)|\n|13|[Move Zeroes](https://leetcode.com/problems/move-zeroes/)|[solution](Problems/move_zeros.py)|\n|14|[Reverse Integer](https://leetcode.com/problems/reverse-integer/)|[solution](Problems/reverse_int.py)|\n|15|[Plus One](https://leetcode.com/problems/plus-one/)|[solution](Problems/plus_one.py)|\n|16|[First Bad Version](https://leetcode.com/problems/first-bad-version/)|[solution](Problems/first_bad_version.py)|\n|17|[Robot Return to Origin](https://leetcode.com/problems/robot-return-to-origin/)|[solution](Problems/robot_origin.py)|\n|18|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)|[solution](Problems/contains_duplicate_2.py)|\n|19|[Find the Difference](https://leetcode.com/problems/find-the-difference/)|[solution](Problems/find_the_difference.py)|\n|20|[Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)|[solution](Problems/array_to_bst.py)|\n|21|[Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)|[solution](Problems/array_intersection.py)|\n|22|[Missing Number](https://leetcode.com/problems/missing-number/)|[solution](Problems/missing_number.py)|\n|23|[Moving Average from Data Stream](https://leetcode.com/problems/moving-average-from-data-stream/)|[solution](Problems/moving_average.py)|\n|24|[Majority Element](https://leetcode.com/problems/majority-element/)|[solution](Problems/majority_element.py)|\n|25|[Hamming Distance](https://leetcode.com/problems/hamming-distance/)|[solution](Problems/hamming_distance.py)|\n|26|[Single Number II](https://leetcode.com/problems/single-number-ii/)|[solution](Problems/single_number_2.py)|\n|27|[Path Sum](https://leetcode.com/problems/path-sum/)|[solution](Problems/path_sum.py)|\n|28|[Remove Element](https://leetcode.com/problems/remove-element/)|[solution](Problems/remove_element.py)|\n|29|[Number Complement](https://leetcode.com/problems/number-complement/)|[solution](Problems/number_complement.py)|\n|30|[Climbing Stairs](https://leetcode.com/problems/climbing-stairs/)|[solution](Problems/stairs.py)|\n|31|[Lowest Common Ancestor](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)|[solution](Problems/lowest_common_ancestor.py)|\n|32|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/)|[solution](Problems/jewels_and_stones.py)|\n|33|[Binary Number with Alternating Bits](https://leetcode.com/problems/binary-number-with-alternating-bits/)|[solution](Problems/bin_alternating_bits.py)|\n|34|[Valid Palindrome](https://leetcode.com/problems/valid-palindrome/)|[solution](Problems/valid_palindrome.py)|\n|35|[Find All Numbers Disappeared in an Array](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/)|[solution](Problems/disappeared_numbers.py)|\n|36|[Container With Most Water](https://leetcode.com/problems/container-with-most-water/)|[solution](Problems/water_container.py)|\n|37|[Monotonic Array](https://leetcode.com/problems/monotonic-array/)|[solution](Problems/monotonic_array.py)|\n|38|[Sum of Left Leaves](https://leetcode.com/problems/sum-of-left-leaves/)|[solution](Problems/sum_of_left_leaves.py)|\n|39|[Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/)|[solution](Problems/remove_duplicates.py)|\n|40|[Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)|[solution](Problems/tree_postorder.py)|\n|41|[Flipping an Image](https://leetcode.com/problems/flipping-an-image/)|[solution](Problems/image_flip.py)|\n|42|[Kth Largest Element in an Array](https://leetcode.com/problems/kth-largest-element-in-an-array/)|[solution](Problems/kth_largest.py)|\n|43|The Slippery Pole (TechGig)|[solution](Problems/slippery_pole.py)|\n|44|[Flood Fill](https://leetcode.com/problems/flood-fill/)|[solution](Problems/flood_fill.py)|\n|45|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)|[solution](Problems/reverse_linked_list.py)|\n|46|[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)|[solution](Problems/level_order.py)|\n|47|[K Closest Points to Origin](https://leetcode.com/problems/k-closest-points-to-origin/)|[solution](Problems/k_closest_points.py)|\n|48|[Max Area of Island](https://leetcode.com/problems/max-area-of-island/)|[solution](Problems/max_area_island.py)|\n|49|[Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/)|[solution](Problems/sort_by_frequency.py)|\n|50|[Frog Jump](https://leetcode.com/problems/frog-jump/)|[solution](Problems/frog_jump.py)|\n|51|[Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/)|[solution](Problems/merge_k_sorted_lists.py)|\n|52|[License Key Formatting](https://leetcode.com/problems/license-key-formatting/)|[solution](Problems/license_key.py)|\n|53|[Group Anagrams](https://leetcode.com/problems/group-anagrams/)|[solution](Problems/group_anagrams.py)|\n|54|[Detect Capital](https://leetcode.com/problems/detect-capital/)|[solution](Problems/detect_capital.py)|\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgit-vish%2Fleetcode-python","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fgit-vish%2Fleetcode-python","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fgit-vish%2Fleetcode-python/lists"}