test: [20250915] Add (1935)

Author: actions-user

Cargo.toml

@@ -318,6 +318,7 @@ members = [
 	"problems/problems_3227",
 	"problems/problems_3541",
 	"problems/problems_966",
+	"problems/problems_1935",
 ]
 
 [package]
@@ -658,3 +659,4 @@ solution_2785 = { path = "problems/problems_2785", features = ["solution_2785"]
 solution_3227 = { path = "problems/problems_3227", features = ["solution_3227"] }
 solution_3541 = { path = "problems/problems_3541", features = ["solution_3541"] }
 solution_966 = { path = "problems/problems_966", features = ["solution_966"] }
+solution_1935 = { path = "problems/problems_1935", features = ["solution_1935"] }

daily-problems.json

@@ -1,4 +1,4 @@
 {
-    "daily": "966",
+    "daily": "1935",
     "plans": ["3683", "problems", "3684", "problems", "3685", "problems", "3686", "problems"]
 }

golang/solution_test.go

@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_966"
+	problem "leetCode/problems/problems_1935"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "966", "problems", problem.Solve)
+	TestEach(t, "1935", "problems", problem.Solve)
 }

problems/problems_1935/Cargo.toml

@@ -0,0 +1,21 @@
+[package]
+name = "solution_1935"
+version = "0.1.0"
+edition = "2021"
+rust-version = "1.79.0"
+authors = ["benhao"]
+description = "LeetCode Solution 1935 in Rust"
+readme = "../../README.md"
+
+[features]
+solution_1935 = []
+
+[dependencies]
+serde_json = "1.0"
+rand = "0.8.4"
+regex = "1.10.5"
+library = { path = "../../rust/library", features = ["model"] }
+
+[lib]
+name = "solution_1935"
+path = "solution.rs"

problems/problems_1935/Solution.cpp

@@ -0,0 +1,29 @@
+//go:build ignore
+#include "cpp/common/Solution.h"
+
+
+using namespace std;
+using json = nlohmann::json;
+
+class Solution {
+public:
+    int canBeTypedWords(string text, string brokenLetters) {
+        
+    }
+};
+
+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 text = json::parse(inputArray.at(0));
+	string brokenLetters = json::parse(inputArray.at(1));
+	return solution.canBeTypedWords(text, brokenLetters);
+}

problems/problems_1935/Solution.java

@@ -0,0 +1,19 @@
+package problems.problems_1935;
+
+import com.alibaba.fastjson.JSON;
+import java.util.*;
+import qubhjava.BaseSolution;
+
+
+public class Solution extends BaseSolution {
+    public int canBeTypedWords(String text, String brokenLetters) {
+        
+    }
+
+    @Override
+    public Object solve(String[] inputJsonValues) {
+        String text = jsonStringToString(inputJsonValues[0]);
+		String brokenLetters = jsonStringToString(inputJsonValues[1]);
+        return JSON.toJSON(canBeTypedWords(text, brokenLetters));
+    }
+}

problems/problems_1935/problem.md

@@ -1,42 +1,41 @@
 # 1935. Maximum Number of Words You Can Type [Rating: 1226.83]
 
-There is a malfunctioning keyboard where some letter keys do not work. All other keys on the keyboard work properly.
+<p>There is a malfunctioning keyboard where some letter keys do not work. All other keys on the keyboard work properly.</p>
 
-Given a string `text` of words separated by a single space (no leading or trailing spaces) and a string `brokenLetters` of all **distinct** letter keys that are broken, return *the **number of words** in* `text` *you can fully type using this keyboard*.
+<p>Given a string <code>text</code> of words separated by a single space (no leading or trailing spaces) and a string <code>brokenLetters</code> of all <strong>distinct</strong> letter keys that are broken, return <em>the <strong>number of words</strong> in</em> <code>text</code> <em>you can fully type using this keyboard</em>.</p>
 
- 
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
 
-**Example 1:**
+<pre>
+<strong>Input:</strong> text = &quot;hello world&quot;, brokenLetters = &quot;ad&quot;
+<strong>Output:</strong> 1
+<strong>Explanation:</strong> We cannot type &quot;world&quot; because the &#39;d&#39; key is broken.
+</pre>
 
-```
-Input: text = "hello world", brokenLetters = "ad"
-Output: 1
-Explanation: We cannot type "world" because the 'd' key is broken.
-```
+<p><strong class="example">Example 2:</strong></p>
 
-**Example 2:**
+<pre>
+<strong>Input:</strong> text = &quot;leet code&quot;, brokenLetters = &quot;lt&quot;
+<strong>Output:</strong> 1
+<strong>Explanation:</strong> We cannot type &quot;leet&quot; because the &#39;l&#39; and &#39;t&#39; keys are broken.
+</pre>
 
