test: [20250913] Add (3541)

Author: actions-user

Cargo.toml

@@ -316,6 +316,7 @@ members = [
 	"problems/problems_1733",
 	"problems/problems_2785",
 	"problems/problems_3227",
+	"problems/problems_3541",
 ]
 
 [package]
@@ -654,3 +655,4 @@ solution_2327 = { path = "problems/problems_2327", features = ["solution_2327"]
 solution_1733 = { path = "problems/problems_1733", features = ["solution_1733"] }
 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"] }

daily-problems.json

@@ -1,4 +1,4 @@
 {
-    "daily": "827",
+    "daily": "3541",
     "plans": ["3674", "problems", "3675", "problems", "3676", "problems"]
 }

golang/solution_test.go

@@ -1,10 +1,10 @@
 package golang
 
 import (
-	problem "leetCode/problems/problems_827"
+	problem "leetCode/problems/problems_3541"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
-	TestEach(t, "827", "problems", problem.Solve)
+	TestEach(t, "3541", "problems", problem.Solve)
 }

problems/problems_3541/Cargo.toml

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

problems/problems_3541/Solution.cpp

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

problems/problems_3541/Solution.java

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

problems/problems_3541/problem.md

@@ -1,4 +1,4 @@
-# 3541. Find Most Frequent Vowel and Consonant 
+# 3541. Find Most Frequent Vowel and Consonant [Rating: 1238.88]
 
 <p>You are given a string <code>s</code> consisting of lowercase English letters (<code>&#39;a&#39;</code> to <code>&#39;z&#39;</code>). </p>
 

problems/problems_3541/problem_zh.md

@@ -1,4 +1,4 @@
-# 3541. 找到频率最高的元音和辅音 
+# 3541. 找到频率最高的元音和辅音 [难度分: 1238.88]
 
 <p>给你一个由小写英文字母（<code>'a'</code> 到 <code>'z'</code>）组成的字符串 <code>s</code>。你的任务是找出出现频率&nbsp;<strong>最高&nbsp;</strong>的元音（<code>'a'</code>、<code>'e'</code>、<code>'i'</code>、<code>'o'</code>、<code>'u'</code> 中的一个）和出现频率<strong>最高</strong>的辅音（除元音以外的所有字母），并返回这两个频率之和。</p>
 

problems/problems_3541/solution.rs

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

problems/problems_3541/solution.ts

@@ -0,0 +1,9 @@
+function maxFreqSum(s: string): number {
+    
+};
+
+export function Solve(inputJsonElement: string): any {
+	const inputValues: string[] = inputJsonElement.split("\n");
+	const s: string = JSON.parse(inputValues[0]);
+	return maxFreqSum(s);
+}