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. 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 !!!

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

#	Title	Solution	Time	Space	Difficulty	Tag	Note
0136	Single Number	Java Python	O(n)	O(1)	Easy		Using XOR
0137	Single Number II	Java Python	O(n)	O(1)	Medium

⬆️ Back to Top

Array

#	Title	Solution	Time	Space	Difficulty	Tag	Note
56	Merge Intervals	Python	O(nlogn)	O(n)	Medium	Intervals

⬆️ Back to Top

String

#	Title	Solution	Time	Space	Difficulty	Tag	Note
383	Ransom Note	Java	O(1)	O(n)	Easy		Character Count

⬆️ Back to Top

LinkedList

#	Title	Solution	Time	Space	Difficulty	Tag	Note

⬆️ Back to Top

Graph

#	Title	Solution	Time	Space	Difficulty	Tag	Note
1042	Flower Planting with No Adjacent	Python	O(V+E)	O(2V+E)	Medium	Graph	Graph Coloring

⬆️ Back to Top

Authors

• Gourav Rusiya

Contributors

Name	Country	Programming Language	Where to find you (add all links to your profiles eg on Hackerrank, Codechef, LeetCode...)
Lokendra Bohra	India	Python	Leetcode Hackerrank