Initial commit

Author: mdanilov

.gitignore

@@ -0,0 +1,2 @@
+build
+.vscode

.gitmodules

@@ -0,0 +1,4 @@
+[submodule "extern/googletest"]
+	path = extern/googletest
+	url = ../../google/googletest.git
+	branch = release-1.10.0

CMakeLists.txt

@@ -0,0 +1,15 @@
+cmake_minimum_required(VERSION 3.10)
+project(CrackingCoding)
+list(APPEND CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/cmake)
+
+enable_testing()
+include(GoogleTest)
+include(PackageAddTest)
+
+add_subdirectory("${PROJECT_SOURCE_DIR}/extern/googletest")
+
+file(GLOB files "src/**/*.cpp")
+foreach(file ${files})
+  get_filename_component(exec_name ${file} NAME_WE)
+  package_add_test(${exec_name} ${file})
+endforeach()

cmake/PackageAddTest.cmake

@@ -0,0 +1,15 @@
+macro(package_add_test TESTNAME)
+    # create an exectuable in which the tests will be stored
+    add_executable(${TESTNAME} ${ARGN})
+    # link the Google test infrastructure, mocking library, and a default main fuction to
+    # the test executable.  Remove gtest_main if writing your own main function.
+    target_link_libraries(${TESTNAME} gtest gmock gtest_main)
+    # gtest_discover_tests replaces gtest_add_tests,
+    # see https://cmake.org/cmake/help/v3.10/module/GoogleTest.html for more options to pass to it
+    gtest_discover_tests(${TESTNAME}
+        # set a working directory so your project root so that you can find test data via paths relative to the project root
+        WORKING_DIRECTORY ${PROJECT_DIR}
+        PROPERTIES VS_DEBUGGER_WORKING_DIRECTORY "${PROJECT_DIR}"
+    )
+    set_target_properties(${TESTNAME} PROPERTIES FOLDER tests)
+endmacro()

extern/googletest

@@ -0,0 +1,15 @@
+// URLify: Write a method to replace all spaces in a string with '%20: You may assume that the string
+// has sufficient space at the end to hold the additional characters, and that you are given the "true"
+// length of the string. (Note: If implementing in Java, please use a character array so that you can
+// perform this operation in place.)
+//
+// EXAMPLE
+// Input: "Mr John Smith "J 13
+// Output: "Mr%20J ohn%20Smith"
+//
+// Hints: #53, #118
+
+int main(int ac, char **av) {
+
+  return 0;
+}

src/arrays_strings/URLify.cpp

@@ -0,0 +1,61 @@
+// Check Permutation: Given two strings, write a method to decide if one is a
+// permutation of the other.
+//
+// Hints: #1, #84, #722, #737
+
+#include <algorithm>
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+// ------------------------------------------------------------------------------------------------
+
+string sort(const string &s) {
+  string sort_s(s);
+  sort(sort_s.begin(), sort_s.end());
+  return sort_s;
+}
+
+bool permutation_1(const string &s, const string &t) {
+  if (s.length() != t.length()) {
+    return false;
+  }
+  return sort(s) == sort(t);
+}
+
+// ------------------------------------------------------------------------------------------------
+
+bool permutation_2(const string &s, const string &t) {
+  if (s.length() != t.length()) {
+    return false;
+  }
+
+  int letters[128] = {0};
+  for (const char &c : s) {
+    letters[c]++;
+  }
+
+  for (int i = 0; i < t.length(); ++i) {
+    char c = t[i];
+    letters[c]--;
+    if (letters[c] < 0) {
+      return false;
+    }
+  }
+
+  return true;
+}
+
+// ------------------------------------------------------------------------------------------------
+
+#include "gtest/gtest.h"
+
+TEST(PermutationTest, Trivial) {
+
+  EXPECT_TRUE(permutation_1("abcd", "dcba"));
+  EXPECT_FALSE(permutation_1("abcd", "daba"));
+
+  EXPECT_TRUE(permutation_2("abcd", "dcba"));
+  EXPECT_FALSE(permutation_2("abcd", "daba"));
+}

src/arrays_strings/check_permutation.cpp