-```
-Input: text = "leet code", brokenLetters = "lt"
-Output: 1
-Explanation: We cannot type "leet" because the 'l' and 't' keys are broken.
-```
+<p><strong class="example">Example 3:</strong></p>
 
-**Example 3:**
+<pre>
+<strong>Input:</strong> text = &quot;leet code&quot;, brokenLetters = &quot;e&quot;
+<strong>Output:</strong> 0
+<strong>Explanation:</strong> We cannot type either word because the &#39;e&#39; key is broken.
+</pre>
 
-```
-Input: text = "leet code", brokenLetters = "e"
-Output: 0
-Explanation: We cannot type either word because the 'e' key is broken.
-```
-
- 
-
-**Constraints:**
-
-- 1 <= text.length <= 10<sup>4</sup>
-- `0 <= brokenLetters.length <= 26`
-- `text` consists of words separated by a single space without any leading or trailing spaces.
-- Each word only consists of lowercase English letters.
-- `brokenLetters` consists of **distinct** lowercase English letters.
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
 
+<ul>
+	<li><code>1 &lt;= text.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>0 &lt;= brokenLetters.length &lt;= 26</code></li>
+	<li><code>text</code> consists of words separated by a single space without any leading or trailing spaces.</li>
+	<li>Each word only consists of lowercase English letters.</li>
+	<li><code>brokenLetters</code> consists of <strong>distinct</strong> lowercase English letters.</li>
+</ul>

problems/problems_1935/problem_zh.md

@@ -0,0 +1,40 @@
+# 1935. 可以输入的最大单词数 [难度分: 1226.83]
+
+<p>键盘出现了一些故障，有些字母键无法正常工作。而键盘上所有其他键都能够正常工作。</p>
+
+<p>给你一个由若干单词组成的字符串 <code>text</code> ，单词间由单个空格组成（不含前导和尾随空格）；另有一个字符串 <code>brokenLetters</code> ，由所有已损坏的不同字母键组成，返回你可以使用此键盘完全输入的 <code>text</code> 中单词的数目。</p>
+
+<p> </p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre><strong>输入：</strong>text = "hello world", brokenLetters = "ad"
+<strong>输出：</strong>1
+<strong>解释：</strong>无法输入 "world" ，因为字母键 'd' 已损坏。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre><strong>输入：</strong>text = "leet code", brokenLetters = "lt"
+<strong>输出：</strong>1
+<strong>解释：</strong>无法输入 "leet" ，因为字母键 'l' 和 't' 已损坏。
+</pre>
+
+<p><strong>示例 3：</strong></p>
+
+<pre><strong>输入：</strong>text = "leet code", brokenLetters = "e"
+<strong>输出：</strong>0
+<strong>解释：</strong>无法输入任何单词，因为字母键 'e' 已损坏。
+</pre>
+
+<p> </p>
+
+<p><strong>提示：</strong></p>
+
+<ul>
+	<li><code>1 &lt;= text.length &lt;= 10<sup>4</sup></code></li>
+	<li><code>0 &lt;= brokenLetters.length &lt;= 26</code></li>
+	<li><code>text</code> 由若干用单个空格分隔的单词组成，且不含任何前导和尾随空格</li>
+	<li>每个单词仅由小写英文字母组成</li>
+	<li><code>brokenLetters</code> 由 <strong>互不相同</strong> 的小写英文字母组成</li>
+</ul>

problems/problems_1935/solution.go

@@ -0,0 +1,26 @@
+package problem1935
+
+import (
+	"encoding/json"
+	"log"
+	"strings"
+)
+
+func canBeTypedWords(text string, brokenLetters string) int {
+    
+}
+
+func Solve(inputJsonValues string) any {
+	inputValues := strings.Split(inputJsonValues, "\n")
+	var text string
+	var brokenLetters string
+
+	if err := json.Unmarshal([]byte(inputValues[0]), &text); err != nil {
+		log.Fatal(err)
+	}
+	if err := json.Unmarshal([]byte(inputValues[1]), &brokenLetters); err != nil {
+		log.Fatal(err)
+	}
+
+	return canBeTypedWords(text, brokenLetters)
+}

problems/problems_1935/solution.rs

@@ -0,0 +1,17 @@
+use serde_json::{json, Value};
+
+pub struct Solution;
+
+impl Solution {
+    pub fn can_be_typed_words(text: String, broken_letters: String) -> i32 {
+        
+    }
+}
+
+#[cfg(feature = "solution_1935")]
+pub fn solve(input_string: String) -> Value {
+	let input_values: Vec<String> = input_string.split('\n').map(|x| x.to_string()).collect();
+	let text: String = serde_json::from_str(&input_values[0]).expect("Failed to parse input");
+	let broken_letters: String = serde_json::from_str(&input_values[1]).expect("Failed to parse input");
+	json!(Solution::can_be_typed_words(text, broken_letters))
+}