GH-169: Solve leetcode 211

collections/leetcode/README.md

@@ -240,7 +240,7 @@
 <td>209</td>
 <td>210</td>
 <tr>
-<td>211</td>
+<td>🟡&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode211'>211</a></td>
 <td>212</td>
 <td>213</td>
 <td>214</td>

collections/leetcode/data.yaml

@@ -70,6 +70,9 @@ problems:
 - name: 208
   languages: cpp
   level: medium
+- name: 211
+  languages: cpp
+  level: medium
 - name: 217
   languages: cpp
   level: easy

collections/leetcode/generate_readme.py

@@ -17,7 +17,7 @@
     id = int(item['name'])
     problems[id] = item
     solved_problems.add(id)
-print(f"Solve {len(solved_problems)} problems")
+print(f"Leetcode: {len(solved_problems)} problems solved.")
 
 table = ""
 table = "<table>\n<tr>"

problems/leetcode211/.gitignore

@@ -0,0 +1,2 @@
+solution
+*.dSYM

problems/leetcode211/README.md

@@ -0,0 +1,19 @@
+# Leetcode Problem 
+
+## Usage
+
+Run program with an example
+
+```
+bazel run cpp/main:solution < data/1.in
+```
+
+Test program
+
+```
+# Run all tests
+bazel test --test_output=all tests:solution_test
+bazel test --test_output=all --cache_test_results=no tests:solution_test
+# Run test with pecific test id
+bazel test --test_output=all tests:solution_test --test_arg=1
+```

problems/leetcode211/cpp/main/BUILD

@@ -0,0 +1,7 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary")
+
+cc_binary(
+    name = "solution",
+    srcs = ["solution.cpp", "solution.h"],
+    visibility = ["//visibility:public"],
+)

problems/leetcode211/cpp/main/solution.cpp

@@ -0,0 +1,41 @@
+#include "solution.h"
+
+#include <algorithm>
+#include <cmath>
+#include <iostream>
+#include <map>
+#include <string>
+#include <vector>
+#include <fstream>
+
+using namespace std;
+
+int main() {
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+
+  bool is_use_file = false;
+
+  filesystem::path filepath =
+      filesystem::current_path().parent_path().parent_path() / "data" / "1.in";
+  ifstream file(filepath);
+
+  if (is_use_file) {
+    cin.rdbuf(file.rdbuf());  // redirect cin to file
+  }
+
+  // get input and print output
+  WordDictionary* obj = new WordDictionary();
+  cout << "Insert bad" << endl;
+  obj->addWord("bad");
+  cout << "Insert dad" << endl;
+  obj->addWord("dad");
+  cout << "Insert mad" << endl;
+  obj->addWord("mad");
+  cout << "Search pad: " << obj->search("pad") << endl;
+  cout << "Search bad: " << obj->search("bad") << endl;
+  cout << "Search .ad: " << obj->search(".ad") << endl;
+  cout << "Search b..: " << obj->search("b..") << endl;
+
+  return 0;
+}

problems/leetcode211/cpp/main/solution.h

@@ -0,0 +1,79 @@
+#include <algorithm>
+#include <cmath>
+#include <map>
+#include <set>
+#include <string>
+#include <unordered_map>
+#include <vector>
+#include <stack>
+#include <queue>
+
+using namespace std;
+
+class WordDictionary {
+private:
+    struct TrieNode {
+        char val;
+        TrieNode* children[26];
+        bool isEnd;
+        TrieNode() {
+            for(int i=0; i<26; i++){
+                children[i] = NULL;
+            }
+            isEnd = false;
+        }
+    };
+    TrieNode* root;
+
+public:
+    WordDictionary() {
+        root = new TrieNode();
+    }
+
+    void addWord(string word) {
+        TrieNode* current = root;
+        for(auto c: word){
+            int index = c - 'a';
+            if(current->children[index] == NULL){
+                current->children[index] = new TrieNode();
+            }
+            current = current->children[index];
+        }
+        current->isEnd = true;
+    }
+
+    bool dfs(string word, int i, TrieNode* node){
+        if(i == word.size()){
+            return node->isEnd;
+        }
+
+        char c = word[i];
+        if(c == '.'){
+            for(int index=0; index<26; index++){
+                if(node->children[index] != NULL){
+                    TrieNode* current = node->children[index];
+                    if(dfs(word, i+1, current)){
+                        return true;
+                    }
+                }
+            }
+            return false;
+        }
+        int index = c - 'a';
+        if(node->children[index] == NULL){
+            return false;
+        }
+        return dfs(word, i+1, node->children[index]);
+    }
+
+    bool search(string word) {
+        return dfs(word, 0, root);
+    }
+};
+
+/**
+ * Your WordDictionary object will be instantiated and called as such:
+ * WordDictionary* obj = new WordDictionary();
+ * obj->addWord(word);
+ * bool param_2 = obj->search(word);
+ */

