{"id":25019967,"url":"https://github.com/sunchit17/may-leetcode-31daychallenge","last_synced_at":"2025-03-30T10:12:21.790Z","repository":{"id":112023489,"uuid":"260736182","full_name":"sunchit17/May-LeetCode-31DayChallenge","owner":"sunchit17","description":"May LeetCode Challenge","archived":false,"fork":false,"pushed_at":"2020-06-01T01:38:40.000Z","size":89,"stargazers_count":0,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-05T11:52:38.729Z","etag":null,"topics":["algorithms","data-structures","leetcode-challenge","leetcode-java","mayleetcodechallenge"],"latest_commit_sha":null,"homepage":"","language":"Java","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/sunchit17.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-02T17:12:05.000Z","updated_at":"2020-06-01T01:44:04.000Z","dependencies_parsed_at":"2023-07-31T08:01:25.865Z","dependency_job_id":null,"html_url":"https://github.com/sunchit17/May-LeetCode-31DayChallenge","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/sunchit17%2FMay-LeetCode-31DayChallenge","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sunchit17%2FMay-LeetCode-31DayChallenge/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sunchit17%2FMay-LeetCode-31DayChallenge/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sunchit17%2FMay-LeetCode-31DayChallenge/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sunchit17","download_url":"https://codeload.github.com/sunchit17/May-LeetCode-31DayChallenge/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246301996,"owners_count":20755514,"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","data-structures","leetcode-challenge","leetcode-java","mayleetcodechallenge"],"created_at":"2025-02-05T11:51:58.133Z","updated_at":"2025-03-30T10:12:21.785Z","avatar_url":"https://github.com/sunchit17.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# May-LeetCode-31DayChallenge\n\n### Repository to house the solutions of the 31 day [May LeetCode Challenge](https://leetcode.com/explore/featured/card/may-leetcoding-challenge/)\n\n***\n\u003e Week 1\n\n- Day 1 (First Bad Version)\n\n- Day 2 (Jewels and Stones)\n\n- Day 3 (Ransom Note) \n\n- Day 4 (Complement of a Number)\n\n- Day 5 (First Unique Character of a String)\n\n- Day 6 (Majority Element of an Array)\n\n- Day 7 (Cousins in a Binary Tree)\n\n***\n\u003e Week 2\n\n- Day 8 (Check for a Straight Line)\n\n- Day 9 (Perfect Square Checker without sqrt)\n\n- Day 10 (Find the Town Judge)\n\n- Day 11 (Flood Fill)\n\n- Day 12 (Single element in a sorted array)\n\n- Day 13 (Remove K digits)\n\n- Day 14 (Implement Trie)\n\n***\n\u003e Week 3\n\n- Day 15 (Maximum Sum Circular Sub Array)\n\n- Day 16 (Odd Even Linked List)\n\n- Day 17 (Find all Anagrams in a String)\n\n- Day 18 (Permutation in String)\n\n- Day 19 (Online Stock Span)\n\n- Day 20 (Kth Smallest Element in Binary Search Tree)\n\n- Day 21 (Count Square Submatrices with All Ones)\n\n***\n\u003e Week 4\n\n- Day 22 (Sort Characters by Frequency)\n\n- Day 23 (Interval List Intersections)\n\n- Day 24 (Construct BST from Preorder Traversal)\n\n- Day 25 (Uncrossed Lines)\n\n- Day 26 (Contiguous Array)\n\n- Day 27 (Possible Bipartition)\n\n- Day 28 (Counting Bits)\n\n***\n\u003e Week 5\n\n- Day 29 (Course Schedule)\n\n- Day 30 (K Closest Points to Origin)\n\n- Day 31 (Edit Distance)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsunchit17%2Fmay-leetcode-31daychallenge","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsunchit17%2Fmay-leetcode-31daychallenge","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsunchit17%2Fmay-leetcode-31daychallenge/lists"}