{"id":25970632,"url":"https://github.com/michaelehab/leetcode-may-challenge-2022","last_synced_at":"2026-07-21T17:52:49.547Z","repository":{"id":162547141,"uuid":"487512235","full_name":"michaelehab/LeetCode-May-Challenge-2022","owner":"michaelehab","description":"This Repository contains my solutions to May LeetCoding Challenge 2022 problems.","archived":false,"fork":false,"pushed_at":"2022-05-31T13:47:24.000Z","size":71,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-04T23:18:31.310Z","etag":null,"topics":["algorithms","backtracking","binary-search","bit-manipulation","cpp","dfs","leetcode","leetcode-solutions","problem-solving","recursion","strings","two-pointers"],"latest_commit_sha":null,"homepage":"","language":"C++","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/michaelehab.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":"2022-05-01T10:53:43.000Z","updated_at":"2022-06-02T14:51:36.000Z","dependencies_parsed_at":null,"dependency_job_id":"d83becff-78a7-4fc0-92fb-8828ddc63aa6","html_url":"https://github.com/michaelehab/LeetCode-May-Challenge-2022","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/michaelehab/LeetCode-May-Challenge-2022","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michaelehab%2FLeetCode-May-Challenge-2022","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michaelehab%2FLeetCode-May-Challenge-2022/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michaelehab%2FLeetCode-May-Challenge-2022/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michaelehab%2FLeetCode-May-Challenge-2022/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/michaelehab","download_url":"https://codeload.github.com/michaelehab/LeetCode-May-Challenge-2022/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/michaelehab%2FLeetCode-May-Challenge-2022/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279006334,"owners_count":26084083,"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-10-11T02:00:06.511Z","response_time":55,"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":["algorithms","backtracking","binary-search","bit-manipulation","cpp","dfs","leetcode","leetcode-solutions","problem-solving","recursion","strings","two-pointers"],"created_at":"2025-03-04T23:18:38.738Z","updated_at":"2025-10-11T05:06:48.505Z","avatar_url":"https://github.com/michaelehab.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 🏅May 2022 LeetCoding Challenge!🏅\n## Introduction\nThis Repository contains my solutions to May LeetCoding Challenge 2022 problems.\n* I strongly advise you to try to solve problems on your own before looking at the solutions provided here.\n* Solutions and approaches may not be optimal.\n* All Solutions here are in C++.\n* Checkout my LeetCode profile at \u003ca href=\"https://leetcode.com/michaelehab/\"\u003emichaelehab\u003c/a\u003e\n\n## Solutions\n1. \u003ca href=\"./844.Backspace-String-Compare.cpp\"\u003eBackspace String Compare\u003c/a\u003e\n2. \u003ca href=\"./905.Sort-Array-By-Parity.cpp\"\u003eSort Array By Parity\u003c/a\u003e\n3. \u003ca href=\"./581.Shortest-Unsorted-Continuous-Subarray.cpp\"\u003eShortest Unsorted Continuous Subarray\u003c/a\u003e\n4. \u003ca href=\"./1679.Max-Number-of-K-Sum-Pairs.cpp\"\u003eMax Number of K-Sum Pairs\u003c/a\u003e\n5. \u003ca href=\"./225.Implement-Stack-using-Queues.cpp\"\u003eImplement Stack using Queues\u003c/a\u003e\n6. \u003ca href=\"./1209.Remove-All-Adjacent-Duplicates-in-String-II.cpp\"\u003eRemove All Adjacent Duplicates in String II\u003c/a\u003e\n7. \u003ca href=\"./456.132-Pattern.cpp\"\u003e132 Pattern\u003c/a\u003e\n8. \u003ca href=\"./341.Flatten-Nested-List-Iterator.cpp\"\u003eFlatten Nested List Iterator\u003c/a\u003e\n9. \u003ca href=\"./17.Letter-Combinations-of-a-Phone-Number.cpp\"\u003eLetter Combinations of a Phone Number\u003c/a\u003e\n10. \u003ca href=\"./216.Combination-Sum-III.cpp\"\u003eCombination Sum III\u003c/a\u003e\n11. \u003ca href=\"./1641.Count-Sorted-Vowel-Strings.cpp\"\u003eCount Sorted Vowel Strings\u003c/a\u003e\n12. \u003ca href=\"./47.Permutations-II.cpp\"\u003ePermutations II\u003c/a\u003e\n13. \u003ca href=\"./117.Populating-Next-Right-Pointers-in-Each-Node-II.cpp\"\u003ePopulating Next Right Pointers in Each Node II\u003c/a\u003e\n14. \u003ca href=\"./743.Network-Delay-Time.cpp\"\u003eNetwork Delay Time\u003c/a\u003e\n15. \u003ca href=\"./1302.Deepest-Leaves-Sum.cpp\"\u003eDeepest Leaves Sum\u003c/a\u003e\n16. \u003ca href=\"./1091.Shortest-Path-in-Binary-Matrix.cpp\"\u003eShortest Path in Binary Matrix\u003c/a\u003e\n17. \u003ca href=\"./1379.Find-a-Corresponding-Node-of-a-Binary-Tree-in-a-Clone-of-That-Tree.cpp\"\u003eFind a Corresponding Node of a Binary Tree in a Clone of That Tree\u003c/a\u003e\n18. \u003ca href=\"./1192.Critical-Connections-in-a-Network.cpp\"\u003eCritical Connections in a Network\u003c/a\u003e\n19. \u003ca href=\"./329.Longest-Increasing-Path-in-a-Matrix.cpp\"\u003eLongest Increasing Path in a Matrix\u003c/a\u003e\n20. \u003ca href=\"./63.Unique-Paths-II.cpp\"\u003eUnique Paths II\u003c/a\u003e\n21. \u003ca href=\"./322.Coin-Change.cpp\"\u003eCoin Change\u003c/a\u003e\n22. \u003ca href=\"./647.Palindromic-Substrings.cpp\"\u003ePalindromic Substrings\u003c/a\u003e\n23. \u003ca href=\"./474.Ones-and-Zeroes.cpp\"\u003eOnes and Zeroes\u003c/a\u003e\n24. \u003ca href=\"./32.Longest-Valid-Parentheses.cpp\"\u003eLongest Valid Parentheses\u003c/a\u003e\n25. \u003ca href=\"./354.Russian-Doll-Envelopes.cpp\"\u003eRussian Doll Envelopes\u003c/a\u003e\n26. \u003ca href=\"./191.Number-of-1-Bits.cpp\"\u003eNumber of 1 Bits\u003c/a\u003e\n27. \u003ca href=\"./1342.Number-of-Steps-to-Reduce-a-Number-to-Zero.cpp\"\u003eNumber of Steps to Reduce a Number to Zero\u003c/a\u003e\n28. \u003ca href=\"./268.Missing-Number.cpp\"\u003eMissing Number\u003c/a\u003e\n29. \u003ca href=\"./318.Maximum-Product-of-Word-Lengths.cpp\"\u003eMaximum Product of Word Lengths\u003c/a\u003e\n30. \u003ca href=\"./29.Divide-Two-Integers.cpp\"\u003eDivide Two Integers\u003c/a\u003e\n31. \u003ca href=\"./1461.Check-If-a-String-Contains-All-Binary-Codes-of-Size-K.cpp\"\u003eCheck If a String Contains All Binary Codes of Size K\u003c/a\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichaelehab%2Fleetcode-may-challenge-2022","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmichaelehab%2Fleetcode-may-challenge-2022","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmichaelehab%2Fleetcode-may-challenge-2022/lists"}