{"id":31131854,"url":"https://github.com/ianfelps/leetcode","last_synced_at":"2025-09-18T04:41:02.451Z","repository":{"id":294349749,"uuid":"986679646","full_name":"ianfelps/leetcode","owner":"ianfelps","description":"Repositório com soluções comentadas de problemas de LeetCode. Inclui explicações, abordagens utilizadas e reflexões sobre cada questão resolvida.","archived":false,"fork":false,"pushed_at":"2025-06-05T00:43:48.000Z","size":118,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-05T04:55:43.327Z","etag":null,"topics":["data-structures","leetcode","python","study"],"latest_commit_sha":null,"homepage":"https://leetcode.com/u/ianfelps/","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/ianfelps.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,"zenodo":null}},"created_at":"2025-05-20T01:17:32.000Z","updated_at":"2025-06-05T00:43:50.000Z","dependencies_parsed_at":"2025-05-20T02:50:28.989Z","dependency_job_id":null,"html_url":"https://github.com/ianfelps/leetcode","commit_stats":null,"previous_names":["ianfelps/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/ianfelps/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ianfelps%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ianfelps%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ianfelps%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ianfelps%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ianfelps","download_url":"https://codeload.github.com/ianfelps/leetcode/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ianfelps%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":275711242,"owners_count":25514200,"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","status":"online","status_checked_at":"2025-09-18T02:00:09.552Z","response_time":77,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["data-structures","leetcode","python","study"],"created_at":"2025-09-18T04:40:57.527Z","updated_at":"2025-09-18T04:41:02.444Z","avatar_url":"https://github.com/ianfelps.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Soluções LeetCode 💻\n\nEste repositório contém minhas soluções para problemas da plataforma [LeetCode](https://leetcode.com/), com comentários explicativos e observações pessoais sobre cada exercício. O objetivo é reforçar meu aprendizado e compartilhar conhecimento com outros devs que também estão praticando algoritmos e estruturas de dados.\n\n---\n\n## 📁 Organização\n\nAs soluções estão organizadas por nível de dificuldade:\n\n```\neasy/\n├── 0001 - problem-x/\n│   ├── solution.py\n│   └── description.md\n└── ...\nmedium/\n├── 0020 - problem-y/\n│   ├── solution.py\n│   └── description.md\n└── ...\nhard/\n├── 0300 - problem-z/\n│   ├── solution.py\n│   └── description.md\n└── ...\n\n```\n\nCada problema contém:\n- Um arquivo com a solução implementada\n- Um arquivo de descrição com:\n  - A descrição resumida do problema\n  - Comentários explicando a lógica\n  - Reflexões pessoais\n\n---\n\n## 📌 Objetivos\n\n- Praticar resolução de problemas de programação\n- Consolidar conceitos de estruturas de dados e algoritmos\n- Documentar e compartilhar minha evolução na plataforma\n\n---\n\n## ⭐ Favoritos\n\n- [0019. Remove Nth Node From End of List](./medium/0019%20-%20remove-nth-node-from-end-of-list/description.md)\n- [0001. Two Sum](./easy/0001%20-%20two-sum/description.md)\n- [1367. Linked List in Binary Tree](./medium/1367%20-%20linked-list-in-binary-tree/description.md)\n---\n\n## 🧠 Progresso\n\n[leetcode/u/ianfelps](https://leetcode.com/u/ianfelps/)\n\n![LeetCode Stats](https://leetcard.jacoblin.cool/ianfelps?theme=dark\u0026font=IBM%20Plex%20Sans%20Arabic\u0026ext=heatmap)\n\n---\n\n### Let's code! 💪\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fianfelps%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fianfelps%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fianfelps%2Fleetcode/lists"}