GH-169: Solve leetcode 2360, 2492, 1319, 1466, 2316 (#276)

Author: rain1024

collections/leetcode/README.md

@@ -46,7 +46,7 @@
 <td>32</td>
 <td>33</td>
 <td>34</td>
-<td>35</td>
+<td>🟢&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode35'>35</a></td>
 <td>🟡&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode36'>36</a></td>
 <td>37</td>
 <td>38</td>
@@ -1458,7 +1458,7 @@
 <td>1316</td>
 <td>1317</td>
 <td>1318</td>
-<td>1319</td>
+<td>🟡&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode1319'>1319</a></td>
 <td>1320</td>
 <tr>
 <td>1321</td>
@@ -1620,7 +1620,7 @@
 <td>1463</td>
 <td>1464</td>
 <td>1465</td>
-<td>1466</td>
+<td>🟡&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode1466'>1466</a></td>
 <td>1467</td>
 <td>1468</td>
 <td>1469</td>
@@ -2555,7 +2555,7 @@
 <td>2313</td>
 <td>2314</td>
 <td>2315</td>
-<td>2316</td>
+<td>🟡&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode2316'>2316</a></td>
 <td>2317</td>
 <td>2318</td>
 <td>2319</td>
@@ -2603,7 +2603,7 @@
 <td>2357</td>
 <td>2358</td>
 <td>2359</td>
-<td>2360</td>
+<td>🔴&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode2360'>2360</a></td>
 <tr>
 <td>2361</td>
 <td>2362</td>
@@ -2749,7 +2749,7 @@
 <td>2490</td>
 <tr>
 <td>2491</td>
-<td>2492</td>
+<td>🟡&nbsp;<a href='https://github.com/rain1024/datastructures-algorithms-competitive-programming/tree/main/problems/leetcode2492'>2492</a></td>
 <td>2493</td>
 <td>2494</td>
 <td>2495</td>

collections/leetcode/data.yaml

@@ -24,6 +24,9 @@ problems:
 - name: 27
   languages: python
   level: easy
+- name: 35
+  languages: python
+  level: easy
 - name: 36
   languages: cpp
   level: medium
@@ -124,15 +127,30 @@ problems:
 - name: 958
   languages: cpp
   level: medium
+- name: 1319
+  languages: cpp
+  level: medium
+- name: 1466
+  languages: cpp
+  level: medium
 - name: 1472
   languages: cpp
   level: medium
 - name: 1480
   languages: cpp
   level: easy
+- name: 2316
+  languages: cpp
+  level: medium
 - name: 2348
   languages: cpp
   level: medium
+- name: 2360
+  languages: cpp
+  level: hard
+- name: 2492
+  languages: cpp
+  level: medium
 - name: 2574
   languages: cpp
   level: easy

problems/leetcode1319/.gitignore

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

problems/leetcode1319/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/leetcode1319/cpp/main/BUILD

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

problems/leetcode1319/cpp/main/helpers.h

@@ -0,0 +1,59 @@
+#pragma once
+
+#include <string>
+#include <vector>
+#include <iostream>
+#include <stack>
+#include <queue>
+
+using namespace std;
+
+/* Temmplate class T should be a Nary Tree Node
+ * See leetcode 589 (https://leetcode.com/problems/n-ary-tree-preorder-traversal/description/)
+ * class Node {
+ *  public:
+ *   int val;
+ *   vector<Node*> children;
+ * 
+ *   Node() {}
+ * 
+ *   Node(int _val) { val = _val; }
+ * 
+ *   Node(int _val, vector<Node*> _children) {
+ *     val = _val;
+ *     children = _children;
+ *   }
+ * };
+*/
+template <typename T> T* parse_nary_tree(vector<string> s) {
+  T* fake = new T();
+  T* current = fake;
+  queue<T*> q;
+  for(string e: s){
+    if(e == "null"){
+      current = q.front();
+      q.pop();
+    } else {
+      T* child = new T(stoi(e));
+      q.push(child);
+      current->children.push_back(child);
+    }
+  }
+  return fake->children[0];
+}
+
+vector<string> parse_line(string line) {
+  vector<string> v;
+  string s;
+  for (char c : line) {
+    if (c == ' ') {
+      v.push_back(s);
+      s = "";
+    } else {
+      s += c;
+    }
+  }
+  v.push_back(s);
+  return v;
+}
+

problems/leetcode1319/cpp/main/solution.cpp

@@ -0,0 +1,50 @@
+#include "solution.h"
+#include "helpers.h"
+
+#include <algorithm>
+#include <cmath>
+#include <iostream>
+#include <map>
+#include <string>
+#include <vector>
+#include <fstream>
+#include <filesystem>
+
+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
+  int n;
+  cin >> n;
+
+  int e;
+  cin >> e;
+
+  vector<vector<int>> edges(e, vector<int>(2));
+  for (int i = 0; i < e; i++) {
+    for (int j = 0; j < 2; j++) {
+      cin >> edges[i][j];
+    }
+  }
+
+  Solution solution;
+  int output = solution.makeConnected(n, edges);
+
+  // print output
+  cout << output << endl;
+
+  return 0;
+}

problems/leetcode1319/cpp/main/solution.h

@@ -0,0 +1,52 @@
+#include <algorithm>
+#include <climits>
+#include <cmath>
+#include <map>
+#include <queue>
+#include <set>
+#include <stack>
+#include <string>
+#include <unordered_map>
+#include <vector>
+
+using namespace std;
+
+class Solution {
+ public:
+  int makeConnected(int n, vector<vector<int>>& connections) {
+    int e = connections.size();
+    if (e < n - 1) {
+      return -1;
+    }
+    vector<bool> visited(n, false);
+    vector<vector<int>> edges(n, vector<int>{});
+    int scc = 0;
+    for (auto connection : connections) {
+      int x = connection[0];
+      int y = connection[1];
+      edges[x].push_back(y);
+      edges[y].push_back(x);
+    }
+
+    queue<int> q;
+    for (int i = 0; i < n; i++) {
+      // bfs
+      if (!visited[i]) {
+        scc++;
+        q.push(i);
+        while (!q.empty()) {
+          int node = q.front();
+          q.pop();
+          if (visited[node]) continue;
+          visited[node] = true;
+          for (auto next : edges[node]) {
+            if (!visited[next]) {
+              q.push(next);
+            }
+          }
+        }
+      }
+    }
+    return scc - 1;
+  }
+};

problems/leetcode1319/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"]
+)