@@ -0,0 +1,53 @@
+// Is Unique: Implement an algorithm to determine if a string has all unique
+// characters. What if you cannot use additional data structures?
+//
+// Hints: #44, #117, #132
+
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+// ------------------------------------------------------------------------------------------------
+
+bool isUniqueChars_1(const string& str) {
+  if (str.length() > 128)
+    return false;
+
+  bool char_set[128];
+  for (int i = 0; i < str.length(); ++i) {
+    int val = str[i];
+    if (char_set[val]) {
+      return false;
+    }
+    char_set[val] = true;
+  }
+  return true;
+}
+
+// ------------------------------------------------------------------------------------------------
+
+bool isUniqueChars_2(const string& str) {
+  int checker = 0;
+  for (int i = 0; i < str.length(); ++i) {
+    int val = str[i] - 'a';
+    if ((checker & (1 << val)) > 0) {
+      return false;
+    }
+    checker |= (1 << val);
+  }
+  return true;
+}
+
+// ------------------------------------------------------------------------------------------------
+
+#include "gtest/gtest.h"
+
+TEST(IsUniqueTest, Trivial) {
+
+  EXPECT_TRUE(isUniqueChars_1("abcd"));
+  EXPECT_FALSE(isUniqueChars_1("abcc"));
+
+  EXPECT_TRUE(isUniqueChars_2("abcd"));
+  EXPECT_FALSE(isUniqueChars_2("abcc"));
+}

src/arrays_strings/is_unique.cpp

@@ -0,0 +1,16 @@
+// One Away: There are three types of edits that can be performed on strings: insert a character,
+// remove a character, or replace a character. Given two strings, write a function to check if they are
+// one edit (or zero edits) away.
+//
+// EXAMPLE
+// pale, ple -> true
+// pales, pale -> true
+// pale, bale -> true
+// pale, bake -> false
+//
+// Hints: #23, #97, #130
+
+int main(int ac, char **av) {
+
+  return 0;
+}

src/arrays_strings/one_away.cpp

@@ -0,0 +1,13 @@
+// Palindrome Permutation: Given a string, write a function to check if it is a permutation of a palindrome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation
+// is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words.
+//
+// EXAMPLE
+// Input: Tact Coa
+// Output: True (permutations: "taco cat". "atco cta". etc.)
+//
+// Hints: #106, #121, #134, #136
+
+int main(int ac, char **av) {
+
+  return 0;
+}

src/arrays_strings/palindrome_permutation.cpp

@@ -0,0 +1,9 @@
+// Rotate Matrix: Given an image represented by an NxN matrix, where each pixel in the image is 4
+// bytes, write a method to rotate the image by 90 degrees. (an you do this in place?
+//
+// Hints: #51, #100
+
+int main(int ac, char **av) {
+
+  return 0;
+}

src/arrays_strings/rotate_matrix.cpp

@@ -0,0 +1,11 @@
+// String Compression: Implement a method to perform basic string compression using the counts
+// of repeated characters. For example, the string aabcccccaaa would become a2b1c5a3. If the
+// "compressed" string would not become smaller than the original string, your method should return
+// the original string. You can assume the string has only uppercase and lowercase letters (a - z).
+//
+// Hints: #92, #110
+
+int main(int ac, char **av) {
+
+  return 0;
+}

src/arrays_strings/string_compression.cpp

@@ -0,0 +1,10 @@
+// String Rotation: Assume you have a method isSubst ring which checks if one word is a substring
+// of another. Given two strings, 51 and 52, write code to check if 52 is a rotation of 51 using only one
+// call to isSubstring (e.g., "waterbottle" is a rotation of"erbottlewat").
+//
+// Hints: #34, #88, #104
+
+int main(int ac, char **av) {
+
+  return 0;
+}

src/arrays_strings/string_rotation.cpp

@@ -0,0 +1,9 @@
+// Zero Matrix: Write an algorithm such that if an element in an MxN matrix is 0, its entire row and
+// column are set to O.
+//
+// Hints: #17, #74, #102
+
+int main(int ac, char **av) {
+
+  return 0;
+}