update

Author: Carlos Leonard

73_ClosestEnemy2.cpp

@@ -16,6 +16,9 @@ For this input your program should return 2 because the closest enemy (2) is 2 s
 using namespace std;
 
 /*
+NOT FINISHED
+
+
 locate starting point
 check if the matrix has any enemies
 */

75_StringPeriods.cpp

@@ -0,0 +1,73 @@
+// For this challenge you will need to find the smallest repeating substring.
+/*
+have the function StringPeriods(str) take the str parameter being passed and determine if there is some substring K that can be repeated N > 1 times to produce the input string exactly as it appears. Your program should return the longest substring K, and if there is none it should return the string -1.
+
+For example: if str is "abcababcababcab" then your program should return abcab because that is the longest substring that is repeated 3 times to create the final string. Another example: if str is "abababababab" then your program should return ababab because it is the longest substring. If the input string contains only a single character, your program should return the string -1.
+*/
+
+#include <iostream>
+#include <string>
+using namespace std;
+
+/*
+traverse the string
+extract a substring from the string starting from the beginning
+keep count of its length only if the substring can produce the input string after being repeated
+iterate again but increasing the substring length
+*/
+string StringPeriods(string str) 
+{
+	if (str.length() == 1)
+	{
+		return "-1";
+	}
+
+	string substring = "";
+	string result = "";
+	int current = 0;
+
+	// Loop to traverse input string and compare substring
+	while (current < str.length() / 2)
+	{
+		bool valid = true; // signal checking if the substring can complete the input string after repetitions
+		substring += str[current]; // With each iteration the substring to check will increase
+
+		for (int x = current + 1; x < str.length(); x+=substring.length())
+		{
+			// condition comparing the current substring to substring in our input string
+			// If is not equal than this current substring is invalid
+			if (substring != str.substr(x, substring.length()))
+			{
+				valid = false;
+				break;
+			}
+		}
+
+		// Will update the largest substring that is valid
+		if (valid && substring.length() > result.length())
+		{
+			result = substring;
+		}
+
+		current++;
+	}
+
+	if (result.length() >= 1)
+	{
+		return result;
+	}
+	else
+	{
+		return "-1";
+	}
+}
+
+int main() 
+{
+	cout << StringPeriods("abcababcababcab") << endl; // abcab
+	cout << StringPeriods("abcxabc") << endl; // -1
+	cout << StringPeriods("affedaaffed") << endl; // -1
+	cout << StringPeriods("abababababab") << endl; // ababab
+	cout << StringPeriods("gg") << endl; // g
+	return 0;
+}

76_NumberStream.cpp

@@ -0,0 +1,64 @@
+// For this challenge you will determine if a stream of digits occurs in a string.
+/*
+have the function NumberStream(str) take the str parameter being passed which will contain the numbers 2 through 9, and determine if there is a consecutive stream of digits of at least N length where N is the actual digit value. If so, return the string true, otherwise return the string false. For example: if str is "6539923335" then your program should return the string true because there is a consecutive stream of 3's of length 3. The input string will always contain at least one digit.
+*/
+
+#include <iostream>
+#include <string>
+using namespace std;
+
+/*
+traverse the string
+have a temp string that will increase if values are consecutive
+if the next value is not the same as current consecutive values
+break and analyze the length of the temp string
+if the length matches the digit value than return true
+else continue until the string has been fully traversed
+*/
+string NumberStream(string str) 
+{
+	if (str.length() == 1)
+	{
+		return "false";
+	}
+
+	string temp = "";
+	temp += str[0];
+
+	for (int x = 1; x < str.length(); x++)
+	{
+		if (temp.empty())
+		{
+			temp.push_back(str[x]);
+			continue;
+		}
+
+		// If values are the same than add it to temp string
+		if (str[x] == temp[0])
+		{
+			temp += str[x];
+		}
+		else
+		{
+			// clear the temp string
+			temp.clear();
+		}
+
+		// condition to analyze length of temp string
+		// if length matches the consecutive values than it is valid
+		if (temp.length() > 1 && char(temp.length() + 48) == temp[0])
+		{
+			return "true";
+		}
+	}
+
+	return "false";
+}
+
+int main() 
+{
+	cout << NumberStream("5556293383563665") << endl; // false
+	cout << NumberStream("5788888888882339999") << endl; // true
+	cout << NumberStream("6539923335") << endl; // true
+	return 0;
+}

77_PalindromeSwapper.cpp