problems/leetcode211/cpp/tests/BUILD

@@ -0,0 +1,11 @@
+load("@rules_cc//cc:defs.bzl", "cc_binary", "cc_test")
+
+cc_test(
+    name = "solution_test",
+    srcs = ["solution_test.cpp"],
+    deps = [
+      "//problems/codeforcesAA/src/main:solution",
+      "@com_google_googletest//:gtest_main",
+    ],
+    data = ["data"]
+)

problems/leetcode211/cpp/tests/solution_test.cpp

@@ -0,0 +1,97 @@
+#include <cstdlib>
+#include <filesystem>
+#include <fstream>
+#include <iostream>
+#include <string>
+#include <string_view>
+#include <vector>
+
+#include "gtest/gtest.h"
+
+namespace fs = std::filesystem;
+
+using namespace std;
+
+std::string TEST_ID = "";
+
+vector<string> split(string s, string delimiter) {
+  size_t pos_start = 0, pos_end, delim_len = delimiter.length();
+  string token;
+  vector<string> res;
+
+  while ((pos_end = s.find(delimiter, pos_start)) != string::npos) {
+    token = s.substr(pos_start, pos_end - pos_start);
+    pos_start = pos_end + delim_len;
+    res.push_back(token);
+  }
+
+  res.push_back(s.substr(pos_start));
+  return res;
+}
+
+std::string GetHello(std::string_view in) {
+  if (in.size() == 0) {
+    return std::string("hello, word");
+  } else {
+    return std::string("Hello, ") + in.data();
+  }
+}
+
+string ReadFile(const std::string &filename) {
+  std::ifstream f(filename);
+  string s((std::istreambuf_iterator<char>(f)),
+           std::istreambuf_iterator<char>());
+  return s;
+}
+
+vector<string> RunProgram(string fileid) {
+  vector<string> v;
+  string program = "problems/codeforcesAA/src/main/solution";
+  string test_folder = "problems/codeforcesAA/tests/data/";
+  string command = program + " < " + test_folder + fileid + ".in > output.txt";
+  std::system(command.c_str());
+  string actual = ReadFile("output.txt");
+  string expectedOutputFile = test_folder + fileid + ".out";
+  string expected = ReadFile(expectedOutputFile);
+  v.push_back(actual);
+  v.push_back(expected);
+  return v;
+}
+
+TEST(RunTest, AllTestCases) {
+  if (TEST_ID != "") {
+    std::cout << "TEST_ID = " << TEST_ID << std::endl;
+  } else {
+    std::cout << "RUN ALL TESTS" << std::endl;
+  }
+
+  std::string test_data_folder = "problems/codeforcesAA/tests/data";
+  for (const auto &entry : fs::directory_iterator(test_data_folder)) {
+    string filename = split(entry.path(), "/").back();
+    vector<string> v = split(filename, ".");
+    string fileid = v[0];
+    string extension = v[1];
+    if (extension != "in"){
+      continue;
+    }
+    if (TEST_ID != ""){
+      if (fileid != TEST_ID){
+        continue;
+      }
+    }
+    // Run Test Case
+    vector<string> output = RunProgram(fileid);
+    string actual = output[0];
+    string expected = output[1];
+    string message = "❌ FAIL CASE: " + fileid;
+    ASSERT_EQ(actual, expected) << message;
+  }
+}
+
+int main(int argc, char **argv) {
+  ::testing::InitGoogleTest(&argc, argv);
+  if (argc == 2) {
+    TEST_ID = argv[1];
+  }
+  return RUN_ALL_TESTS();
+}

problems/leetcode211/data/1.in

@@ -0,0 +1 @@
+5

problems/leetcode211/data/1.out

@@ -0,0 +1,5 @@
+4
+3
+2
+1
+0

problems/leetcode211/data/2.in

@@ -0,0 +1 @@
+10

problems/leetcode211/data/2.out

@@ -0,0 +1,10 @@
+9
+8
+7
+6
+5
+4
+3
+2
+1
+0

problems/leetcode211/data/3.in

@@ -0,0 +1 @@
+3

problems/leetcode211/data/3.out

@@ -0,0 +1,3 @@
+2
+1
+0

problems/leetcode211/problem_infos.json

@@ -0,0 +1,9 @@
+{
+  "name": "Leetcode 78. Subsets",
+  "link": "https://leetcode.com/problems/subsets/",
+  "tags": [
+    "Array",
+    "Backtracking",
+    "Bit Manipulation"
+  ]
+}