Solutions to various Problems of DSA and Competitive programming
- easy
- medium
- hard
- leetcode
- Codechef
- array
- Linkedlist
- Stack
- Queue
- sorting
- binarySearch
- binarySearchTree
- binaryTree
- breadthFirstSearch
- depthFirstSearch
- recursion
- Dynamic programming
- distance
- graph
- interval
- list
- matrix
- 2D matrix
- map
- nAryTree
- number
- palindrome
- sort
- string
- suffixArray
If you want to contribute to this repository, follow these steps:
- Fork the repository.
- Create a new branch:
git checkout -b feature-name. - Implement your solution and ensure it's well-documented.
- Add your solution to the appropriate directory or create a new one if needed.
- Commit your changes:
git commit -m 'Add feature'. - Push to the branch:
git push origin feature-name. - Open a pull request.