Coding is Fun! Do it everyday 💯💯
Code Daily, add your solutions to the given problem, submit a PR (and don't forget to add your name in the contributors list)
Read CONTRIBUTING.md for contribution guidelines.
- Day 1 -- The Fizz Buzz Problem -- http://codetoexpress.tech/dc/day1
- Day 2 -- String Reversal + Palindrome -- http://codetoexpress.tech/dc/day2/
- Day 3 -- The Hamming Distance Problem -- http://codetoexpress.tech/dc/day3/
- Day 4 -- Num Vowels + Max Chars -- http://codetoexpress.tech/dc/day4/
- Day 5 -- Pattern Printing Problems -- http://codetoexpress.tech/dc/day5/
- Day 6 -- Sentence Cap + Word Reversal + Anagram -- http://codetoexpress.tech/dc/day6/
- Day 7 -- One Edit Away -- http://codetoexpress.tech/dc/day7/
- Day 8 -- Minimum Edit Distance -- http://codetoexpress.tech/dc/day8/
- Day 9 -- Smallest Substring Problem -- http://codetoexpress.tech/dc/day9/
- Day 10 -- String Permutation Problem -- http://codetoexpress.tech/dc/day10/
- Day 11 -- Longest Common Substring -- http://codetoexpress.tech/dc/day11/
- Day 12 -- Substring Search Algorithms -- http://codetoexpress.tech/dc/day12/
- Day 13 -- Factorial and Fibonacci -- http://codetoexpress.tech/dc/day13/
- Day 14 -- Sum of digits and product of numbers -- http://codetoexpress.tech/dc/day14/
- Day 15 -- Pascal's Triangle -- http://codetoexpress.tech/dc/day15/
- Day 16 -- Tower of Hanoi -- http://codetoexpress.tech/dc/day16/
- Day 17 -- N Queens Problem -- http://codetoexpress.tech/dc/day17/
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 (@MadhavBahlMD) 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 [email protected] and I will be more than happy to give proper credits 😊
The file structure is as follows
\DAILY CODE BASE
├───BONUS
│ ├───Algorithms
│ ├───Arrays
│ ├───Graphs
│ ├───LinkedLists
│ ├───Queues
│ ├───Recursion
│ ├───Stacks
│ ├───Strings
│ └───Trees
In this main README.md
, 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 😃