{"id":23644302,"url":"https://github.com/izzatkarimov/leetcode","last_synced_at":"2025-11-11T06:30:16.186Z","repository":{"id":228270283,"uuid":"773341584","full_name":"izzatkarimov/leetcode","owner":"izzatkarimov","description":"my leetcode submissions","archived":false,"fork":false,"pushed_at":"2025-01-26T20:09:29.000Z","size":55,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-26T20:22:47.517Z","etag":null,"topics":["data-structures-and-algorithms","faang-interview","interview-preparation","leetcode","leetcode-progress","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/izzatkarimov.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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-03-17T12:09:29.000Z","updated_at":"2025-01-26T20:09:33.000Z","dependencies_parsed_at":"2024-05-11T17:29:04.872Z","dependency_job_id":"60c4c99a-628c-44c3-b9c6-0d2a05ba3766","html_url":"https://github.com/izzatkarimov/leetcode","commit_stats":null,"previous_names":["izzatkarimov/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izzatkarimov%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izzatkarimov%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izzatkarimov%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izzatkarimov%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/izzatkarimov","download_url":"https://codeload.github.com/izzatkarimov/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239587234,"owners_count":19663892,"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","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":["data-structures-and-algorithms","faang-interview","interview-preparation","leetcode","leetcode-progress","leetcode-solutions"],"created_at":"2024-12-28T12:19:11.556Z","updated_at":"2025-11-11T06:30:16.149Z","avatar_url":"https://github.com/izzatkarimov.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Leetcode Solutions\n\n### Easy\n\n| #   | Title                  | Solution | Difficulty |\n|-----|------------------------|-|----|\n| 01  | [Two Sum](https://leetcode.com/problems/two-sum/description/)            | [C++](./Easy/two_sum.cpp)| Easy |\n| 20  | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/description/)            | [C++](./Easy/20.valid_parentheses.cpp)| Easy |\n| 26  | [Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/) | [C++](./Easy/26.remove_duplicates_from_sorted_array.cpp) | Easy |\n| 217 | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/description/) | [C++](./Easy/contains_duplicate.cpp)| Easy |\n| 242 | [Valid Anagram](https://leetcode.com/problems/valid-anagram/description/)      |[C++](./Easy/contains_duplicate.cpp)|  Easy |\n| 412 | [Fizz Buzz](https://leetcode.com/problems/fizz-buzz/description/)      |[C++](./Easy/412.fizzbuzz.cpp)|  Easy |\n| 1929| [Concatenation of Array](https://leetcode.com/problems/concatenation-of-array/description/) | [C++](./Easy/1929.concatenation_of_array.cpp) | Easy |\n\n\n### Medium\n\n| #   | Title                  | Solution | Difficulty |\n|-----|------------------------|-|----|\n| 22 | [Generate Parentheses](https://leetcode.com/problems/generate-parentheses/description/)| [C++](/Medium/22.generate_parentheses.cpp) | Medium |\n| 36 | [Valid Sudoku](https://leetcode.com/problems/valid-sudoku/description/)| [C++](/Medium/36.valid_sudoku.cpp) | Medium |\n| 49 | [Group Anagrams](https://leetcode.com/problems/group-anagrams/description/)| [C++](/Medium/49.group_anagrams.cpp) | Medium |\n| 128 | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/description/)| [C++](/Medium/128.longest_consecutive_sequence.cpp) | Medium |\n| 155 | [Min Stack](https://leetcode.com/problems/min-stack/description/)| [C++](/Medium/155.min_stack.cpp) | Medium |\n| 248 | [Product of Array Except Selft](https://leetcode.com/problems/product-of-array-except-self/description/)| [C++](/Medium/248.product_of_array_except_self.cpp) | Medium |\n| 347 | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/description/)| [C++](/Medium/347.top_k_frequent_elements.cpp) | Medium | \n\n### Hard\n\n| #   | Title                  | Solution | Difficulty |\n|-----|------------------------|-|----|\n| 42 | [Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/description/)| [C++](/Hard/42.trapping_rain_water.cpp) | Hard | ","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fizzatkarimov%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fizzatkarimov%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fizzatkarimov%2Fleetcode/lists"}