{"id":25898301,"url":"https://github.com/iamabirakash/leetcode","last_synced_at":"2025-03-03T00:18:00.336Z","repository":{"id":247184650,"uuid":"825218621","full_name":"iamabirakash/Leetcode","owner":"iamabirakash","description":"A repository containing best solutions of daily LeetCode problems","archived":false,"fork":false,"pushed_at":"2024-09-07T18:29:53.000Z","size":249,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-09-07T19:23:34.166Z","etag":null,"topics":["daily-coding-problem","leetcode","leetcode-java","leetcode-python","leetcode-solutions"],"latest_commit_sha":null,"homepage":"https://leetcodehub.netlify.app/","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/iamabirakash.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":"2024-07-07T06:38:09.000Z","updated_at":"2024-09-07T18:29:56.000Z","dependencies_parsed_at":"2024-07-29T19:20:29.927Z","dependency_job_id":"0d826dbe-752c-42cd-a54e-c9b5c4801a79","html_url":"https://github.com/iamabirakash/Leetcode","commit_stats":null,"previous_names":["iamabirakash/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iamabirakash%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iamabirakash%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iamabirakash%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iamabirakash%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/iamabirakash","download_url":"https://codeload.github.com/iamabirakash/Leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241587830,"owners_count":19986628,"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":["daily-coding-problem","leetcode","leetcode-java","leetcode-python","leetcode-solutions"],"created_at":"2025-03-03T00:17:59.748Z","updated_at":"2025-03-03T00:18:00.327Z","avatar_url":"https://github.com/iamabirakash.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Leetcode\n\n[iamabirakash](https://leetcode.com/u/iamabirakash/)\n\n* ## Easy\n1. [Intersection of Two Arrays II](https://github.com/iamabirakash/Leetcode/tree/main/Intersection_Two_Arrays)\n2. [Pass the Pillow](https://github.com/iamabirakash/Leetcode/tree/main/Pass%20The%20Pillow)\n3. [Water Bottles](https://github.com/iamabirakash/Leetcode/tree/main/Water_Bottles)\n4. [Crawler Log Folder](https://github.com/iamabirakash/Leetcode/tree/main/Crawler%20Log%20Folder)\n5. [Intersection of Two Linked Lists](https://github.com/iamabirakash/Leetcode/tree/main/Intersection%20of%20Two%20Linked%20Lists)\n6. [Middle of the Linked List](https://github.com/iamabirakash/Leetcode/tree/main/Middle%20of%20the%20Linked%20List)\n7. [Lucky Numbers in a Matrix](https://github.com/iamabirakash/Leetcode/tree/main/Lucky%20Numbers%20in%20a%20Matrix)\n8. [Linked List Cycle](https://github.com/iamabirakash/Leetcode/tree/main/Linked%20List%20Cycle)\n9. [Sort the People](https://github.com/iamabirakash/Leetcode/tree/main/Sort%20the%20People)\n10. [Number of Senior Citizens](https://github.com/iamabirakash/Leetcode/tree/main/Number%20of%20Senior%20Citizens)\n11. [Kth Largest Element in a Stream](https://github.com/iamabirakash/Leetcode/tree/main/Kth%20Largest%20Element%20in%20a%20Stream)\n\n* ## Medium\n1. [Minimum Difference Between Largest and Smallest Value in Three Moves](https://github.com/iamabirakash/Leetcode/tree/main/Minimum_Difference)\n2. [Merge Nodes in Between Zeros](https://github.com/iamabirakash/Leetcode/tree/main/Merged_Notes_Between_Zeros)\n3. [Find the Minimum and Maximum Number of Nodes Between Critical Points](https://github.com/iamabirakash/Leetcode/tree/main/Min_Max_No_Nodes)\n4. [Circular Game](https://github.com/iamabirakash/Leetcode/tree/main/Circular_Game)\n5. [Average Waiting Time](https://github.com/iamabirakash/Leetcode/tree/main/Average%20Waiting%20Time)\n6. [Reverse Substrings Between Each Pair of Parentheses](https://github.com/iamabirakash/Leetcode/tree/main/Reversed%20Substring%20Paranthesis)\n7. [Maximum Score From Removing Substrings](https://github.com/iamabirakash/Leetcode/tree/main/Maximum%20Score)\n8. [Create Binary Tree From Descriptions](https://github.com/iamabirakash/Leetcode/tree/main/Create%20Binary%20Tree)\n9. [Step-By-Step Directions From a Binary Tree Node to Another](https://github.com/iamabirakash/Leetcode/tree/main/Binary%20Tree%20Node%20to%20Another)\n10. [Delete Node in a Linked List](https://github.com/iamabirakash/Leetcode/tree/main/Delete%20Node%20in%20a%20Linked%20List)\n11. [Delete the Middle Node of a Linked List](https://github.com/iamabirakash/Leetcode/tree/main/Delete%20the%20Middle%20Node%20of%20a%20Linked%20List)\n12. [Find Valid Matrix Given Row and Column Sums](https://github.com/iamabirakash/Leetcode/tree/main/Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums)\n13. [Sort an Array](https://github.com/iamabirakash/Leetcode/tree/main/Sort%20an%20Array)\n14. [Find the City With the Smallest Number of Neighbors at a Threshold Distance](https://github.com/iamabirakash/Leetcode/tree/main/Find%20the%20City%20With%20the%20Smallest%20Number%20of%20Neighbors%20at%20a%20Threshold%20Distance)\n15. [Minimum Deletions to Make String Balanced](https://github.com/iamabirakash/Leetcode/tree/main/Minimum%20Deletions%20to%20Make%20String%20Balanced)\n16. [Filling Bookcase Shelves](https://github.com/iamabirakash/Leetcode/tree/main/Filling%20Bookcase%20Shelves)\n17. [Minimum Swaps to Group All 1's Together II](https://github.com/iamabirakash/Leetcode/tree/main/Minimum%20Swaps%20to%20Group%20All%201's%20Together%20II)\n18. [Spiral Matrix III](https://github.com/iamabirakash/Leetcode/tree/main/Spiral%20Matrix%20III)\n19. [Magic Squares In Grid](https://github.com/iamabirakash/Leetcode/tree/main/Magic%20Squares%20In%20Grid)\n\n* ## Hard\n1. [Median of Two Sorted Arrays](https://github.com/iamabirakash/Leetcode/tree/main/Median%20Of%20Two%20Sorted%20Arrays)\n2. [Robot Collisions](https://github.com/iamabirakash/Leetcode/blob/main/Robot%20Collisions/README.md)\n3. [Number Of Atoms](https://github.com/iamabirakash/Leetcode/tree/main/Number%20Of%20Atoms)\n4. [Build a Matrix With Conditions](https://github.com/iamabirakash/Leetcode/tree/main/Build%20a%20Matrix%20With%20Conditions)\n5. [Integer to English Words](https://github.com/iamabirakash/Leetcode/tree/main/Integer%20to%20English%20Words)\n6. [Minimum Number of Days to Disconnect Island\n](https://leetcode.com/problems/minimum-number-of-days-to-disconnect-island/description/?envType=daily-question\u0026envId=2024-08-11)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fiamabirakash%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fiamabirakash%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fiamabirakash%2Fleetcode/lists"}