{"id":23688023,"url":"https://github.com/s18-niloy/leetcode","last_synced_at":"2026-01-11T12:30:19.474Z","repository":{"id":176638245,"uuid":"658237506","full_name":"S18-Niloy/LEETCODE","owner":"S18-Niloy","description":"This repository contains my solutions to a variety of problems from LeetCode, implemented in multiple programming languages. The goal is to provide clear, optimized, and well-documented solutions that can be used for learning and reference.","archived":false,"fork":false,"pushed_at":"2024-11-23T04:04:09.000Z","size":228,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-12-29T23:59:27.907Z","etag":null,"topics":["arrays","backtracking","dsa-practice","dyanamic-programming","graphs","leetcode-solutions","linked-list","math","python","queue","searching","sorting","sorting-algorithms","stacks","trees"],"latest_commit_sha":null,"homepage":"https://github.com/S18-Niloy/LEETCODE","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/S18-Niloy.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":"2023-06-25T07:21:18.000Z","updated_at":"2024-12-20T09:04:58.000Z","dependencies_parsed_at":null,"dependency_job_id":"ee03e17e-43ff-44e8-84ea-d10a60447444","html_url":"https://github.com/S18-Niloy/LEETCODE","commit_stats":null,"previous_names":["s18-niloy/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/S18-Niloy%2FLEETCODE","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/S18-Niloy%2FLEETCODE/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/S18-Niloy%2FLEETCODE/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/S18-Niloy%2FLEETCODE/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/S18-Niloy","download_url":"https://codeload.github.com/S18-Niloy/LEETCODE/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239748248,"owners_count":19690232,"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":["arrays","backtracking","dsa-practice","dyanamic-programming","graphs","leetcode-solutions","linked-list","math","python","queue","searching","sorting","sorting-algorithms","stacks","trees"],"created_at":"2024-12-29T23:59:39.006Z","updated_at":"2026-01-11T12:30:19.395Z","avatar_url":"https://github.com/S18-Niloy.png","language":"Python","readme":"# LEETCODE Solutions\n\nThis repository contains my solutions to a variety of problems from [LeetCode](https://leetcode.com/), implemented in multiple programming languages. The goal is to provide clear, optimized, and well-documented solutions that can be used for learning and reference.\n\n---\n\n## 🌟 Features\n\n- Comprehensive solutions to LeetCode problems across a wide range of categories.\n- Implementations in **Python** and **Java** for better flexibility and learning.\n- Easy-to-read and maintainable code, structured for educational purposes.\n\n---\n\n## 🗂️ Repository Structure\n\nThe repository is organized as follows:\n\n📁 LEETCODE/ ├── 📄 Problem_Name_Language.extension ├── 📄 Add_Two_Numbers.java ├── 📄 Reverse_Linked_List.py ├── 📄 Binary_Tree_Traversal.java └── (other problem files)\n\n\nEach file is named after the problem it solves and the programming language used for implementation.\n\n---\n\n## 🧠 Topics Covered\n\n- **Arrays**\n- **Linked Lists**\n- **Stacks**\n- **Queues**\n- **Trees**\n- **Graphs**\n- **Dynamic Programming**\n- **Backtracking**\n- **Recursion**\n- **Sorting \u0026 Searching**\n- **Math Problems**\n- **String Manipulation**\n\n---\n\n## 📚 Usage\n\n1. Clone this repository to your local machine:\n\n   ```bash\n   git clone https://github.com/S18-Niloy/LEETCODE.git\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fs18-niloy%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fs18-niloy%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fs18-niloy%2Fleetcode/lists"}