{"id":24154942,"url":"https://github.com/anishsingh90/leetcode","last_synced_at":"2025-08-25T02:11:41.182Z","repository":{"id":271291647,"uuid":"912979897","full_name":"anishsingh90/Leetcode","owner":"anishsingh90","description":"📘 LeetCode Solutions  🚀 A collection of my solutions to LeetCode problems, organized by topics like Arrays, Strings, Dynamic Programming, and more.   💡 Focused on efficient, clean, and well-documented code for learning and interview preparation.   🔧 Languages: C++ ⚙️","archived":false,"fork":false,"pushed_at":"2025-02-25T06:59:27.000Z","size":84,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-25T07:42:03.019Z","etag":null,"topics":["array","binary-search-tree","dynamic-programming","graph","linkedlist","queue","stack","tree"],"latest_commit_sha":null,"homepage":"","language":"C++","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/anishsingh90.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-01-06T19:34:36.000Z","updated_at":"2025-02-25T06:59:30.000Z","dependencies_parsed_at":"2025-02-18T05:31:46.133Z","dependency_job_id":null,"html_url":"https://github.com/anishsingh90/Leetcode","commit_stats":null,"previous_names":["anishsingh90/leetcode"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishsingh90%2FLeetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishsingh90%2FLeetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishsingh90%2FLeetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/anishsingh90%2FLeetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/anishsingh90","download_url":"https://codeload.github.com/anishsingh90/Leetcode/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241435161,"owners_count":19962407,"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-tree","dynamic-programming","graph","linkedlist","queue","stack","tree"],"created_at":"2025-01-12T12:39:22.506Z","updated_at":"2025-08-25T02:11:41.163Z","avatar_url":"https://github.com/anishsingh90.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"📘 LeetCode Solutions Repository\n\nWelcome to my **LeetCode Solutions Repository**! 🚀 Dive into my journey of solving challenging problems on **LeetCode** 🧠. This repository serves as my personal archive of solutions, strategies, and learning in competitive programming and coding interviews. 🎯  \n\n📌 Highlights  \n- **💡 Problem-Solving:** Organized solutions to diverse LeetCode problems, covering various topics like arrays, strings, dynamic programming, and more.  \n- **📂 Structured:** Each solution is categorized by problem type and includes clean, commented code for better understanding.  \n- **🚀 Optimization:** Focused on writing efficient and scalable solutions with analysis of time and space complexities.  \n- **🔍 Learning:** Ideal for developers preparing for interviews or improving problem-solving skills.  \n\n🛠️ Languages Used    \n- ⚙️ C++  \n- 💻 JavaScript  \n\n🚧 Repository Structure  \n```\n📂 Leetcode  \n├── 📝 Readme.md  \n├── 📁 Array  \n├── 📁 String  \n├── 📁 DynamicProgramming  \n├── 📁 Tree  \n└── 📁 Others  \n```  \n\n🤝 Contributions  \nContributions, feedback, or discussions are always welcome! 🌟 Feel free to open an issue or a pull request to enhance this repository.  \n\n🔗 Connect  \n- 🌐 LinkedIn: https://www.linkedin.com/in/anish90   \n- 📧 Email: anishraaz90@gmail.com \n\nHappy Coding! 💻✨  \n\n\u003c!---LeetCode Topics Start--\u003e\n# LeetCode Topics\n## Math\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/anishsingh90/Leetcode/tree/master/0002-add-two-numbers) |\n| [0007-reverse-integer](https://github.com/anishsingh90/Leetcode/tree/master/0007-reverse-integer) |\n| [0009-palindrome-number](https://github.com/anishsingh90/Leetcode/tree/master/0009-palindrome-number) |\n| [0012-integer-to-roman](https://github.com/anishsingh90/Leetcode/tree/master/0012-integer-to-roman) |\n| [0062-unique-paths](https://github.com/anishsingh90/Leetcode/tree/master/0062-unique-paths) |\n| [0070-climbing-stairs](https://github.com/anishsingh90/Leetcode/tree/master/0070-climbing-stairs) |\n| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |\n## Array\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/anishsingh90/Leetcode/tree/master/0001-two-sum) |\n| [0011-container-with-most-water](https://github.com/anishsingh90/Leetcode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/anishsingh90/Leetcode/tree/master/0015-3sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/anishsingh90/Leetcode/tree/master/0027-remove-element) |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/anishsingh90/Leetcode/tree/master/0035-search-insert-position) |\n| [0075-sort-colors](https://github.com/anishsingh90/Leetcode/tree/master/0075-sort-colors) |\n| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/anishsingh90/Leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |\n| [0088-merge-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0088-merge-sorted-array) |\n| [0135-candy](https://github.com/anishsingh90/Leetcode/tree/master/0135-candy) |\n| [0162-find-peak-element](https://github.com/anishsingh90/Leetcode/tree/master/0162-find-peak-element) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anishsingh90/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0169-majority-element](https://github.com/anishsingh90/Leetcode/tree/master/0169-majority-element) |\n| [0240-search-a-2d-matrix-ii](https://github.com/anishsingh90/Leetcode/tree/master/0240-search-a-2d-matrix-ii) |\n| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |\n| [0882-peak-index-in-a-mountain-array](https://github.com/anishsingh90/Leetcode/tree/master/0882-peak-index-in-a-mountain-array) |\n## Two Pointers\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/anishsingh90/Leetcode/tree/master/0005-longest-palindromic-substring) |\n| [0011-container-with-most-water](https://github.com/anishsingh90/Leetcode/tree/master/0011-container-with-most-water) |\n| [0015-3sum](https://github.com/anishsingh90/Leetcode/tree/master/0015-3sum) |\n| [0026-remove-duplicates-from-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |\n| [0027-remove-element](https://github.com/anishsingh90/Leetcode/tree/master/0027-remove-element) |\n| [0075-sort-colors](https://github.com/anishsingh90/Leetcode/tree/master/0075-sort-colors) |\n| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/anishsingh90/Leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |\n| [0088-merge-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0088-merge-sorted-array) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anishsingh90/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0908-middle-of-the-linked-list](https://github.com/anishsingh90/Leetcode/tree/master/0908-middle-of-the-linked-list) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/anishsingh90/Leetcode/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n## Greedy\n|  |\n| ------- |\n| [0011-container-with-most-water](https://github.com/anishsingh90/Leetcode/tree/master/0011-container-with-most-water) |\n| [0044-wildcard-matching](https://github.com/anishsingh90/Leetcode/tree/master/0044-wildcard-matching) |\n| [0135-candy](https://github.com/anishsingh90/Leetcode/tree/master/0135-candy) |\n## String\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/anishsingh90/Leetcode/tree/master/0005-longest-palindromic-substring) |\n| [0010-regular-expression-matching](https://github.com/anishsingh90/Leetcode/tree/master/0010-regular-expression-matching) |\n| [0012-integer-to-roman](https://github.com/anishsingh90/Leetcode/tree/master/0012-integer-to-roman) |\n| [0020-valid-parentheses](https://github.com/anishsingh90/Leetcode/tree/master/0020-valid-parentheses) |\n| [0044-wildcard-matching](https://github.com/anishsingh90/Leetcode/tree/master/0044-wildcard-matching) |\n| [3447-clear-digits](https://github.com/anishsingh90/Leetcode/tree/master/3447-clear-digits) |\n## Dynamic Programming\n|  |\n| ------- |\n| [0005-longest-palindromic-substring](https://github.com/anishsingh90/Leetcode/tree/master/0005-longest-palindromic-substring) |\n| [0010-regular-expression-matching](https://github.com/anishsingh90/Leetcode/tree/master/0010-regular-expression-matching) |\n| [0044-wildcard-matching](https://github.com/anishsingh90/Leetcode/tree/master/0044-wildcard-matching) |\n| [0062-unique-paths](https://github.com/anishsingh90/Leetcode/tree/master/0062-unique-paths) |\n| [0070-climbing-stairs](https://github.com/anishsingh90/Leetcode/tree/master/0070-climbing-stairs) |\n## Recursion\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/anishsingh90/Leetcode/tree/master/0002-add-two-numbers) |\n| [0010-regular-expression-matching](https://github.com/anishsingh90/Leetcode/tree/master/0010-regular-expression-matching) |\n| [0044-wildcard-matching](https://github.com/anishsingh90/Leetcode/tree/master/0044-wildcard-matching) |\n## Hash Table\n|  |\n| ------- |\n| [0001-two-sum](https://github.com/anishsingh90/Leetcode/tree/master/0001-two-sum) |\n| [0012-integer-to-roman](https://github.com/anishsingh90/Leetcode/tree/master/0012-integer-to-roman) |\n| [0169-majority-element](https://github.com/anishsingh90/Leetcode/tree/master/0169-majority-element) |\n| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |\n## Linked List\n|  |\n| ------- |\n| [0002-add-two-numbers](https://github.com/anishsingh90/Leetcode/tree/master/0002-add-two-numbers) |\n| [0908-middle-of-the-linked-list](https://github.com/anishsingh90/Leetcode/tree/master/0908-middle-of-the-linked-list) |\n| [2216-delete-the-middle-node-of-a-linked-list](https://github.com/anishsingh90/Leetcode/tree/master/2216-delete-the-middle-node-of-a-linked-list) |\n| [2299-merge-nodes-in-between-zeros](https://github.com/anishsingh90/Leetcode/tree/master/2299-merge-nodes-in-between-zeros) |\n## Sorting\n|  |\n| ------- |\n| [0015-3sum](https://github.com/anishsingh90/Leetcode/tree/master/0015-3sum) |\n| [0075-sort-colors](https://github.com/anishsingh90/Leetcode/tree/master/0075-sort-colors) |\n| [0088-merge-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0088-merge-sorted-array) |\n| [0169-majority-element](https://github.com/anishsingh90/Leetcode/tree/master/0169-majority-element) |\n| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |\n## Depth-First Search\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/anishsingh90/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0144-binary-tree-preorder-traversal](https://github.com/anishsingh90/Leetcode/tree/master/0144-binary-tree-preorder-traversal) |\n| [0210-course-schedule-ii](https://github.com/anishsingh90/Leetcode/tree/master/0210-course-schedule-ii) |\n## Breadth-First Search\n|  |\n| ------- |\n| [0210-course-schedule-ii](https://github.com/anishsingh90/Leetcode/tree/master/0210-course-schedule-ii) |\n## Graph\n|  |\n| ------- |\n| [0210-course-schedule-ii](https://github.com/anishsingh90/Leetcode/tree/master/0210-course-schedule-ii) |\n## Topological Sort\n|  |\n| ------- |\n| [0210-course-schedule-ii](https://github.com/anishsingh90/Leetcode/tree/master/0210-course-schedule-ii) |\n## Stack\n|  |\n| ------- |\n| [0020-valid-parentheses](https://github.com/anishsingh90/Leetcode/tree/master/0020-valid-parentheses) |\n| [0094-binary-tree-inorder-traversal](https://github.com/anishsingh90/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0144-binary-tree-preorder-traversal](https://github.com/anishsingh90/Leetcode/tree/master/0144-binary-tree-preorder-traversal) |\n| [3447-clear-digits](https://github.com/anishsingh90/Leetcode/tree/master/3447-clear-digits) |\n## Simulation\n|  |\n| ------- |\n| [2299-merge-nodes-in-between-zeros](https://github.com/anishsingh90/Leetcode/tree/master/2299-merge-nodes-in-between-zeros) |\n| [3447-clear-digits](https://github.com/anishsingh90/Leetcode/tree/master/3447-clear-digits) |\n## Binary Search\n|  |\n| ------- |\n| [0034-find-first-and-last-position-of-element-in-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0034-find-first-and-last-position-of-element-in-sorted-array) |\n| [0035-search-insert-position](https://github.com/anishsingh90/Leetcode/tree/master/0035-search-insert-position) |\n| [0162-find-peak-element](https://github.com/anishsingh90/Leetcode/tree/master/0162-find-peak-element) |\n| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anishsingh90/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |\n| [0240-search-a-2d-matrix-ii](https://github.com/anishsingh90/Leetcode/tree/master/0240-search-a-2d-matrix-ii) |\n| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |\n| [0882-peak-index-in-a-mountain-array](https://github.com/anishsingh90/Leetcode/tree/master/0882-peak-index-in-a-mountain-array) |\n## Bit Manipulation\n|  |\n| ------- |\n| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |\n## Divide and Conquer\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/anishsingh90/Leetcode/tree/master/0169-majority-element) |\n| [0240-search-a-2d-matrix-ii](https://github.com/anishsingh90/Leetcode/tree/master/0240-search-a-2d-matrix-ii) |\n## Matrix\n|  |\n| ------- |\n| [0240-search-a-2d-matrix-ii](https://github.com/anishsingh90/Leetcode/tree/master/0240-search-a-2d-matrix-ii) |\n## Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/anishsingh90/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0144-binary-tree-preorder-traversal](https://github.com/anishsingh90/Leetcode/tree/master/0144-binary-tree-preorder-traversal) |\n## Binary Tree\n|  |\n| ------- |\n| [0094-binary-tree-inorder-traversal](https://github.com/anishsingh90/Leetcode/tree/master/0094-binary-tree-inorder-traversal) |\n| [0144-binary-tree-preorder-traversal](https://github.com/anishsingh90/Leetcode/tree/master/0144-binary-tree-preorder-traversal) |\n## Counting\n|  |\n| ------- |\n| [0169-majority-element](https://github.com/anishsingh90/Leetcode/tree/master/0169-majority-element) |\n## Memoization\n|  |\n| ------- |\n| [0070-climbing-stairs](https://github.com/anishsingh90/Leetcode/tree/master/0070-climbing-stairs) |\n## Combinatorics\n|  |\n| ------- |\n| [0062-unique-paths](https://github.com/anishsingh90/Leetcode/tree/master/0062-unique-paths) |\n\u003c!---LeetCode Topics End--\u003e","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanishsingh90%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fanishsingh90%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fanishsingh90%2Fleetcode/lists"}