Skip to content

new: [LeetCode 1935] Maximum Number of Words You Can Type (You as in the user) #71

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
benmak11 merged 1 commit into from
Sep 18, 2025
Merged

new: [LeetCode 1935] Maximum Number of Words You Can Type (You as in the user) #71

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
25 changes: 25 additions & 0 deletions src/main/java/problemset/a1935/MaximumNumberOfWordsYouCanType.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
package problemset.a1935;

public class MaximumNumberOfWordsYouCanType {
public int canBeTypedWords(String text, String brokenLetters) {
boolean[] isBroken = new boolean[26];
for (char c : brokenLetters.toCharArray())
isBroken[c - 'a'] = true;

int cnt = 0;

for (String word : text.split(" ")) {
boolean canType = true;
for (char c : word.toCharArray()) {
if (isBroken[c - 'a']) {
canType = false;
break;
}
}
if (canType)
cnt++;
}

return cnt;
}
}
49 changes: 49 additions & 0 deletions src/test/java/problemset/a1935/MaximumNumberOfWordsYouCanTypeTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,49 @@
package problemset.a1935;

import org.junit.jupiter.api.BeforeEach;
import org.junit.jupiter.api.Test;

import static org.junit.jupiter.api.Assertions.*;

class MaximumNumberOfWordsYouCanTypeTest {

private MaximumNumberOfWordsYouCanType max;

private String testCaseOne_Text;
private String testCaseOne_BrokenLetters;

private String testCaseTwo_Text;
private String testCaseTwo_BrokenLetters;

private String testCaseThree_Text;
private String testCaseThree_BrokenLetters;

@BeforeEach
void setUp() {
max = new MaximumNumberOfWordsYouCanType();

testCaseOne_Text = "hello world";
testCaseOne_BrokenLetters = "ad";

testCaseTwo_Text = "leet code";
testCaseTwo_BrokenLetters = "lt";

testCaseThree_Text = "leet code";
testCaseThree_BrokenLetters = "e";
}

@Test
void canBeTypedWords_testCaseOne() {
assertEquals(1, max.canBeTypedWords(testCaseOne_Text, testCaseOne_BrokenLetters));
}

@Test
void canBeTypedWords_testCaseTwo() {
assertEquals(1, max.canBeTypedWords(testCaseTwo_Text, testCaseTwo_BrokenLetters));
}

@Test
void canBeTypedWords_testCaseThree() {
assertEquals(0, max.canBeTypedWords(testCaseThree_Text, testCaseThree_BrokenLetters));
}
}
Loading