algorithms
algorithms copied to clipboard
Dive into algorithms, data structures, and competitive programming solutions in multiple languages. Active since Hacktoberfest 2020!
#### This issue is about [Algo/DS Name/Question Name](link to resource for the Algo/DS/Question) - [x] I searched or browsed the repo’s other issues to ensure this is not a duplicate...
Use of Bitmasking technique to efficiently evaluate the safe condition O(1) instead of O(N). USING THE BITMASKING TECHNIQUE-THE MOST OPTIMIZED SOLUTION TO FIND ALL DISTINCT SOLUTIONS TO N QUEENS PUZZLE.
#### This issue is about [Eulerian Tour Tree]() - [x] I searched or browsed the repo’s other issues to ensure this is not a duplicate - [x] Issue Title is...
#### This issue is about [Algo/DS Name/Question Name](link to resource for the Algo/DS/Question) - [x] I searched or browsed the repo’s other issues to ensure this is not a duplicate...
**If the input is less than 0, handle this case by simple if else**
#### This issue is about [Climbing Stairs Question](https://leetcode.com/problems/climbing-stairs) - [x] I searched or browsed the repo’s other issues to ensure this is not a duplicate - [x] Issue Title is...
#### This issue is about [Algo/DS Name/Question Name](link to resource for the Algo/DS/Question) - [x] I searched or browsed the repo’s other issues to ensure this is not a duplicate...
**Algorithm/Data Structure**: Counting Sort **Programming Language**: C++ **Difficulty**: ⭐️⭐️⭐️ ### Issue Details #### Description Counting Sort is a linear time sorting algorithm that is particularly efficient when the range of...
**Algorithm/Data Structure**: Counting Sort **Programming Language**: C **Difficulty**: ⭐️⭐️⭐️ ### Issue Details #### Description Counting Sort is a linear time sorting algorithm that is particularly efficient when the range of...