{"id":19350583,"url":"https://github.com/francesco-s/leetcodes","last_synced_at":"2026-06-22T09:31:43.914Z","repository":{"id":243893100,"uuid":"811871312","full_name":"francesco-s/leetcodes","owner":"francesco-s","description":"LeetCode problems solved in Python. Each solution is well-tested and easy to execute (WIP).","archived":false,"fork":false,"pushed_at":"2025-12-20T20:02:06.000Z","size":406,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-22T10:34:31.011Z","etag":null,"topics":["competitive-programming","data-structures","problem-solving"],"latest_commit_sha":null,"homepage":"","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/francesco-s.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,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2024-06-07T13:26:06.000Z","updated_at":"2025-12-20T17:26:05.000Z","dependencies_parsed_at":"2024-07-07T11:29:45.221Z","dependency_job_id":"25032d4b-e614-4603-8b2f-a6d5bee5f8f1","html_url":"https://github.com/francesco-s/leetcodes","commit_stats":null,"previous_names":["francesco-s/leetcodes"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/francesco-s/leetcodes","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/francesco-s%2Fleetcodes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/francesco-s%2Fleetcodes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/francesco-s%2Fleetcodes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/francesco-s%2Fleetcodes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/francesco-s","download_url":"https://codeload.github.com/francesco-s/leetcodes/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/francesco-s%2Fleetcodes/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34643546,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-22T02:00:06.391Z","response_time":106,"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":["competitive-programming","data-structures","problem-solving"],"created_at":"2024-11-10T04:33:05.002Z","updated_at":"2026-06-22T09:31:43.909Z","avatar_url":"https://github.com/francesco-s.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LeetCode Practice Repository\n\nA comprehensive collection of LeetCode solutions organized by data structures and algorithms topics for systematic coding interview preparation.\n\n## Repository Structure\n\n### DSA (Data Structures \u0026 Algorithms)\n\nThe core of this repository contains solutions organized by fundamental CS concepts:\n\n- **ArrayStrings** - Array manipulation and string processing problems\n- **Backtracking** - Recursive exploration and constraint satisfaction problems\n- **BinarySearch** - Efficient searching algorithms and variants\n- **Greedy** - Optimization problems using greedy approach\n- **hashing** - Hash table/map based solutions\n- **Heaps** - Priority queue and heap-based problems\n- **LinkedList** - Singly/doubly linked list operations\n- **StacksQueues** - LIFO/FIFO data structure problems\n- **TreeGraph** - Binary trees, BSTs, and graph algorithms\n\n### Notebook\n\nInteractive Jupyter notebooks for analysis and learning:\n\n- `GenericQuestions.ipynb` - Common coding patterns and templates\n- `LeetCode_path_weekly_topics.ipynb` - Weekly study plan and progress tracking\n\n### Notes\n\nStudy materials and references:\n\n- `which_DS.md` - Guide for choosing the right data structure for problems\n\n## Getting Started\n\n1. **Clone the repository:**\n\n   ```bash\n   git clone https://github.com/francesco-s/leetcodes.git\n   cd leetcodes\n   ```\n\n2. **Navigate to specific topics:**\n\n   ```bash\n   cd DSA/ArrayStrings  # Example: work on array problems\n   ```\n\n3. **Use notebooks for interactive study:**\n   ```bash\n   jupyter notebook notebook/GenericQuestions.ipynb\n   ```\n\n## Study Approach\n\n### Recommended Study Path\n\n1. Start with **ArrayStrings** and **hashing** for fundamentals\n2. Progress to **LinkedList** and **StacksQueues** for basic data structures\n3. Advance to **BinarySearch** and **Greedy** for algorithmic thinking\n4. Tackle **TreeGraph** and **Heaps** for complex data structures\n5. Master **Backtracking** for advanced problem-solving\n\n### Weekly Practice Plan\n\n- Use `LeetCode_path_weekly_topics.ipynb` to track your progress\n- Aim for 3-5 problems per topic before moving on\n- Review `which_DS.md` when choosing approaches for new problems\n\n## Usage Tips\n\n- **File Naming Convention**: Use descriptive names like `1.TwoSum.py`\n- **Comments**: Include time/space complexity analysis in solution comments\n- **Multiple Solutions**: Keep different approaches in the same file with clear separators\n- **Test Cases**: Add example inputs/outputs for quick verification\n\n## Contributing\n\nFeel free to:\n\n- Add new solutions and optimizations\n- Improve existing code with better approaches\n- Update documentation and study notes\n- Share insights in the notebooks\n\n## Resources\n\n- [LeetCode](https://leetcode.com/) - Practice platform\n- [NeetCode](https://neetcode.io/) - Curated problem lists\n- [GeeksforGeeks](https://www.geeksforgeeks.org/) - Algorithm explanations\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffrancesco-s%2Fleetcodes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffrancesco-s%2Fleetcodes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffrancesco-s%2Fleetcodes/lists"}