{"id":16567210,"url":"https://github.com/mezdelex/leetcode","last_synced_at":"2026-04-12T14:45:44.341Z","repository":{"id":152996285,"uuid":"482495315","full_name":"mezdelex/LeetCode","owner":"mezdelex","description":"LeetCode problems","archived":false,"fork":false,"pushed_at":"2024-07-26T06:48:51.000Z","size":89616,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-02T04:30:36.865Z","etag":null,"topics":["algorithms","cpp","csharp","data-structures","haskell","leetcode","rust"],"latest_commit_sha":null,"homepage":"","language":"Rust","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/mezdelex.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":"2022-04-17T10:43:27.000Z","updated_at":"2024-07-26T06:48:54.000Z","dependencies_parsed_at":null,"dependency_job_id":"a3c68a51-92cf-4c8d-a147-6a535efc9abb","html_url":"https://github.com/mezdelex/LeetCode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mezdelex%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mezdelex%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mezdelex%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mezdelex%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mezdelex","download_url":"https://codeload.github.com/mezdelex/LeetCode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":242008914,"owners_count":20056988,"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":["algorithms","cpp","csharp","data-structures","haskell","leetcode","rust"],"created_at":"2024-10-11T21:05:57.778Z","updated_at":"2025-12-31T01:00:46.049Z","avatar_url":"https://github.com/mezdelex.png","language":"Rust","readme":"# LeetCode\n\nLeetCode problem solving to improve my programming expertise while learning some algorithms.\n\n| ID | Problem | Algorithm | C++ | C# | Rust |\n| :--: | :----------------------------------------: | :--------------------------------------------------------------------------------------------------------------------: | :---------------------------------------------------------------------------------------------------------------: | :----------------------------------------------------------------------------------------------------------------------------: | :--------------------------------------------------------------------------------------------------------------------: |\n| - | Round Robin Algorithm | [Round Robin](https://en.wikipedia.org/wiki/Round-robin_scheduling) | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/RoundRobinScheduler.cs) | - |\n| - | Frecuency of Strings | | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/FrecuencyOfStrings.cs) | - |\n| 1 | Two Sum | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0001_TwoSum.cpp) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0001_TwoSum.cs) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0001_two_sum.rs) |\n| 2 | Add Two Numbers | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0002_AddTwoNumbers.cs) | - |\n| 3 | Length of Longest Substring | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0003_LongestSubstringWithoutRepeatingCharacters.cs) | - |\n| 4 | Median of Two Sorted Arrays | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0004_MedianOfTwoSortedArrays.cs) | - |\n| 5 | Longest Palindromic Substring | [Expand from Center](https://medium.com/javarevisited/expand-from-center-algorithm-dp-pattern-palindrome-306b542ae916) | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0005_LongestPalindromicSubstring.cs) | - |\n| 9 | Palindrome Number | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0009_PalindromeNumber.cpp) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0009_PalindromeNumber.cs) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0009_palindrome_number.rs) |\n| 13 | Roman to Integer | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0013_RomanToInteger.cpp) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0013_RomanToInteger.cs) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0013_roman_to_integer.rs) |\n| 14 | Longest Common Prefix | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0014_LongestCommonPrefix.cpp) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0014_LongestCommonPrefix.cs) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0014_longest_common_prefix.rs) |\n| 20 | Valid Parentheses | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0020_ValidParentheses.cpp) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0020_ValidParentheses.cs) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0020_valid_parentheses.rs) |\n| 21 | Merge Two Sorted Lists | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0021_MergeTwoSortedLists.cpp) | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0021_merge_two_sorted_lists.rs) |\n| 26 | Remove Duplicates from Sorted Array | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0026_RemoveDuplicatesFromSortedArray.cpp) | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0026_remove_duplicates_from_sorted_array.rs) |\n| 27 | Remove Element | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0027_RemoveElement.cpp) | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0027_remove_element.rs) |\n| 28 | Implement strStr() | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0028_Implement_strStr.cpp) | - | - |\n| 35 | Search Insert Position | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0035_SearchInsertPosition.cpp) | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0035_search_insert_position.rs) |\n| 48 | Rotate Image | - | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0048_rotate_image.rs) |\n| 53 | Maximum Subarray | [Kadane](https://en.wikipedia.org/wiki/Maximum_subarray_problem) | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0053_MaximumSubarray.cpp) | - | - |\n| 58 | Length of Last Word | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0058_LengthOfLastWord.cpp) | - | - |\n| 66 | Plus One | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0066_PlusOne.cpp) | - | - |\n| 67 | Add Binary | - | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0067_add_binary.rs) |\n| 70 | Climbing Stairs | [Fibonacci](https://en.wikipedia.org/wiki/Fibonacci_number) | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0070_climbing_stairs.rs) |\n| 104 | Maximum Depth of Binary Tree | - | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0104_maximum_depth_of_binary_tree.rs) |\n| 108 | Pascal's Triangle | [Pascal's Triangle](https://en.wikipedia.org/wiki/Pascal%27s_triangle) | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0108_pascals_triangle.rs) |\n| 191 | Number of 1 Bits | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/0191_NumberOf1Bits.cs) | - |\n| 383 | Ransom Note | - | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0383_ransom_note.rs) |\n| 869 | Reordered Power of 2 | - | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_0869_reordered_power_of_2.rs) |\n| 897 | Increasing Order Search Tree | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/cpp/src/0897_IncreasingOrderSearchTree.cpp) | - | - |\n| 1329 | Sort the Matrix Diagonally | - | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/rust/src/_1329_sort_the_matrix_diagonally.rs) |\n| 1342 | Number of Steps to Reduce a Number to Zero | - | - | [Solution/Tests](https://github.com/mezdelex/LeetCode/blob/main/csharp/src/1342_NumberOfStepsToReduceANumberToZero.cs) | - |\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmezdelex%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmezdelex%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmezdelex%2Fleetcode/lists"}