{"id":25230043,"url":"https://github.com/vicen-te/leetcode","last_synced_at":"2025-07-02T20:35:46.969Z","repository":{"id":192916207,"uuid":"545102572","full_name":"Vicen-te/leetcode","owner":"Vicen-te","description":"Leetcode solutions","archived":false,"fork":false,"pushed_at":"2023-11-04T18:03:29.000Z","size":55,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-11T11:54:11.162Z","etag":null,"topics":["algorithm-challenges","algorithms","algorithms-solutions","leetcode","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/Vicen-te.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}},"created_at":"2022-10-03T19:39:00.000Z","updated_at":"2022-12-27T23:19:35.000Z","dependencies_parsed_at":null,"dependency_job_id":"58cdda70-bca9-47e3-a5cf-06965d133c41","html_url":"https://github.com/Vicen-te/leetcode","commit_stats":null,"previous_names":["vicen-te/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vicen-te%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vicen-te%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vicen-te%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Vicen-te%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Vicen-te","download_url":"https://codeload.github.com/Vicen-te/leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247353749,"owners_count":20925329,"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":["algorithm-challenges","algorithms","algorithms-solutions","leetcode","leetcode-solutions"],"created_at":"2025-02-11T11:54:22.581Z","updated_at":"2025-04-05T15:10:32.892Z","avatar_url":"https://github.com/Vicen-te.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"\nLeetCode\n========\n\n### LeetCode Algorithm\n\n| # | Title | Solution | Difficulty |\n|---| ----- | -------- | ---------- |\n|001|[Two Sum](https://leetcode.com/problems/two-sum/)| [C++](./algorithms/cpp/1-Two-Sum.cpp) |Easy|\n|002|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)| [C++](./algorithms/cpp/2-Add-Two-Numbers.cpp) |Medium|\n|003|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/)| [C++](./algorithms/cpp/3-Longest-Substring-Without-Repeating-Characters.cpp) |Medium|\n|012|[Integer to Roman](https://leetcode.com/problems/integer-to-roman/)| [C++](./algorithms/cpp/12-Integer-to-Roman.cpp) |Medium|\n|019|[Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/)| [C++](./algorithms/cpp/19-Remove-Nth-Node-From-End-of-List.cpp) |Medium|\n|034|[Find First and Last Position of Element in Sorted Array](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/)| [C++](./algorithms/cpp/34-Find-First-and-Last-Position-of-Element-in-Sorted-Array.cpp) |Medium|\n|035|[Search Insert Position](https://leetcode.com/problems/search-insert-position/)| [C++](./algorithms/cpp/35-Search-Insert-Position.cpp) |Easy|\n|118|[Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/)| [C++](./algorithms/cpp/118-Pascal's-Triangle.cpp) |Easy|\n|119|[Pascal's Triangle II](https://leetcode.com/problems/pascals-triangle-ii/)| [C++](./algorithms/cpp/119-Pascal's-Triangle-II.cpp) |Easy|\n|167|[Two Sum II - Input Array Is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)| [C++](./algorithms/cpp/167-Two-Sum-II-Input-Array-Is-Sorted.cpp) |\n|169|[Majority Element](https://leetcode.com/problems/majority-element/)| [C++](./algorithms/cpp/169-Majority-Element.cpp) |Easy|\n|189|[Rotate Array](https://leetcode.com/problems/rotate-array/)| [C++](./algorithms/cpp/189-Rotate-Array.cpp) |Medium|\n|229|[Majority Element II](https://leetcode.com/problems/majority-element-ii/)| [C++](./algorithms/cpp/229-Majority-Element-II.cpp) |Medium|\n|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)| [C++](./algorithms/cpp/237-Delete-Node-in-a-Linked-List.cpp) |Medium|\n|278|[First Bad Version](https://leetcode.com/problems/first-bad-version/)| [C++](./algorithms/cpp/278-First-Bad-Version.cpp) |Easy|\n|283|[Move Zeroes](https://leetcode.com/problems/move-zeroes/)| [C++](./algorithms/cpp/283-Move-Zeroes.cpp) |Easy|\n|341|[Flatten Nested List Iterator](https://leetcode.com/problems/flatten-nested-list-iterator/)| [C++]( ./algorithms/cpp/341-Flatten-Nested-List-Iterator.cpp) |Medium|\n|342|[Power of Four](https://leetcode.com/problems/power-of-four/)| [C++]( ./algorithms/cpp/342-Power-of-Four.cpp) |Easy|\n|344|[Reverse String](https://leetcode.com/problems/reverse-string/)| [C++]( ./algorithms/cpp/344-Reverse-String.cpp) |Easy|\n|377|[Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/)| [C++]( ./algorithms/cpp/377-Combination-Sum-IV.cpp) |Medium|\n|389|[Find the Difference](https://leetcode.com/problems/find-the-difference/)| [C++]( ./algorithms/cpp/389-Find-the-Difference.cpp) |Easy|\n|392|[Is Subsequence](https://leetcode.com/problems/is-subsequence/)| [C++]( ./algorithms/cpp/392-Is-Subsequence.cpp) |Easy|\n|515|[Find Largest Value in Each Tree Row](https://leetcode.com/problems/find-largest-value-in-each-tree-row/)| [C++]( ./algorithms/cpp/515-Find-Largest-Value-in-Each-Tree-Row.cpp) |Medium|\n|557|[Reverse Words in a String III](https://leetcode.com/problems/reverse-words-in-a-string-iii/)| [C++]( ./algorithms/cpp/557-Reverse-Words-in-a-String-III.cpp) |Easy|\n|704|[Binary Search](https://leetcode.com/problems/binary-search/)| [C++]( ./algorithms/cpp/704-Binary-Search.cpp) |Easy|\n|779|[K-th Symbol in Grammar](https://leetcode.com/problems/k-th-symbol-in-grammar/)| [C++]( ./algorithms/cpp/779-K-th-Symbol-in-Grammar.cpp) |Medium|\n|823|[Binary Trees With Factors](https://leetcode.com/problems/binary-trees-with-factors/)| [C++]( ./algorithms/cpp/823-Binary-Trees-With-Factors.cpp) |Medium|\n|844|[Backspace String Compare](https://leetcode.com/problems/backspace-string-compare/)| [C++]( ./algorithms/cpp/844-Backspace-String-Compare.cpp) |Easy|\n|876|[Middle of the Linked List](https://leetcode.com/problems/middle-of-the-linked-list/)| [C++]( ./algorithms/cpp/876-Middle-of-the-Linked-List.cpp) |Easy|\n|880|[Decoded String at Index](https://leetcode.com/problems/decoded-string-at-index/)| [C++]( ./algorithms/cpp/880-Decoded-String-at-Index.cpp) |Medium|\n|896|[Monotonic Array](https://leetcode.com/problems/monotonic-array/)| [C++]( ./algorithms/cpp/896-Monotonic-Array.cpp) |Easy|\n|905|[Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/)| [C++]( ./algorithms/cpp/905-Sort-Array-By-Parity.cpp) |Easy|\n|977|[Squares of a Sorted Array](https://leetcode.com/problems/squares-of-a-sorted-array/)| [C++](./algorithms/cpp/977-Squares-of-a-Sorted-Array.cpp) |Easy|\n|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)| [C++](./algorithms/cpp/1071-Greatest-Common-Divisor-of-Strings.cpp) |Easy|\n|1095|[Find in Mountain Array](https://leetcode.com/problems/find-in-mountain-array/)| [C++](./algorithms/cpp/1095-Find-in-Mountain-Array.cpp) |Hard|\n|1356|[Sort Integers by The Number of 1 Bits](https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/)| [C++](./algorithms/cpp/1356-Sort-Integers-by-The-Number-of-1-Bits.cpp) |Easy|\n|1431|[Kids With the Greatest Number of Candies](https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/)| [C++](./algorithms/cpp/1431-Kids-With-the-Greatest-Number-of-Candies.cpp) |Easy|\n|1768|[Merge Strings Alternately](https://leetcode.com/problems/merge-strings-alternately/)| [C++](./algorithms/cpp/1768-Merge-Strings-Alternately.cpp) |Easy| \n|2265|[Count Nodes Equal to Average of Subtree](https://leetcode.com/problems/count-nodes-equal-to-average-of-subtree/)| [C++](./algorithms/cpp/2265-Count-Nodes-Equal-to-Average-of-Subtree.cpp) |Medium|\n\n========\n\n### LeetCode DataBase\n| # | Title | Solution | Difficulty |\n|---| ----- | -------- | ---------- |\n\n========\n\n### LeetCode Shell\n| # | Title | Solution | Difficulty |\n|---| ----- | -------- | ---------- |\n\n========\n\n### LeetCode Concurrency\n| # | Title | Solution | Difficulty |\n|---| ----- | -------- | ---------- |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvicen-te%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fvicen-te%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fvicen-te%2Fleetcode/lists"}