@@ -0,0 +1,65 @@
+// For this challenge you will determine if a palindrome can be created in a string.
+/*
+have the function PalindromeSwapper(str) take the str parameter being passed and determine if a palindrome can be created by swapping two adjacent characters in the string. If it is possible to create a palindrome, then your program should return the palindrome, if not then return the string -1. The input string will only contain alphabetic characters. For example: if str is "rcaecar" then you can create a palindrome by swapping the second and third characters, so your program should return the string racecar which is the final palindromic string.
+*/
+
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+
+/*
+traverse the string 
+continue to swap adjacent characters and check if string is a palindrome
+*/
+bool palindrome(string value)
+{
+	string temp = value;
+
+	reverse(temp.begin(), temp.end());
+
+	if (temp == value)
+	{
+		return true;
+	}
+
+	return false;
+}
+
+string PalindromeSwapper(string str) 
+{
+	// in case original input is already a palindrome
+	if (palindrome(str))
+	{
+		return str;
+	}
+
+	// traversing the string
+	for (int x = 0; x < str.length()-1; x++)
+	{
+		// swap current adjacent characters
+		swap(str[x], str[x + 1]);
+
+		// check if string is now a palindrome
+		if (palindrome(str))
+		{
+			return str;
+		}
+		else
+		{
+			// if not valid swap again to set back to the original
+			swap(str[x], str[x + 1]);
+		}
+	}
+
+	return "-1";
+}
+
+int main() 
+{
+	cout << PalindromeSwapper("anna") << endl; // anna
+	cout << PalindromeSwapper("kyaak") << endl; // kayak
+	cout << PalindromeSwapper("rcaecar") << endl; // racecar
+	cout << PalindromeSwapper("madam") << endl; 
+	return 0;
+}

Debug/Fun Practice.log

@@ -1,14 +1,14 @@
-Build started 4/13/2017 1:04:49 PM.
+Build started 7/31/2017 5:46:24 PM.
      1>Project "C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Fun Practice\Fun Practice.vcxproj" on node 2 (Build target(s)).
      1>ClCompile:
-         C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\bin\CL.exe /c /ZI /nologo /W3 /WX- /sdl /Od /Oy- /D WIN32 /D _DEBUG /D _CONSOLE /D _LIB /D _UNICODE /D UNICODE /Gm /EHsc /RTC1 /MDd /GS /fp:precise /Zc:wchar_t /Zc:forScope /Fo"Debug\\" /Fd"Debug\vc120.pdb" /Gd /TP /analyze- /errorReport:prompt 74_SerialNumber.cpp
-         74_SerialNumber.cpp
-     1>c:\users\gutty333\documents\visual studio 2013\projects\fun practice\fun practice\74_serialnumber.cpp(35): warning C4018: '<' : signed/unsigned mismatch
+         C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\bin\CL.exe /c /ZI /nologo /W3 /WX- /sdl /Od /Oy- /D WIN32 /D _DEBUG /D _CONSOLE /D _LIB /D _UNICODE /D UNICODE /Gm /EHsc /RTC1 /MDd /GS /fp:precise /Zc:wchar_t /Zc:forScope /Fo"Debug\\" /Fd"Debug\vc120.pdb" /Gd /TP /analyze- /errorReport:prompt 77_PalindromeSwapper.cpp
+         77_PalindromeSwapper.cpp
+     1>c:\users\gutty333\documents\visual studio 2013\projects\fun practice\fun practice\77_palindromeswapper.cpp(38): warning C4018: '<' : signed/unsigned mismatch
        Link:
-         C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\bin\link.exe /ERRORREPORT:PROMPT /OUT:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.exe" /INCREMENTAL /NOLOGO kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /MANIFEST /MANIFESTUAC:"level='asInvoker' uiAccess='false'" /manifest:embed /DEBUG /PDB:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.pdb" /SUBSYSTEM:CONSOLE /TLBID:1 /DYNAMICBASE /NXCOMPAT /IMPLIB:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.lib" /MACHINE:X86 Debug\74_SerialNumber.obj
+         C:\Program Files (x86)\Microsoft Visual Studio 12.0\VC\bin\link.exe /ERRORREPORT:PROMPT /OUT:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.exe" /INCREMENTAL /NOLOGO kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /MANIFEST /MANIFESTUAC:"level='asInvoker' uiAccess='false'" /manifest:embed /DEBUG /PDB:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.pdb" /SUBSYSTEM:CONSOLE /TLBID:1 /DYNAMICBASE /NXCOMPAT /IMPLIB:"C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.lib" /MACHINE:X86 Debug\77_PalindromeSwapper.obj
          Fun Practice.vcxproj -> C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Debug\Fun Practice.exe
      1>Done Building Project "C:\Users\gutty333\Documents\Visual Studio 2013\Projects\Fun Practice\Fun Practice\Fun Practice.vcxproj" (Build target(s)).
 
 Build succeeded.
 
-Time Elapsed 00:00:03.87
+Time Elapsed 00:00:01.33