update

Author: Carlos Leonard

61_LargestFour.cpp

@@ -0,0 +1,75 @@
+// For this challenge you will need to find the four largest elements in an array.
+/*
+have the function LargestFour(arr) take the array of integers stored in arr, and find the four largest elements and return their sum. For example: if arr is [4, 5, -2, 3, 1, 2, 6, 6] then the four largest elements in this array are 6, 6, 4, and 5 and the total sum of these numbers is 21, so your program should return 21. If there are less than four numbers in the array your program should return the sum of all the numbers in the array.
+*/
+
+#include <iostream>
+#include <string>
+using namespace std;
+
+/*
+Check the size of the input
+If less than or equal to 4 find the sum
+Order the numbers
+Get the last 4
+find the sum
+*/
+
+void bubbleSort(int arr[], int size)
+{
+	bool swap;
+	do
+	{
+		swap = false;
+		int temp;
+
+		for (int x = 0; x < size-1; x++)
+		{
+			if (arr[x] > arr[x + 1])
+			{
+				temp = arr[x];
+				arr[x] = arr[x + 1];
+				arr[x + 1] = temp;
+				swap = true;
+			}
+		}
+	} while (swap);
+}
+
+int LargestFour(int arr[], int size) 
+{
+	int total = 0;
+	if (size <= 4)
+	{
+		for (int x = 0; x < size; x++)
+		{
+			total += arr[x];
+		}
+		return total;
+	}
+	else
+	{
+		// Sort our input
+		bubbleSort(arr, size);
+
+		int count = 0;
+		for (int x = size - 1; count < 4; count++, x--)
+		{
+			total += arr[x];
+		}
+		return total;
+	}
+}
+
+int main() 
+{
+	int A[] = { 4, 5, -2, 3, 1, 2, 6, 6 };
+	int B[] = { 1, 1, 1, -5 };
+	int C[] = { 0, 0, 2, 3, 7, 1 };
+	cout << LargestFour(A, sizeof(A)/sizeof(A[0])) << endl; // 21
+	cout << LargestFour(B, sizeof(B) / sizeof(B[0])) << endl; // -2
+	cout << LargestFour(C, sizeof(C) / sizeof(C[0])) << endl; // 13
+	return 0;
+}
+
+

62_QuestionMarks.cpp

@@ -0,0 +1,82 @@
+// For this challenge you will be determining if a string follows a particular pattern.
+/*
+have the function QuestionsMarks(str) take the str string parameter, which will contain single digit numbers, letters, and question marks, and check if there are exactly 3 question marks between every pair of two numbers that add up to 10. If so, then your program should return the string true, otherwise it should return the string false. If there aren't any two numbers that add up to 10 in the string, then your program should return false as well.
+
+For example: if str is "arrb6???4xxbl5???eee5" then your program should return true because there are exactly 3 question marks between 6 and 4, and 3 question marks between 5 and 5 at the end of the string.
+*/
+
+#include <iostream>
+#include <string>
+using std::cout;
+using std::string;
+using std::cin;
+using std::endl;
+
+/*
+locate any digits
+analyze if the pair of number add up to 10
+Keep track of their index if they do
+Check to see if there are exactly 3 question marks in between them
+*/
+
+string QuestionsMarks(string str) 
+{
+	bool correctPair = false;
+
+	for (int x = 0; x < str.size()-1; x++)
+	{
+		if (str[x] >= '0' && str[x] <= '9')
+		{
+			for (int y = x + 1; y < str.size(); y++)
+			{
+				if (str[y] >= '0' && str[y] <= '9')
+				{
+					int total = int(str[x]) - 48 + (int(str[y]) - 48);
+
+					if (total == 10)
+					{
+						correctPair = true;
+
+						// Count number of question marks
+						int count = 0;
+						for (int i = x; i < y; i++)
+						{
+							if (str[i] == '?')
+							{
+								count++;
+							}
+						}
+
+
+						if (count != 3)
+						{
+							return "false";
+						}
+						else
+						{
+							break;
+						}
+					}
+				}
+			}
+		}
+	}
+
+	if (correctPair)
+	{
+		return "true";
+	}
+	else
+	{
+		return "false";
+	}
+	
+}
+
+int main() 
+{
+	cout << QuestionsMarks("arrb6???4xxbl5???eee5") << endl; // true
+	cout << QuestionsMarks("acc?7??sss?3rr1??????5") << endl; // true
+	cout << QuestionsMarks("aa6?9") << endl; // false
+	return 0;
+}

63_CamelCase.cpp

@@ -0,0 +1,50 @@
+// For this challenge you will be converting a string into camel case format.
+/*
+have the function CamelCase(str) take the str parameter being passed and return it in proper camel case format where the first letter of each word is capitalized (excluding the first letter). The string will only contain letters and some combination of delimiter punctuation characters separating each word.
+
+For example: if str is "BOB loves-coding" then your program should return the string bobLovesCoding.
+*/
+
+#include <iostream>
+#include <string>
+using namespace std;
+
+/*
+iterate through string
+make the first word lowercase
+locate any punctuations as a signal to Capitalize the first letter of each word
+*/
+
+string CamelCase(string str) 
+{
+	for (int x = 0; x < str.size(); x++)
+	{
+		if (x == 0)
+		{
+			str[x] = tolower(str[x]);
+			continue;
+		}
+
+		if (int(str[x-1]) >= 32 && int(str[x-1]) <= 47)
+		{
+			str[x] = toupper(str[x]);
+			str.erase(str.begin() + x-1);
+			x--;
+
+		}
+		else
+		{
+			str[x] = tolower(str[x]);
+		}
+	}
+
+	return str;
+}
+
+int main() 
+{
+	cout << CamelCase("BOB loves-coding") << endl; //bobLovesCoding
+	cout << CamelCase("cats AND*Dogs-are Awesome") << endl; // catsAndDogsAreAwesome
+	cout << CamelCase("a b c d-e-f%g") << endl; // aBCDEFG
+	return 0;
+}

