A real coder should not be satisfied by doing only one problem daily, rather he/she should keep coding as much as possible. So, here I (@MadhavBahl) am adding some more problems that you can practise 😃
Also, these problems have been taking form various sources, so ig you think you own any of the given problems, just send me an email at theleanprogrammer@gmail.com and I will be more than happy to give proper credits 😊
The file structure is as follows
├───BONUS
│ README.md
├───Algorithms
│ README.md
├───Arrays
│ README.md
├───Graphs
│ README.md
├───LinkedLists
│ README.md
├───Queues
│ README.md
├───Recursion
│ README.md
├───Stacks
│ README.md
├───Strings
│ README.md
└───Trees
README.md
In the main README.md
of dailycodebase repository, there are links to the README of BONUS
directory, and the README.md
of sub topics
In the README.md
of BONUS
directory, there is the list of all topics and under that there are all questions
In the README.md
of any topic directory, say Arrays
there is a README which contains all questions of that topic along with the link to the README.md
of the directory containing the question
The README.md
of directory containing the question must contain all the information about the question with some examples and the solution, and a little writeup about the algorithm used.
Before contributing any question, make sure that this structure is followed properly
In case you just want to contribute a question and not code, there is no need to do so many things, just open an issue with the topic Problem Submission and the problem in the comments. I'll add it myself, and will give you proper credits 😃
- To be added
- WAP to calculate
a
raised to the powern
using recursion - WAP to calculate the factorial of a given number usinig recursion
- WAP to calculate the product of elements in the given array using recursion
- WAP to calculate the sum of elements in a given integer array using recursion
- WAP to find the nth number in Fibonacci Series using recursion
- WAP to reverse a string using recursion
- WAP to reverse an integer array using recursion
- To be added
- To be added
- To be added
- To be added
- To be added
- To be added
- To be added