test: 2707 solution

py, go, c++

Author: QuBenhao

MODULE.bazel

@@ -17,7 +17,7 @@ new_local_repository = use_repo_rule("@bazel_tools//tools/build_defs/repo:local.
 new_local_repository(
     name = "problems",
     build_file = "//cpp:solution.BUILD",
-    path = "problems/problems_386/",
+    path = "problems/problems_2707/",
 )
 
 new_local_repository(

golang/solution_test.go

@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_386"
+	problem "leetCode/problems/problems_2707"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "386", "problems", problem.Solve)
+	TestEach(t, "2707", "problems", problem.Solve)
 }

problems/problems_2707/Solution.cpp

@@ -0,0 +1,43 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+#include <unordered_set>
+#include <vector>
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+    int minExtraChar(string s, vector<string>& dictionary) {
+        unordered_set<string> cache(dictionary.begin(), dictionary.end());
+        int n = s.size();
+        vector<int> dp(n + 1, 0);
+        for (int i = 0; i < n; ++i) {
+            dp[i + 1] = dp[i] + 1; // Assume the worst case: every character is an extra character
+            for (int j = 0; j <= i; ++j) {
+                string sub = s.substr(j, i - j + 1);
+                if (cache.find(sub) != cache.end()) {
+                    dp[i + 1] = min(dp[i + 1], dp[j]); // If the substring is in the dictionary, no extra character needed
+                }
+            }
+        }
+        return dp[n];
+    }
+};
+
+json leetcode::qubh::Solve(string input_json_values) {
+	vector<string> inputArray;
+	size_t pos = input_json_values.find('\n');
+	while (pos != string::npos) {
+		inputArray.push_back(input_json_values.substr(0, pos));
+		input_json_values = input_json_values.substr(pos + 1);
+		pos = input_json_values.find('\n');
+	}
+	inputArray.push_back(input_json_values);
+
+	Solution solution;
+	string s = json::parse(inputArray.at(0));
+	vector<string> dictionary = json::parse(inputArray.at(1));
+	return solution.minExtraChar(s, dictionary);
+}

problems/problems_2707/problem.md

@@ -0,0 +1,34 @@
+# 2707. Extra Characters in a String [Rating: 1735.85]
+
+<p>You are given a <strong>0-indexed</strong> string <code>s</code> and a dictionary of words <code>dictionary</code>. You have to break <code>s</code> into one or more <strong>non-overlapping</strong> substrings such that each substring is present in <code>dictionary</code>. There may be some <strong>extra characters</strong> in <code>s</code> which are not present in any of the substrings.</p>
+
+<p>Return <em>the <strong>minimum</strong> number of extra characters left over if you break up </em><code>s</code><em> optimally.</em></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;leetscode&quot;, dictionary = [&quot;leet&quot;,&quot;code&quot;,&quot;leetcode&quot;]
+<strong>Output:</strong> 1
+<strong>Explanation:</strong> We can break s in two substrings: &quot;leet&quot; from index 0 to 3 and &quot;code&quot; from index 5 to 8. There is only 1 unused character (at index 4), so we return 1.
+
+</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> s = &quot;sayhelloworld&quot;, dictionary = [&quot;hello&quot;,&quot;world&quot;]
+<strong>Output:</strong> 3
+<strong>Explanation:</strong> We can break s in two substrings: &quot;hello&quot; from index 3 to 7 and &quot;world&quot; from index 8 to 12. The characters at indices 0, 1, 2 are not used in any substring and thus are considered as extra characters. Hence, we return 3.
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>1 &lt;= s.length &lt;= 50</code></li>
+	<li><code>1 &lt;= dictionary.length &lt;= 50</code></li>
+	<li><code>1 &lt;= dictionary[i].length &lt;= 50</code></li>
+	<li><code>dictionary[i]</code>&nbsp;and <code>s</code> consists of only lowercase English letters</li>
+	<li><code>dictionary</code> contains distinct words</li>
+</ul>

problems/problems_2707/problem_zh.md

