{"id":22758765,"url":"https://github.com/aymen016/leetcode-problems","last_synced_at":"2025-03-30T08:25:53.652Z","repository":{"id":228012761,"uuid":"772495374","full_name":"Aymen016/LeetCode-Problems","owner":"Aymen016","description":"This repo is designed to enhance your problem-solving skills through daily coding challenges, complete with clear explanations and well-structured solutions. 🎯","archived":false,"fork":false,"pushed_at":"2025-02-02T16:48:44.000Z","size":24,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-02T17:34:23.228Z","etag":null,"topics":["coding","decision-making","leetcode-python","leetcode-solutions","numpy","problem-solving","python"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","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/Aymen016.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-03-15T09:58:05.000Z","updated_at":"2025-02-02T16:50:24.000Z","dependencies_parsed_at":"2025-02-02T17:27:04.027Z","dependency_job_id":"579b7994-9d31-4ce8-bcc1-6df98dad312c","html_url":"https://github.com/Aymen016/LeetCode-Problems","commit_stats":null,"previous_names":["aymen016/leetcode-problems"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aymen016%2FLeetCode-Problems","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aymen016%2FLeetCode-Problems/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aymen016%2FLeetCode-Problems/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Aymen016%2FLeetCode-Problems/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Aymen016","download_url":"https://codeload.github.com/Aymen016/LeetCode-Problems/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246293069,"owners_count":20754176,"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":["coding","decision-making","leetcode-python","leetcode-solutions","numpy","problem-solving","python"],"created_at":"2024-12-11T08:15:43.980Z","updated_at":"2025-03-30T08:25:53.626Z","avatar_url":"https://github.com/Aymen016.png","language":"Jupyter Notebook","readme":"# 🚀 LeetCode-Problems Repository\n\nWelcome to **LeetCode-Problems**, a structured repository dedicated to solving **LeetCode** challenges in Python! 🧠💡\n\nThis repo is designed to enhance your problem-solving skills through **daily coding challenges**, complete with **clear explanations** and **well-structured solutions**. 🎯\n\n---\n\n## 📌 Repository Overview\n\nEach `.ipynb` file corresponds to a specific day's challenges, focusing on different problem types. The problems include **arrays, strings, sorting, searching, dynamic programming, and more!**\n\n---\n\n## 🔢 Daily Challenges Breakdown\n\n| Day | Problems Solved | Difficulty Level |\n|----|---------------|----------------|\n| **Day 1** | Palindrome Numbers, Two Sum Problem, Roman to Integer | 🟢 Easy |\n| **Day 2** | 3Sum | 🔵 Medium |\n| **Day 3** | Merge Strings Alternately, GCD of Strings, Kids With the Greatest Number of Candies | 🟢 Easy |\n| **Day 4** | Flower Planting, Move Zeroes, Reverse Words in a String, Product of Array Elements | 🟡 Medium |\n| **Day 6** | Single Number | 🟢 Easy |\n| **Day 7** | Can Place Flowers | 🟢 Easy |\n| **Day 8** | Reverse Vowels of a String | 🟡 Medium |\n| **Day 9** | Product of Array Except Self | 🔵 Medium |\n| **Day 10** | Find the Highest Altitude | 🟢 Easy |\n\n---\n\n## ✨ Example Solutions\n\n### ✅ Palindrome Numbers *(Easy)*  \n**Check if an integer is a palindrome.**  \n\n```python\ndef isPalindrome(x):\n    new = str(x)\n    return new == new[::-1]\n\nprint(isPalindrome(-121))  # Output: False\n```\n\n### ✅ Two Sum Problem  *(Easy)*  \n**Find two numbers in an array that add up to a given target.**  \n\n```python\ndef twoSum(nums, target):\n    for i in range(len(nums)):\n        for j in range(i + 1, len(nums)):\n            if nums[i] + nums[j] == target:\n                return [i, j]\n\nnums = [1, 2, 3]\ntarget = 3\nprint(twoSum(nums, target))  # Output: [0, 1]\n```\n### Reverse Words in a String *(Medium)*\n**Reverse the order of words in a sentence.**  \n\n```python\ndef reverse_words(string):\n    return ' '.join(string.strip().split()[::-1])\n\ns = \"a good   example\"\nprint(reverse_words(s))  # Output: \"example good a\"\n```\n\n## 🎯 Difficulty Levels\n- 🔹 **🟢 Easy** – Beginner-friendly problems that cover fundamental concepts.  \n- 🔹 **🟡 Medium** – Intermediate problems that require deeper thought and optimization.  \n- 🔹 **🔵 Hard** – Advanced problems that demand strong problem-solving and algorithmic skills.  \n\n---\n\n## 🛠️ How to Use\n\n1️⃣ **Clone the repository:**\n```sh\ngit clone https://github.com/your-username/LeetCode-Problems.git\n```\n\n2️⃣ **Navigate to the project folder:**\n```sh\ncd LeetCode-Problems\n```\n3️⃣ **Open any** `.ipynb` **file in Jupyter Notebook** or use **Python** to run `.py` files.\n\n---\n\n## 🚀 Future Enhancements\n\n- 📚 **More explanations** for problems.  \n- ⚡ **Optimized solutions** for better efficiency.  \n- 🔥 **Additional LeetCode problems** added regularly.  \n- 🎯 **Categorization by topics like DP, Graphs, Sorting, etc.**  \n\n---\n\n## 🤝 Contribute\n\nWant to improve the repository? **Submit a pull request** or **fork the repo** and add new solutions! Contributions are welcome. 🎉\n\n---\n\n## 📜 License\n\nThis project is **open-source** and free to use. Happy coding! 💻🚀\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faymen016%2Fleetcode-problems","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faymen016%2Fleetcode-problems","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faymen016%2Fleetcode-problems/lists"}