Add Ruby implementation for Day 6 problem; Add Ruby, C++ & Java implementations for Day 7 problem (#72)

* Add @aaditkamat as a contributor

* Add Ruby code for Day 1: FizzBuzz problem

* Add Ruby code for Day 2: String reverse problem

* Update README.md for Day 2

* Modify Ruby code and README

* Add condition for nil and wrong type edge cases

* Add a seperate Ruby source code file for palindrome

* Modify code for reverse.rb

* Add seperate palindrome and reverse code sections in README

* Update gitignore

* Refactor palindrome.rb and rename heading in README

* Add solution for Day 3: Hamming Problem

* Add condition for strings of unequal lengths

* Update README

* Change project name and owner in.all-contributorsrc

* Remove merge conflict lines

* Add @shivank86 as a contributor

* Add C++ files for different patterns

* Add author and date comments at the top of C++ files

* Update README.md

* Add solution for Day 6 Problem in Python

* Update README

* Refactor code files

* Modify string representation of output in python files

* Add Ruby solutions for Day 6 problem

* Update README for Ruby code

* Add first version of solutions for Day 7 problem in C++, Java & Ruby

* Modify solutions

* Update Day 7 README

* Remove merge conflicts from CONTRIBUTORS.md

* Add back removed lines in CONTRIBUTORS.md

* Add code sections contributed by @imkaka to day 6 README

* Update README.md

Author: Aadit Kamat

.all-contributorsrc

@@ -164,4 +164,4 @@
       ]
     }
   ]
-}
+}

CONTRIBUTORS.md

