{"id":27139481,"url":"https://github.com/shreyansh-21/leetcode","last_synced_at":"2025-06-30T11:39:14.679Z","repository":{"id":282669715,"uuid":"949302970","full_name":"shreyansh-21/LeetCode","owner":"shreyansh-21","description":"This repository contains my solutions to LeetCode problems, covering a wide range of algorithms and data structures. Each solution is well-documented and optimized for performance. The goal is to demonstrate problem-solving skills, coding efficiency, and a deep understanding of algorithmic concepts.","archived":false,"fork":false,"pushed_at":"2025-03-30T13:16:54.000Z","size":39,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-03-30T14:23:54.252Z","etag":null,"topics":["array","binary-search","binary-search-tree","hashing","hashmaps","linked-list","priority-queue","queue","recursion","stack","string","trees"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/Shreyansh_Dubey21","language":"Python","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/shreyansh-21.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":"2025-03-16T06:12:20.000Z","updated_at":"2025-03-30T13:16:57.000Z","dependencies_parsed_at":"2025-03-30T14:32:53.661Z","dependency_job_id":null,"html_url":"https://github.com/shreyansh-21/LeetCode","commit_stats":null,"previous_names":["shreyansh-21/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shreyansh-21%2FLeetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shreyansh-21%2FLeetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shreyansh-21%2FLeetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/shreyansh-21%2FLeetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/shreyansh-21","download_url":"https://codeload.github.com/shreyansh-21/LeetCode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247779701,"owners_count":20994573,"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":["array","binary-search","binary-search-tree","hashing","hashmaps","linked-list","priority-queue","queue","recursion","stack","string","trees"],"created_at":"2025-04-08T04:58:15.372Z","updated_at":"2025-06-30T11:39:14.669Z","avatar_url":"https://github.com/shreyansh-21.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1\u003eLeetCode Solutions Sync \u003c/h1\u003e\n\n\u003ctable\u003e\n  \u003ctr\u003e\n    \u003ctd\u003e\n      \u003cp\u003e\n        This repository serves as a centralized archive for my \u003cstrong\u003eLeetCode\u003c/strong\u003e problem solutions, \n        automatically synchronized to maintain an up-to-date record of my progress.\n      \u003c/p\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n      \u003cimg src=\"https://media.giphy.com/media/v1.Y2lkPTc5MGI3NjExeXQyNmMyajJxdGQzdTlndjlvMnpwcXo4NWkyaDQ5bnNwYjZhdXh0ZyZlcD12MV9naWZzX3NlYXJjaCZjdD1n/JIX9t2j0ZTN9S/giphy.gif\" \n           height=\"150\" width=\"180\" alt=\"logo\" /\u003e\n    \u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/table\u003e\n\n\u003ch2\u003eOverview\u003c/h2\u003e\n\u003cp\u003eThis repository is designed to:\u003c/p\u003e\n\u003cul\u003e\n    \u003cli\u003eMaintain a structured collection of my \u003cstrong\u003eLeetCode\u003c/strong\u003e solutions.\u003c/li\u003e\n    \u003cli\u003eTrack progress and improvements over time.\u003c/li\u003e\n    \u003cli\u003eServe as a reference for revisiting past problems.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch2\u003eRepository Structure\u003c/h2\u003e\n\u003cp\u003eSolutions are organized based on the following criteria:\u003c/p\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003eProblem Name\u003c/strong\u003e 📌\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eDifficulty Level\u003c/strong\u003e (Easy / Medium / Hard) 🎯\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eAlgorithmic Concepts \u0026 Data Structures\u003c/strong\u003e (DP, Graphs, Greedy, etc.) 🧩\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eProgramming Language\u003c/strong\u003e (Primarily Python, Javascript) 💻\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch2\u003eAutomated Syncing\u003c/h2\u003e\n\u003cp\u003eThis repository is automatically updated to ensure that all my latest LeetCode submissions are efficiently stored and remain up to date.\u003c/p\u003e\n\n\u003ch2\u003eObjectives\u003c/h2\u003e\n\u003cul\u003e\n    \u003cli\u003e\u003cstrong\u003ePerformance Tracking\u003c/strong\u003e – Monitor problem-solving progress over time.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eEfficient Reference\u003c/strong\u003e – Quickly revisit previously solved problems.\u003c/li\u003e\n    \u003cli\u003e\u003cstrong\u003eKnowledge Sharing\u003c/strong\u003e – Provide insights for others working on similar challenges.\u003c/li\u003e\n\u003c/ul\u003e\n\n\u003ch2\u003eHow to use \u003c/h2\u003e\n\u003cp\u003eTo find a specific solution:\u003c/p\u003e\n\u003col\u003e\n    \u003cli\u003eNavigate through the repository folders.\u003c/li\u003e\n    \u003cli\u003eUse the \u003cstrong\u003esearch🔍\u003c/strong\u003e function to locate a problem by name or topic.\u003c/li\u003e\n    \u003cli\u003eReview the solution and underlying logic.\u003c/li\u003e\n\u003c/ol\u003e\n\n\u003chr\u003e\n\n\u003cp\u003eIf you find this repository helpful, consider \u003cstrong\u003estarring ⭐\u003c/strong\u003e it!\u003c/p\u003e\n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Array\n|  |\n| ------- |\n| [0031-next-permutation](https://github.com/shreyansh-21/LeetCode/tree/master/0031-next-permutation) |\n| [0136-single-number](https://github.com/shreyansh-21/LeetCode/tree/master/0136-single-number) |\n| [0217-contains-duplicate](https://github.com/shreyansh-21/LeetCode/tree/master/0217-contains-duplicate) |\n| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |\n| [0540-single-element-in-a-sorted-array](https://github.com/shreyansh-21/LeetCode/tree/master/0540-single-element-in-a-sorted-array) |\n| [0890-lemonade-change](https://github.com/shreyansh-21/LeetCode/tree/master/0890-lemonade-change) |\n| [1018-largest-perimeter-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/1018-largest-perimeter-triangle) |\n| [1584-average-salary-excluding-the-minimum-and-maximum-salary](https://github.com/shreyansh-21/LeetCode/tree/master/1584-average-salary-excluding-the-minimum-and-maximum-salary) |\n| [2048-build-array-from-permutation](https://github.com/shreyansh-21/LeetCode/tree/master/2048-build-array-from-permutation) |\n| [3321-type-of-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/3321-type-of-triangle) |\n| [3747-maximum-difference-between-adjacent-elements-in-a-circular-array](https://github.com/shreyansh-21/LeetCode/tree/master/3747-maximum-difference-between-adjacent-elements-in-a-circular-array) |\n## Math\n|  |\n| ------- |\n| [0012-integer-to-roman](https://github.com/shreyansh-21/LeetCode/tree/master/0012-integer-to-roman) |\n| [1018-largest-perimeter-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/1018-largest-perimeter-triangle) |\n| [1119-robot-bounded-in-circle](https://github.com/shreyansh-21/LeetCode/tree/master/1119-robot-bounded-in-circle) |\n| [1630-count-odd-numbers-in-an-interval-range](https://github.com/shreyansh-21/LeetCode/tree/master/1630-count-odd-numbers-in-an-interval-range) |\n| [3321-type-of-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/3321-type-of-triangle) |\n## Sorting\n|  |\n| ------- |\n| [0217-contains-duplicate](https://github.com/shreyansh-21/LeetCode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/shreyansh-21/LeetCode/tree/master/0242-valid-anagram) |\n| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |\n| [1018-largest-perimeter-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/1018-largest-perimeter-triangle) |\n| [1584-average-salary-excluding-the-minimum-and-maximum-salary](https://github.com/shreyansh-21/LeetCode/tree/master/1584-average-salary-excluding-the-minimum-and-maximum-salary) |\n| [3321-type-of-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/3321-type-of-triangle) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0136-single-number](https://github.com/shreyansh-21/LeetCode/tree/master/0136-single-number) |\n## Simulation\n|  |\n| ------- |\n| [0657-robot-return-to-origin](https://github.com/shreyansh-21/LeetCode/tree/master/0657-robot-return-to-origin) |\n| [1119-robot-bounded-in-circle](https://github.com/shreyansh-21/LeetCode/tree/master/1119-robot-bounded-in-circle) |\n| [2048-build-array-from-permutation](https://github.com/shreyansh-21/LeetCode/tree/master/2048-build-array-from-permutation) |\n## Hash Table\n|  |\n| ------- |\n| [0012-integer-to-roman](https://github.com/shreyansh-21/LeetCode/tree/master/0012-integer-to-roman) |\n| [0217-contains-duplicate](https://github.com/shreyansh-21/LeetCode/tree/master/0217-contains-duplicate) |\n| [0242-valid-anagram](https://github.com/shreyansh-21/LeetCode/tree/master/0242-valid-anagram) |\n| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## String\n|  |\n| ------- |\n| [0006-zigzag-conversion](https://github.com/shreyansh-21/LeetCode/tree/master/0006-zigzag-conversion) |\n| [0012-integer-to-roman](https://github.com/shreyansh-21/LeetCode/tree/master/0012-integer-to-roman) |\n| [0242-valid-anagram](https://github.com/shreyansh-21/LeetCode/tree/master/0242-valid-anagram) |\n| [0657-robot-return-to-origin](https://github.com/shreyansh-21/LeetCode/tree/master/0657-robot-return-to-origin) |\n| [1119-robot-bounded-in-circle](https://github.com/shreyansh-21/LeetCode/tree/master/1119-robot-bounded-in-circle) |\n## Binary Search\n|  |\n| ------- |\n| [0540-single-element-in-a-sorted-array](https://github.com/shreyansh-21/LeetCode/tree/master/0540-single-element-in-a-sorted-array) |\n## Greedy\n|  |\n| ------- |\n| [0890-lemonade-change](https://github.com/shreyansh-21/LeetCode/tree/master/0890-lemonade-change) |\n| [1018-largest-perimeter-triangle](https://github.com/shreyansh-21/LeetCode/tree/master/1018-largest-perimeter-triangle) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Heap (Priority Queue)\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Bucket Sort\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Counting\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Quickselect\n|  |\n| ------- |\n| [0347-top-k-frequent-elements](https://github.com/shreyansh-21/LeetCode/tree/master/0347-top-k-frequent-elements) |\n## Two Pointers\n|  |\n| ------- |\n| [0031-next-permutation](https://github.com/shreyansh-21/LeetCode/tree/master/0031-next-permutation) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshreyansh-21%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fshreyansh-21%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fshreyansh-21%2Fleetcode/lists"}