This repository is a collection of algorithms, data structures, their implementations, 650+ solved questions on from popular coding challenge websites such as leetcode.com, codeforces.com, hackerrank.com, geeksforgeeks.org, codechef.com, topcoder.com, acm.timus.ru, spoj.com and also some interview questions that many people are asked during the interview. Algorithms are implemented in Java. I will try to add C++ versions in the future. If you would like to do that or in any other languages, feel free to send a pull request.
The main intent of creating the repository is to learn algorithms and helping to those who want to improve problem-solving skill. I will try do add new algorithms regularly.
- List
- Queue
- Stack
- Sorting
- O(N^2) Algorithms
- O(N log N) Algorithms
- Sub O(N log N) Algorithms
- Searching
- Hash Table
- Recursion
- Tree
- Balanced Tree
- Graph
- Adjacency List
- Adjacency Matrix
Problems are divided into three categories. Most of the solved questions here from leetcode. Please visit the website leetcode.com to read the questions
- Array Nesting
- Array Partition
- Bit Character
- Contains Duplicate
- Degree of an array
- Find All Numbers Disappeared in an Array
- Largest Number At Least
- Delete Node in a Linked List
- Reverse LinkedList
- Remove Duplicates from Sorted List
- Swap Nodes in Pairs
- Linked List Cycle
- Remove Nth Node From End of List
- Insertion Sort List
- Add Strings
- Add two numbers
- Arranging coins
- Count Primes
- Excel Column
- Minimum moves equal
- Palindrome Number
- Add Binary
- Complex Number
- Detect Capital
- Judge Circle
- Longest Common Prefix
- Roman to Integer
- Valid Palindrome
- Binary Number with Alternating Bits
- Hamming Distance
- Letter Case
- Number of one bits
- Power of four
- Power of two
- Single element
- Binary Tree Zigzag Level Order Traversal
- Delete Node in a BST
- Binary Tree Right Side View
- Binary Tree Level Order Traversal
- Binary Tree Preorder Traversal
- Find Largest Value in Each Tree Row
- Find Bottom Left Tree Value
Oops ! Have you found a mistake ? Please, feel free to pull request !. Your work is really appreciated.
By the way... thank you! And if you'd like to say thanks... :)