64_SumMultiplier.cpp

@@ -0,0 +1,51 @@
+// For this challenge you will determine if two numbers can be multiplied to some specific number.
+/*
+have the function SumMultiplier(arr) take the array of numbers stored in arr and return the string true if any two numbers can be multiplied so that the answer is greater than double the sum of all the elements in the array. If not, return the string false. For example: if arr is [2, 5, 6, -6, 16, 2, 3, 6, 5, 3] then the sum of all these elements is 42 and doubling it is 84. There are two elements in the array, 16 * 6 = 96 and 96 is greater than 84, so your program should return the string true.
+*/
+
+#include <iostream>
+#include <string>
+using namespace std;
+
+/*
+find the total sum
+double the sum
+analyze if any 2 numbers are greater than double sum
+*/
+
+string SumMultiplier(int arr[], int size)
+{
+	int total = 0;
+	
+	for (int x = 0; x < size; x++)
+	{
+		total += arr[x];
+	}
+
+	total *= 2;
+
+	for (int x = 0; x < size - 1; x++)
+	{
+		for (int y = x + 1; y < size; y++)
+		{
+			if (arr[x]*arr[y] > total)
+			{
+				return "true";
+			}
+		}
+	}
+
+	return "false";
+}
+
+
+int main() 
+{
+	int A[] = { 2, 5, 6, -6, 16, 2, 3, 6, 5, 3 };
+	int B[] = { 2, 2, 2, 2, 4, 1 };
+	int C[] = { 1, 1, 2, 10, 3, 1, 12 };
+	cout << SumMultiplier(A, sizeof(A) / sizeof(A[0])) << endl; // true
+	cout << SumMultiplier(B, sizeof(B) / sizeof(B[0])) << endl; // false
+	cout << SumMultiplier(C, sizeof(C) / sizeof(C[0])) << endl; // true
+	return 0;
+}

65_StringMerge.cpp

@@ -0,0 +1,39 @@
+// For this challenge you will be merging two different strings together.
+/*
+have the function StringMerge(str) read the str parameter being passed which will contain a large string of alphanumeric characters with a single asterisk character splitting the string evenly into two separate strings. Your goal is to return a new string by pairing up the characters in the corresponding locations in both strings. For example: if str is "abc1*kyoo" then your program should return the string akbyco1o because a pairs with k, b pairs with y, etc. The string will always split evenly with the asterisk in the center.
+*/
+
+#include <iostream>
+#include <string>
+using namespace std;
+
+/*
+split the string into 2
+after combine the 2 strings into one doing a step by step merge alternating between the 2
+*/
+
+string StringMerge(string str) 
+{
+	int middle = str.find("*");
+
+	string first = str.substr(0, middle);
+	string second = str.substr(middle+1, str.size() - middle);
+	string result;
+
+	for (int x = 0; x < middle; x++)
+	{
+		result.push_back(first[x]);
+		result.push_back(second[x]);
+	}
+
+	return result;
+}
+
+int main() 
+{
+	cout << StringMerge("abc1*kyoo") << endl; // akbyco1o
+	cout << StringMerge("aaa*bbb") << endl; // ababab
+	cout << StringMerge("123hg*aaabb") << endl; // 1a2a3ahbgb
+	return 0;
+
+}

66_SimpleEvens.cpp

@@ -0,0 +1,42 @@
+//  For this challenge you will be checking whether a number is even.
+/*
+have the function SimpleEvens(num) check whether every single number passed in parameter is even. If so, return the string true, otherwise return the string false. For example: if num is 4602225 your program should return the string false because 5 is not an even number.
+*/
+
+#include <iostream>
+#include <string>
+using namespace std;
+
+
+/*
+take the input number at the start and check if is even
+If so continue breaking that number down by multiplying by .1
+After each iteration check if is even
+This will check all the digits of the input
+*/
+
+
+string SimpleEvens(long long num) 
+{
+	while (num > 0)
+	{
+		if (num % 2 == 0)
+		{
+			num *= .1;
+		}
+		else
+		{
+			return "false";
+		}
+	}
+	return "true";
+}
+
+int main() 
+{
+	cout << SimpleEvens(4602225) << endl; // false
+	cout << SimpleEvens(2222220222) << endl; // true
+	cout << SimpleEvens(20864646452) << endl; // false
+	return 0;
+
+}

67_OneDecremented.cpp

@@ -0,0 +1,39 @@
+// For this challenge you will be counting how many times a specific pattern occurs in a large number.
+/*
+have the function OneDecremented(num) count how many times a digit appears that is exactly one less than the previous digit. For example: if num is 5655984 then your program should return 2 because 5 appears directly after 6 and 8 appears directly after 9. The input will always contain at least 1 digit.
+*/
+
+#include <iostream>
+#include <string>
+#include <sstream>
+using namespace std;
+
+int OneDecremented(long long num)
+{
+	stringstream convert;
+	convert << num;
+	string number = convert.str();
+
+	int count = 0;
+	for (int x = 0; x < number.size(); x++)
+	{
+		if (x > 0)
+		{
+			if (int(number[x-1]) - int(number[x]) == 1)
+			{
+				count++;
+			}
+		}
+	}
+
+	return count;
+}
+
+int main() 
+{
+	cout << OneDecremented(5655984) << endl; // 2
+	cout << OneDecremented(9876541110) << endl; // 6
+	cout << OneDecremented(56) << endl; // 0
+	return 0;
+
+}