https://github.com/anishsingh90/leetcode
📘 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++ ⚙️
https://github.com/anishsingh90/leetcode
array binary-search-tree dynamic-programming graph linkedlist queue stack tree
Last synced: 3 months ago
JSON representation
📘 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++ ⚙️
- Host: GitHub
- URL: https://github.com/anishsingh90/leetcode
- Owner: anishsingh90
- Created: 2025-01-06T19:34:36.000Z (5 months ago)
- Default Branch: main
- Last Pushed: 2025-02-25T06:59:27.000Z (3 months ago)
- Last Synced: 2025-02-25T07:42:03.019Z (3 months ago)
- Topics: array, binary-search-tree, dynamic-programming, graph, linkedlist, queue, stack, tree
- Language: C++
- Homepage:
- Size: 82 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
📘 LeetCode Solutions Repository
Welcome 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. 🎯
📌 Highlights
- **💡 Problem-Solving:** Organized solutions to diverse LeetCode problems, covering various topics like arrays, strings, dynamic programming, and more.
- **📂 Structured:** Each solution is categorized by problem type and includes clean, commented code for better understanding.
- **🚀 Optimization:** Focused on writing efficient and scalable solutions with analysis of time and space complexities.
- **🔍 Learning:** Ideal for developers preparing for interviews or improving problem-solving skills.
🛠️ Languages Used
- ⚙️ C++
- 💻 JavaScript
🚧 Repository Structure
```
📂 Leetcode
├── 📝 Readme.md
├── 📁 Array
├── 📁 String
├── 📁 DynamicProgramming
├── 📁 Tree
└── 📁 Others
```
🤝 Contributions
Contributions, feedback, or discussions are always welcome! 🌟 Feel free to open an issue or a pull request to enhance this repository.
🔗 Connect
- 🌐 LinkedIn: https://www.linkedin.com/in/anish90
- 📧 Email: [email protected]
Happy Coding! 💻✨
# LeetCode Topics
## Math
| |
| ------- |
| [0002-add-two-numbers](https://github.com/anishsingh90/Leetcode/tree/master/0002-add-two-numbers) |
| [0007-reverse-integer](https://github.com/anishsingh90/Leetcode/tree/master/0007-reverse-integer) |
| [0009-palindrome-number](https://github.com/anishsingh90/Leetcode/tree/master/0009-palindrome-number) |
| [0012-integer-to-roman](https://github.com/anishsingh90/Leetcode/tree/master/0012-integer-to-roman) |
| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |
## Array
| |
| ------- |
| [0001-two-sum](https://github.com/anishsingh90/Leetcode/tree/master/0001-two-sum) |
| [0011-container-with-most-water](https://github.com/anishsingh90/Leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/anishsingh90/Leetcode/tree/master/0015-3sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/anishsingh90/Leetcode/tree/master/0027-remove-element) |
| [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) |
| [0035-search-insert-position](https://github.com/anishsingh90/Leetcode/tree/master/0035-search-insert-position) |
| [0075-sort-colors](https://github.com/anishsingh90/Leetcode/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/anishsingh90/Leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0088-merge-sorted-array) |
| [0135-candy](https://github.com/anishsingh90/Leetcode/tree/master/0135-candy) |
| [0162-find-peak-element](https://github.com/anishsingh90/Leetcode/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anishsingh90/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0240-search-a-2d-matrix-ii](https://github.com/anishsingh90/Leetcode/tree/master/0240-search-a-2d-matrix-ii) |
| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |
| [0882-peak-index-in-a-mountain-array](https://github.com/anishsingh90/Leetcode/tree/master/0882-peak-index-in-a-mountain-array) |
## Two Pointers
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/anishsingh90/Leetcode/tree/master/0005-longest-palindromic-substring) |
| [0011-container-with-most-water](https://github.com/anishsingh90/Leetcode/tree/master/0011-container-with-most-water) |
| [0015-3sum](https://github.com/anishsingh90/Leetcode/tree/master/0015-3sum) |
| [0026-remove-duplicates-from-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0026-remove-duplicates-from-sorted-array) |
| [0027-remove-element](https://github.com/anishsingh90/Leetcode/tree/master/0027-remove-element) |
| [0075-sort-colors](https://github.com/anishsingh90/Leetcode/tree/master/0075-sort-colors) |
| [0080-remove-duplicates-from-sorted-array-ii](https://github.com/anishsingh90/Leetcode/tree/master/0080-remove-duplicates-from-sorted-array-ii) |
| [0088-merge-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0088-merge-sorted-array) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anishsingh90/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0908-middle-of-the-linked-list](https://github.com/anishsingh90/Leetcode/tree/master/0908-middle-of-the-linked-list) |
| [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) |
## Greedy
| |
| ------- |
| [0011-container-with-most-water](https://github.com/anishsingh90/Leetcode/tree/master/0011-container-with-most-water) |
| [0044-wildcard-matching](https://github.com/anishsingh90/Leetcode/tree/master/0044-wildcard-matching) |
| [0135-candy](https://github.com/anishsingh90/Leetcode/tree/master/0135-candy) |
## String
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/anishsingh90/Leetcode/tree/master/0005-longest-palindromic-substring) |
| [0010-regular-expression-matching](https://github.com/anishsingh90/Leetcode/tree/master/0010-regular-expression-matching) |
| [0012-integer-to-roman](https://github.com/anishsingh90/Leetcode/tree/master/0012-integer-to-roman) |
| [0044-wildcard-matching](https://github.com/anishsingh90/Leetcode/tree/master/0044-wildcard-matching) |
| [3447-clear-digits](https://github.com/anishsingh90/Leetcode/tree/master/3447-clear-digits) |
## Dynamic Programming
| |
| ------- |
| [0005-longest-palindromic-substring](https://github.com/anishsingh90/Leetcode/tree/master/0005-longest-palindromic-substring) |
| [0010-regular-expression-matching](https://github.com/anishsingh90/Leetcode/tree/master/0010-regular-expression-matching) |
| [0044-wildcard-matching](https://github.com/anishsingh90/Leetcode/tree/master/0044-wildcard-matching) |
## Recursion
| |
| ------- |
| [0002-add-two-numbers](https://github.com/anishsingh90/Leetcode/tree/master/0002-add-two-numbers) |
| [0010-regular-expression-matching](https://github.com/anishsingh90/Leetcode/tree/master/0010-regular-expression-matching) |
| [0044-wildcard-matching](https://github.com/anishsingh90/Leetcode/tree/master/0044-wildcard-matching) |
## Hash Table
| |
| ------- |
| [0001-two-sum](https://github.com/anishsingh90/Leetcode/tree/master/0001-two-sum) |
| [0012-integer-to-roman](https://github.com/anishsingh90/Leetcode/tree/master/0012-integer-to-roman) |
| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |
## Linked List
| |
| ------- |
| [0002-add-two-numbers](https://github.com/anishsingh90/Leetcode/tree/master/0002-add-two-numbers) |
| [0908-middle-of-the-linked-list](https://github.com/anishsingh90/Leetcode/tree/master/0908-middle-of-the-linked-list) |
| [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) |
## Sorting
| |
| ------- |
| [0015-3sum](https://github.com/anishsingh90/Leetcode/tree/master/0015-3sum) |
| [0075-sort-colors](https://github.com/anishsingh90/Leetcode/tree/master/0075-sort-colors) |
| [0088-merge-sorted-array](https://github.com/anishsingh90/Leetcode/tree/master/0088-merge-sorted-array) |
| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |
## Depth-First Search
| |
| ------- |
| [0210-course-schedule-ii](https://github.com/anishsingh90/Leetcode/tree/master/0210-course-schedule-ii) |
## Breadth-First Search
| |
| ------- |
| [0210-course-schedule-ii](https://github.com/anishsingh90/Leetcode/tree/master/0210-course-schedule-ii) |
## Graph
| |
| ------- |
| [0210-course-schedule-ii](https://github.com/anishsingh90/Leetcode/tree/master/0210-course-schedule-ii) |
## Topological Sort
| |
| ------- |
| [0210-course-schedule-ii](https://github.com/anishsingh90/Leetcode/tree/master/0210-course-schedule-ii) |
## Stack
| |
| ------- |
| [3447-clear-digits](https://github.com/anishsingh90/Leetcode/tree/master/3447-clear-digits) |
## Simulation
| |
| ------- |
| [3447-clear-digits](https://github.com/anishsingh90/Leetcode/tree/master/3447-clear-digits) |
## Binary Search
| |
| ------- |
| [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) |
| [0035-search-insert-position](https://github.com/anishsingh90/Leetcode/tree/master/0035-search-insert-position) |
| [0162-find-peak-element](https://github.com/anishsingh90/Leetcode/tree/master/0162-find-peak-element) |
| [0167-two-sum-ii-input-array-is-sorted](https://github.com/anishsingh90/Leetcode/tree/master/0167-two-sum-ii-input-array-is-sorted) |
| [0240-search-a-2d-matrix-ii](https://github.com/anishsingh90/Leetcode/tree/master/0240-search-a-2d-matrix-ii) |
| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |
| [0882-peak-index-in-a-mountain-array](https://github.com/anishsingh90/Leetcode/tree/master/0882-peak-index-in-a-mountain-array) |
## Bit Manipulation
| |
| ------- |
| [0268-missing-number](https://github.com/anishsingh90/Leetcode/tree/master/0268-missing-number) |
## Divide and Conquer
| |
| ------- |
| [0240-search-a-2d-matrix-ii](https://github.com/anishsingh90/Leetcode/tree/master/0240-search-a-2d-matrix-ii) |
## Matrix
| |
| ------- |
| [0240-search-a-2d-matrix-ii](https://github.com/anishsingh90/Leetcode/tree/master/0240-search-a-2d-matrix-ii) |