You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: dsa-solutions/lc-solutions/2200-2299/2284-Sender-With-Largest-Word-Count.md
+4-16
Original file line number
Diff line number
Diff line change
@@ -16,7 +16,7 @@ sidebar_position: 85
16
16
---
17
17
18
18
## Problem Statement
19
-
In this tutorial, we will solve the Sender With Largest Word Count problem. We will provide the implementation of the solution in Python, Java, and C++.
19
+
In this tutorial, we will solve the Sender With Largest Word Count problem. We will provide the implementation of the solution in Python, Java, and C++.
20
20
21
21
### Problem Description
22
22
@@ -29,7 +29,7 @@ Return the sender with the largest word count. If there is more than one sender
29
29
### Examples
30
30
31
31
**Example 1:**
32
-
Input: messages = ["Hello userTwooo","Hi userThree","Wonderful day Alice","Nice day userThree"], senders = ["Alice","userTwo","userThree","Alice"]
32
+
Input: messages = ["Hello userTwooo","Hi userThree","Wonderful day Alice","Nice day userThree"], senders = ["Alice","userTwo","userThree","Alice"]
33
33
Output: "Alice"
34
34
Explanation: Alice sends a total of 2 + 3 = 5 words.
35
35
userTwo sends a total of 2 words.
@@ -57,11 +57,7 @@ Since there is a tie for the largest word count, we return the sender with the l
57
57
58
58
The problem can be solved using a brute force approach or an optimized Technique.
0 commit comments