This is a repository where you can upload the updates of your daily DSA growth so that you can inspire your Colleagues to practice DSA and grow in that particular field.
You can clone it and contribute in the repository as follows:
- Fork and Clone the Repository
git clone https://github.com/<your github id>/Contributor-List.git
- Contribute in the repository
- Add the changes in the staging area
git add .
- Commit the Changes
git commit -m "<Commit Message>"
- Take pull before pushing the contributions to avoid any kind of merge conflicts
git pull origin master
- Push the changes into your respository
git push origin master
- Create Pull Request and submit
- Given an array A[] of n numbers and another number x, the task is to check whether or not there exist two elements in A[] whose sum is exactly x.
- Given an array A[] of n numbers and another number x, the task is to check whether or not there exist two elements in A[] whose sum is exactly x.
- Given an array A[] of n numbers and another number x, the task is to check whether or not there exist two elements in A[] whose sum is exactly x.
- Given an array A[] of n numbers and another number x, the task is to check whether or not there exist two elements in A[] whose sum is exactly x.
- Given an array A[] of n numbers and another number x, the task is to check whether or not there exist two elements in A[] whose sum is exactly x.
In the DSA folder, you can add a file. In that file, put the particular question you are practising in comments at top and then write your code out. And after Creating the Particular File, add your name in the Contributer file.