{"id":15432480,"url":"https://github.com/thomasrayner/leetcode-may2020challenge","last_synced_at":"2025-10-28T20:09:47.341Z","repository":{"id":116918305,"uuid":"260493803","full_name":"thomasrayner/leetcode-may2020challenge","owner":"thomasrayner","description":null,"archived":false,"fork":false,"pushed_at":"2020-05-31T22:17:05.000Z","size":269,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-12T13:56:27.096Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/thomasrayner.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":"2020-05-01T15:31:58.000Z","updated_at":"2020-05-31T22:17:07.000Z","dependencies_parsed_at":"2023-04-19T06:17:25.950Z","dependency_job_id":null,"html_url":"https://github.com/thomasrayner/leetcode-may2020challenge","commit_stats":{"total_commits":38,"total_committers":1,"mean_commits":38.0,"dds":0.0,"last_synced_commit":"9d0143da9b4268965b79a6a82e788a93f21f152e"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thomasrayner%2Fleetcode-may2020challenge","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thomasrayner%2Fleetcode-may2020challenge/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thomasrayner%2Fleetcode-may2020challenge/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/thomasrayner%2Fleetcode-may2020challenge/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/thomasrayner","download_url":"https://codeload.github.com/thomasrayner/leetcode-may2020challenge/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247452353,"owners_count":20941085,"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":[],"created_at":"2024-10-01T18:26:44.771Z","updated_at":"2025-10-28T20:09:42.307Z","avatar_url":"https://github.com/thomasrayner.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"# May LeetCoding Challenge\n\nFrom [LeetCode](https://leetcode.com/explore/featured/card/may-leetcoding-challenge/)\n\nThe description:\n\n\u003e This Challenge is beginner-friendly and available to both Premium and non-Premium users. It consists of 31 daily problems over the month of May. A problem is added here each day, and you have 24 hours to make a valid submission for it in order to be eligible for rewards.\n\n## Challenges\n\n| Day | Challenge | Notes |\n|-----|-----------|-------|\n| 01 | [First Bad Version](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/534/week-1-may-1st-may-7th/3316/) | Interactive problem that doesn't run locally. Binary search. |\n| 02 | [Jewels and Stones](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/534/week-1-may-1st-may-7th/3317/) | Common chars in strings |\n| 03 | [Ransom Note](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/534/week-1-may-1st-may-7th/3318/) | Compare counts of specific chars between strings |\n| 04 | [Number Complement](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/534/week-1-may-1st-may-7th/3319/) | Bit shifting, bitwise operators. |\n| 05 | [First Unique Character in a String](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/534/week-1-may-1st-may-7th/3320/) | |\n| 06 | [Majority](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/534/week-1-may-1st-may-7th/3321/) | One element occurs more than the rest combined and must be found |\n| 07 | [Cousins in Binary Tree](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/534/week-1-may-1st-may-7th/3322/) | Interactive problem that doesn't run locally. BFS, breadth first search. |\n| 08 | [Check If It Is a Straight Line](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/535/week-2-may-8th-may-14th/3323/) | Given a series of `x,y` coords, see if the slope is the same between all of them |\n| 09 | [Valid Perfect Square](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/535/week-2-may-8th-may-14th/3324/) | Find out if a number is a perfect square without built in libs. Binary search. |\n| 10 | [Find the Town Judge](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/535/week-2-may-8th-may-14th/3325/) | Given a count of townspeople and a list of \"who trusts who\", find the townsperson who trusts nobody and is trusted by all. |\n| 11 | [Flood Fill](https://leetcode.com/explore/featured/card/may-leetcoding-challenge/535/week-2-may-8th-may-14th/3326/) | Recursion |\n| 12 | [Single Element in a Sorted Array](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/535/week-2-may-8th-may-14th/3327/) | Binary search|\n| 13 | [Remove K Digits](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/535/week-2-may-8th-may-14th/3328/) | Make the smallest number possible out of input number by removing k digits. |\n| 14 | [Implement Trie (Prefix Tree)](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/535/week-2-may-8th-may-14th/3329/) | Interactive problem that doesn't run locally. |\n| 15 | [Maximum Sum Circular Array](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/536/week-3-may-15th-may-21st/3330/) | Kadane's algo. |\n| 16 | [Odd Even Linked List](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/536/week-3-may-15th-may-21st/3331/) | Interactive problem that doesn't run locally. Re-ordering a singly linked list with pointers. |\n| 17 | [Find All Anagrams in a String](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/536/week-3-may-15th-may-21st/3332/) | Sliding window. |\n| 18 | [Permutation in String](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/536/week-3-may-15th-may-21st/3333/) | Sliding window again for some reason - same as d17. |\n| 19 | [Online Stock Spanner](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/536/week-3-may-15th-may-21st/3334/) | Interactive problem that doesn't run locally. Stacks. |\n| 20 | [Kth Smallest Element in a BST](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/536/week-3-may-15th-may-21st/3335/) | Interactive problem that doesn't run locally. BST, binary search tree, DFS, depth-first search, recursion, in-order traversal. |\n| 21 | [Count Square Submatrices with All Ones](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/536/week-3-may-15th-may-21st/3336/) | Dynamic programming. |\n| 22 | [Sort Characters By Frequency](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/537/week-4-may-22nd-may-28th/3337/) | Frequency sorting. |\n| 23 | [Interval List Intersections](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/537/week-4-may-22nd-may-28th/3338/https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/537/week-4-may-22nd-may-28th/3338/) | Find intersections of using pointers. |\n| 24 | [Construct Binary Search Tree from Preorder Traversal](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/537/week-4-may-22nd-may-28th/3339/) | BST. |\n| 25 | [UncrossedLines](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/537/week-4-may-22nd-may-28th/3340/) | Dynamic programming. |\n| 26 | [Contiguous Array](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/537/week-4-may-22nd-may-28th/3341/) | Identical to April 2020 day 13 problem. |\n| 27 | [Possible Bipartition](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/537/week-4-may-22nd-may-28th/3342/) | Interactive problem that doesn't run locally. DFS, depth first search. |\n| 28 | [Counting Bits](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/537/week-4-may-22nd-may-28th/3343/) | Binary math, bitwise operators. |\n| 29 | [Course Schedule](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/538/week-5-may-29th-may-31st/3344/) | Interactive problem that doesn't run locally. DFS, depth first search. |\n| 30 | [K Closest Points to Origin](https://leetcode.com/explore/challenge/card/may-leetcoding-challenge/538/week-5-may-29th-may-31st/3345/) | Math. Used Linq instead of coming up with a more efficient algo - in a hurry... still beat 62% 🤷‍♂️. |\n| 31 | [Edit Distance](https://leetcode.com/explore/featured/card/may-leetcoding-challenge/538/week-5-may-29th-may-31st/3346/) | Dynamic programming. |\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthomasrayner%2Fleetcode-may2020challenge","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthomasrayner%2Fleetcode-may2020challenge","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthomasrayner%2Fleetcode-may2020challenge/lists"}