Tuhinm2002
Tuhinm2002
- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...
### What would you like to Propose? I found Dynamic Programming is there but the basic Recursion is not there. Problems like finding power set or subsets can only be...
- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...
- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...
### What would you like to Propose? This algo counts the number of unique subsequence or subsets can be produced from a string. * Test cases ``` public class UniqueSubsequencesCountTest...
- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...
### What would you like to Propose? An optimized way of finding single element in the array of duplicate elements (appearing twice). * Time complexity : O(n) * Space complexity...
- [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Java/blob/master/CONTRIBUTING.md). - [x] This pull request is all my own work -- I have not plagiarized it. - [x] All filenames are in PascalCase. -...
### What would you like to Propose? The algo finds the nth bit of a given number using bit manipulation techniques * Space complexity O(1) * Time complexity O(1) *...