@@ -0,0 +1,33 @@
+# 2707. 字符串中的额外字符 [难度分: 1735.85]
+
+<p>给你一个下标从 <strong>0</strong>&nbsp;开始的字符串&nbsp;<code>s</code>&nbsp;和一个单词字典&nbsp;<code>dictionary</code>&nbsp;。你需要将&nbsp;<code>s</code>&nbsp;分割成若干个 <strong>互不重叠</strong>&nbsp;的子字符串，每个子字符串都在&nbsp;<code>dictionary</code>&nbsp;中出现过。<code>s</code>&nbsp;中可能会有一些&nbsp;<strong>额外的字符</strong>&nbsp;不在任何子字符串中。</p>
+
+<p>请你采取最优策略分割 <code>s</code>&nbsp;，使剩下的字符 <strong>最少</strong>&nbsp;。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><b>输入：</b>s = "leetscode", dictionary = ["leet","code","leetcode"]
+<b>输出：</b>1
+<b>解释：</b>将 s 分成两个子字符串：下标从 0 到 3 的 "leet" 和下标从 5 到 8 的 "code" 。只有 1 个字符没有使用（下标为 4），所以我们返回 1 。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><b>输入：</b>s = "sayhelloworld", dictionary = ["hello","world"]
+<b>输出：</b>3
+<b>解释：</b>将 s 分成两个子字符串：下标从 3 到 7 的 "hello" 和下标从 8 到 12 的 "world" 。下标为 0 ，1 和 2 的字符没有使用，所以我们返回 3 。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= s.length &lt;= 50</code></li>
+	<li><code>1 &lt;= dictionary.length &lt;= 50</code></li>
+	<li><code>1 &lt;= dictionary[i].length &lt;= 50</code></li>
+	<li><code>dictionary[i]</code>&nbsp;和&nbsp;<code>s</code>&nbsp;只包含小写英文字母。</li>
+	<li><code>dictionary</code>&nbsp;中的单词互不相同。</li>
+</ul>

problems/problems_2707/solution.go

@@ -0,0 +1,41 @@
+package problem2707
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func minExtraChar(s string, dictionary []string) int {
+	d := make(map[string]bool, len(dictionary))
+	for _, word := range dictionary {
+		d[word] = true
+	}
+	n := len(s)
+	dp := make([]int, n+1)
+	for i := 0; i < n; i++ {
+		dp[i+1] = dp[i] + 1 // assume the next character is an extra character
+		for j := 0; j <= i; j++ {
+			if d[s[j:i+1]] {
+				// if the substring s[j:i+1] is in the dictionary, then we can remove it
+				dp[i+1] = min(dp[i+1], dp[j])
+			}
+		}
+	}
+	return dp[n]
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var s string
+	var dictionary []string
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &s); err != nil {
+		log.Fatal(err)
+	}
+	if err := json.Unmarshal([]byte(inputValues[1]), &dictionary); err != nil {
+		log.Fatal(err)
+	}
+
+	return minExtraChar(s, dictionary)
+}

problems/problems_2707/solution.py

@@ -0,0 +1,18 @@
+import solution
+from typing import *
+
+
+class Solution(solution.Solution):
+    def solve(self, test_input=None):
+        return self.minExtraChar(*test_input)
+
+    def minExtraChar(self, s: str, dictionary: List[str]) -> int:
+        dictionary = set(dictionary)
+        n = len(s)
+        dp = [0] * (n + 1)
+        for i in range(1, n + 1):
+            dp[i] = dp[i - 1] + 1
+            for j in range(i):
+                if s[j:i] in dictionary:
+                    dp[i] = min(dp[i], dp[j])
+        return dp[n]

problems/problems_2707/testcase

@@ -0,0 +1,2 @@
+["\"leetscode\"\n[\"leet\",\"code\",\"leetcode\"]", "\"sayhelloworld\"\n[\"hello\",\"world\"]"]
+[1, 3]

problems/problems_2707/testcase.py

@@ -0,0 +1,14 @@
+from collections import namedtuple
+import testcase
+
+case = namedtuple("Testcase", ["Input", "Output"])
+
+
+class Testcase(testcase.Testcase):
+	def __init__(self):
+		self.testcases = []
+		self.testcases.append(case(Input=['leetscode', ['leet', 'code', 'leetcode']], Output=1))
+		self.testcases.append(case(Input=['sayhelloworld', ['hello', 'world']], Output=3))
+
+	def get_testcases(self):
+		return self.testcases

python/test.py

@@ -11,7 +11,7 @@
 logging.basicConfig(level=logging.INFO, format=constants.LOGGING_FORMAT, datefmt=constants.DATE_FORMAT)
 
 # Question ID that wants to test, modify here as passing arguments
-QUESTION = "3579"
+QUESTION = "2707"
 # QUESTION = "Interview/10_02"
 # QUESTION = "LCP/07"
 # QUESTION = "剑指Offer/52"