@@ -1,7 +1,5 @@
-
 [![All Contributors](https://img.shields.io/badge/all_contributors-15-orange.svg?style=flat-square)](#contributors)
 
-
 ## Contributors
 
 Thanks goes to these wonderful people ([emoji key](https://github.com/kentcdodds/all-contributors#emoji-key)):
@@ -14,4 +12,4 @@ Thanks goes to these wonderful people ([emoji key](https://github.com/kentcdodds
 | [<img src="https://avatars2.githubusercontent.com/u/25405726?v=4" width="100px;"/><br /><sub><b>Vishal Shirke</b></sub>](https://github.com/vishalshirke7)<br />[📖](https://github.com/CodeToExpress/dailycodebase/commits?author=vishalshirke7 "Documentation") [💻](https://github.com/CodeToExpress/dailycodebase/commits?author=vishalshirke7 "Code") |
 <!-- ALL-CONTRIBUTORS-LIST:END -->
 
-This project follows the [all-contributors](https://github.com/kentcdodds/all-contributors) specification. Contributions of any kind welcome!
+This project follows the [all-contributors](https://github.com/kentcdodds/all-contributors) specification. Contributions of any kind welcome!

day6/Python/reverse_words.py

@@ -11,4 +11,4 @@ def reverse_words(string):
 
 print("Enter a string: ", end= '')
 string = input()
-print("Reverse of string: ", reverse_words(string))
+print("Reverse of string \'", string, "\': ", reverse_words(string), sep='')

day6/Python/sentence_capitalization.py

@@ -17,5 +17,5 @@ def capitalize_sentence_long(string):
 
 print("Enter a string: ", end= ' ')
 string = input()
-print("String \'", string, "\' with first letter of each word capitalized (short version): ", capitalize_sentence_short(string))
-print("String \'", string, "\' with first letter of each word capitalized (slightly long version): ", capitalize_sentence_long(string))
+print("String \'", string, "\' with first letter of each word capitalized (short version): ", capitalize_sentence_short(string), sep='')
+print("String \'", string, "\' with first letter of each word capitalized (slightly long version): ", capitalize_sentence_long(string), sep='')

day6/README.md

@@ -226,6 +226,7 @@ string = input()
 print("String \'", string, "\' with first letter of each word capitalized (short version): ", capitalize_sentence_short(string))
 print("String \'", string, "\' with first letter of each word capitalized (slightly long version): ", capitalize_sentence_long(string))
 ```
+
 ## C++ Implementation
 
 ### [Solution](./cpp/Capialise.cpp)
@@ -255,19 +256,15 @@ int main() {
 }
 ```
 
-## C++ Implementation
-
 ### [Solution](./C++/day6_1.cpp)
 
 ```cpp
 /*
 * @author : dhruv-gupta14
 * @date : 27/12/2018
 */
-
 #include<bits/stdc++.h>
 using namespace std;
-
 int main()
 {
     string s;
@@ -318,7 +315,30 @@ int main(){
     cout << "Result: " << str;
     return 0;
 }
+```
+
+## Ruby Implementation
+
+### [sentence_capitalization.rb](./Ruby/sentence_capitalization.rb)
+
+```ruby
+
+=begin
+@author: aaditkamat
+@date: 27/12/2018
+=end
 
+def capitalize_sentence(string)
+    new_string = ''
+    string.split(' ').each do |word|
+        new_string += word.capitalize + ' '
+    end
+    new_string
+end
+
+print"Enter a string: "
+string = gets().chomp
+puts "String \" #{string} \" with first letter of each word capitalized: #{capitalize_sentence(string)}"
 ```
 
 ## Part B -- Word Reversal
@@ -515,8 +535,9 @@ def reverse_words(string):
 
 print("Enter a string: ", end= '')
 string = input()
-print("Reverse of string: ", reverse_words(string)})
+print("Reverse of string \'", string, "\': ", reverse_words(string), sep='')
 ```
+
 ## C++ Implementation
 
 ### [Solution](./cpp/wrdReversal.cpp)
@@ -621,6 +642,30 @@ int main(){
 }
 ```
 
+## Ruby Implementation
+
+### [reverse_words.rb](./Ruby/reverse_words.rb)
+
+```ruby
+
+=begin
+@author: aaditkamat
+@date: 27/12/2018
+=end
+
+def reverse_words(string)
+    new_string = ''
+    string.split(' ').each do |word|
+        new_string += word.reverse + ' '
+    end
+    new_string
+end
+
+print"Enter a string: "
+string = gets().chomp
+print"Reverse of string #{string}:  #{reverse_words(string)}"
+```
+
 ## Part C -- Anagram Check
 
 **Question** - Write a program to check whether the two provided strings are anagrams of each other.
@@ -639,7 +684,7 @@ int main(){
 function anagram (str1, str2) {
     let len1 = str1.length,
         len2 = str2.length;
-
+    
     // Compare lengths
     if (len1 !== len2) {
         console.log ('Invalid Input');
@@ -675,7 +720,7 @@ anagram ('LISTEN', 'SILENT');
 function anagram (str1, str2) {
     let len1 = str1.length,
         len2 = str2.length;
-
+    
     // Compare lengths
     if (len1 !== len2) {
         console.log ('Invalid Input');
@@ -705,7 +750,7 @@ function anagram (str1, str2) {
     }
 
     console.log(`"${str1}" and "${str2}" are Anagrams`);
-}
+}   
 
 anagram ('LISTEN', 'MILENT');
 ```
@@ -754,7 +799,7 @@ function anagram (str1, str2) {
     if (flag !== 1) {
         console.log (`${str1} and ${str2} are not Anagrams`);
         return 0;
-    }
+    } 
     else {
         console.log (`${str1} and ${str2} are Anagrams`);
         return 1;
@@ -782,7 +827,7 @@ if( sorted(Str1) != sorted(Str2) ): print("not", end=" ")
 print("anagrams")
 ```
 
-### [reverse_words.py](./Python/reverse_words.py)
+### [anagram_check.py](./Python/anagram_check.py)
 ```python
 '''
 @author: aaditkamat
@@ -794,12 +839,6 @@ def check_anagram(first_str, second_str):
     second_word_dict = {}
     first_str = first_str.replace(' ', '').lower()
     second_str = first_str.replace(' ', '').lower()
-    for ch in first_str:
-        if ch not in first_word_dict:
-            first_word_dict[ch] = 1
-        else:
-            first_word_dict[ch] += 1
-
     for ch in second_str:
         if ch not in second_word_dict:
             second_word_dict[ch] = 1
@@ -935,4 +974,42 @@ int main(){
 
     return 0;
 }
-```
+```
+
+## Ruby Implementation
+
+### [anagram_check.rb](./Ruby/anagram_check.rb)
+```ruby
+
+=begin
+@author: aaditkamat
+@date: 27/12/2018
+=end
+
+def check_anagram(first_str, second_str)
+    first_word_dict = {}
+    second_word_dict = {}
+    first_str.gsub!(" ", "").downcase!
+    second_str.gsub!(" ", "").downcase!
+    first_str.each_char do |ch|
+        if first_word_dict.has_key?(ch)
+            first_word_dict[ch] += 1
+        else
+            first_word_dict[ch] = 1
+        end
+    end
+    second_str.each_char do |ch|
+        if second_word_dict.has_key?(ch)
+            second_word_dict[ch] += 1
+        else
+            second_word_dict[ch] = 1
+        end
+    end
+    first_word_dict == second_word_dict
+end
+
+puts "Enter two strings: "
+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))}"
+```

day6/Ruby/anagram_check.rb

@@ -0,0 +1,31 @@
+=begin
+@author: aaditkamat
+@date: 27/12/2018
+=end
+
+def check_anagram(first_str, second_str)
+    first_word_dict = {}
+    second_word_dict = {}
+    first_str.gsub!(" ", "").downcase!
+    second_str.gsub!(" ", "").downcase!
+    first_str.each_char do |ch|
+        if first_word_dict.has_key?(ch)
+            first_word_dict[ch] += 1
+        else
+            first_word_dict[ch] = 1
+        end
+    end
+    second_str.each_char do |ch|
+        if second_word_dict.has_key?(ch)
+            second_word_dict[ch] += 1
+        else
+            second_word_dict[ch] = 1
+        end
+    end
+    first_word_dict == second_word_dict
+end
+
+puts "Enter two strings: "
+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))}"

day6/Ruby/reverse_words.rb

@@ -0,0 +1,16 @@
+=begin
+@author: aaditkamat
+@date: 27/12/2018
+=end
+
+def reverse_words(string)
+    new_string = ''
+    string.split(' ').each do |word|
+        new_string += word.reverse + ' '
+    end
+    new_string
+end
+
+print"Enter a string: "
+string = gets().chomp
+print"Reverse of string #{string}:  #{reverse_words(string)}"

day6/Ruby/sentence_capitalization.rb

@@ -0,0 +1,16 @@
+=begin
+@author: aaditkamat
+@date: 27/12/2018
+=end
+
+def capitalize_sentence(string)
+    new_string = ''
+    string.split(' ').each do |word|
+        new_string += word.capitalize + ' '
+    end
+    new_string
+end
+
+print"Enter a string: "
+string = gets().chomp
+puts "String \" #{string} \" with first letter of each word capitalized: #{capitalize_sentence(string)}"

day7/C++/one_edit_away.cpp

@@ -0,0 +1,79 @@
+/*
+ * @author: aaditkamat
+ * @date: 28/12/2018
+ */
+
+#include <iostream>
+
+using namespace std;
+
+bool can_replace_a_character(string str1, string str2) {
+	if (str1.size() != str2.size()) {
+		return false;
+	}
+
+	int change = 0;
+	
+	for (int i = 0; i < str1.size(); i++) {
+		if (str1[i] != str2[i]) {
+			change++;
+		}
+	}
+	
+	return change == 1;
+}
+
+bool is_a_modified_substring(string str1, string str2) {
+	if (str1.empty()) {
+		return true;
+	}
+
+	if (str1[0] != str2[1] && str1[0] != str2[0]) {
+		return false;
+	}
+
+	int found = str2.find(str1[0]);
+	
+	if (found == 1) {
+		return str2.find(str1) != string::npos;
+	}
+
+	int j = 0, ctr = 0;
+	for (int i = 0; i < str1.size(); j++) {
+		if (j >= str2.size()) {
+				return false;
+		}
+		if (str1[i] != str2[j] && ctr == 0) {
+			ctr++;
+			continue;
+		}
+		if (str1[i] != str2[j]) {
+			return false;
+		}
+		i++;
+	}
+	return true;
+}
+
+bool can_add_a_character(string str1, string str2) {
+	return str2.size() - str1.size() == 1 && is_a_modified_substring(str1, str2);  
+}
+
+bool can_delete_a_character(string str1, string str2) {
+	return str1.size() - str2.size() == 1 && is_a_modified_substring(str2, str1);
+}
+
+bool are_one_edit_away(string str1, string str2) {
+	if (str1 == str2) {
+		return true;
+	}
+	return can_replace_a_character(str1, str2) || can_add_a_character(str1, str2) || can_delete_a_character(str1, str2);
+}
+
+int main() {
+	string str1, str2;
+	cout << "Enter two strings: " << endl;
+	getline(cin, str1);
+	getline(cin, str2);
+	cout << "Are \"" << str1 << "\" and \"" << str2 << "\" one edit away? " << are_one_edit_away(str1, str2) << endl;
+}