Add day 9

CodeToExpress · Jan 1, 2019 · 24ae28a · 24ae28a
1 parent f7ca66e
commit 24ae28a
Show file tree

Hide file tree

Showing 8 changed files with 49 additions and 1 deletion.
diff --git a/Day1/README.md b/Day1/README.md
@@ -381,3 +381,9 @@ for i in range(1,n+1):
     else:
         print(i)
 ```
+
+### Have Another solution?
+
+The beauty of programming lies in the fact that there is never a single solution to any problem.
+
+In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)
diff --git a/Day2/README.md b/Day2/README.md
@@ -771,3 +771,9 @@ def palindrome(str)
   str != nil and str === short_solution(str)
 end
 ```
+
+### Have Another solution?
+
+The beauty of programming lies in the fact that there is never a single solution to any problem.
+
+In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)
diff --git a/Day3/README.md b/Day3/README.md
@@ -366,3 +366,9 @@ print("number of characters not matching are:",len(k))
 
 The #1 reason for not being successful is inconsistency, and it is a common trend that people start something and on give up on the third day itself, and one of the major reasons behind that is that they find it difficult to continue. 
 So, to keep everyone (who is following the DailyCodes challenge) consistent, I have decided to keep today's question very simple and straightforward.
+
+### Have Another solution?
+
+The beauty of programming lies in the fact that there is never a single solution to any problem.
+
+In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)
diff --git a/day4/README.md b/day4/README.md
@@ -888,3 +888,9 @@ str = gets
 str.chomp!
 puts "The most frequent character in #{str} is : #{most_frequent_character(str)}"
 ```
+
+### Have Another solution?
+
+The beauty of programming lies in the fact that there is never a single solution to any problem.
+
+In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)
diff --git a/day5/README.md b/day5/README.md
@@ -2158,3 +2158,9 @@ int main() {
  return 0;
 }
 ```
+
+### Have Another solution?
+
+The beauty of programming lies in the fact that there is never a single solution to any problem.
+
+In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)
diff --git a/day6/README.md b/day6/README.md
@@ -1097,3 +1097,9 @@ first_str = gets().chomp
 second_str = gets().chomp
 puts "\nAre #{first_str} and #{second_str} anagrams? #{check_anagram(String.new(first_str), String.new(second_str))}"
 ```
+
+### Have Another solution?
+
+The beauty of programming lies in the fact that there is never a single solution to any problem.
+
+In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)
diff --git a/day7/README.md b/day7/README.md
@@ -866,4 +866,10 @@ def main
 end
 
 main
-```
+```
+
+### Have Another solution?
+
+The beauty of programming lies in the fact that there is never a single solution to any problem.
+
+In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)
diff --git a/day8/README.md b/day8/README.md
@@ -281,3 +281,9 @@ public class Levenshtein {
     }
 }
 ```
+
+### Have Another solution?
+
+The beauty of programming lies in the fact that there is never a single solution to any problem.
+
+In case you have an alternative way to solve this problem, do contribute to this repository (https://github.com/CodeToExpress/dailycodebase) :)