LeetCode-Solutions

Got stuck in a LeetCode question? This repository will help you by providing approach of solving the problems from LeetCode platform.

Contributors helped us in providing these Awesome solutions.

If you want to contribute, please create a Pull Request. If you are new to Github please check pull request procedure ---> PR process

Check out ---> Sample PR

• There are new LeetCode questions every week. I'll keep updating for full summary and better solutions.
• For more challenging problem solutions, you can also see our HackerRank-Solutions, ProjectEuler repositories.
• Hope you enjoy the journey of learning data structures and algorithms.
• Notes: "🔒" means your subscription of LeetCode premium membership is required for reading the question.

Don't forget to give us a 🌟 to support us.

Check out -> Learning Resources

Algorithms

• Bit Manipulation
• Array
• String
• Linked List
• Stack
• Queue
• Heap
• Tree
• Hash Table
• Math
• Two Pointers
• Sort
• Recursion
• Binary Search
• Binary Search Tree
• Breadth-First Search
• Depth-First Search
• Backtracking
• Dynamic Programming
• Greedy
• Graph
• Geometry
• Simulation
• Design
• Concurrency

Bit Manipulation

Python

C++ | O(n) | O(1) | Easy | | Using XOR | | 137 | Single Number II | Python

C++ | O(n) | O(1) | Medium | | | | 260 | Single Number III | Python

C++ | O(n) | O(1) | Medium | | | | 476 | Number Complement | Java

C++ | O(1) | O(1) | Easy | | Tutorial | | 520 | Detect Capital Use | Python

C++ | O(n) | O(1) | Easy | | | | 1486 | XOR Operation in an Array | Java | O(n) | O(1) | Easy | | Using XOR |

<b><a href="#algorithms">⬆️ Back to Top</a></b>

Sort

   <b><a href="#algorithms">⬆️ Back to Top</a></b>

Array

C++ | O(N) | O(1) | Medium | Stocks | | | 119 | Pascal's Triangle II | Python | O(N^2) | O(K) | Easy | | | | 1480 | Running Sum of 1d Array | Java | O(N) | O(N) | Easy | Simple sum | | | 42 | Trapping Rain Water | Python | O(N^2) | O(N) | Hard | Array | | | 11 | Container with Most Water | Python | O(N) | O(N) | Medium | Array Two Pointers | | | 1134 🔒 | Armstrong Number | Java | O(N) | O(1) | Easy | | | | 1534 | Count Good Triplets | Python | O(N^3) | O(1) | Easy | | | | 1572 | Matrix Diagonal Sum | Java | O(N) | O(1) | Easy | | | | 811 | Subdomain Visit Count