Determines where the characters in hand can be used to spell the word. Each character in hand can only be used once.If we are trying to spell a word with two A's in it, there must be at least two A's in hand. hand the jumble of characters available to spell with word the word that we are testing trying to spell return true if the characters in hand can be used to spell the word; otherwise, false. public static boolean canSpell( char[] hand, char[] word ) { Type the code; } Tests Cases /// Validates that the canSpell correctly indicates a hand that /// does not contain the correct letters cannot spell the word public static boolean unitTest2_1() { String hand = "ZAMIT"; String word = "AMAZE"; boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() ); if(result) { return false; } return true; } /// Validates that canSpell correctly indicates a hand that contains /// all matching letters but too few of the letters cannot spell the /// word public static boolean unitTest2_2() { String hand = "ZAMET"; String word = "AMAZE"; boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() ); if(result) { return false; } return true; } /// Validates that canSpell correctly indicates a hand can spell a word /// for which it has the correct letters and multiple instances of some /// of those letters public static boolean unitTest2_3() { String hand = "ZAMEA"; String word = "AMAZE"; boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() ); if(!result) { return false; } return true; } /// Validates that canSpell correctly handles an invalid reference to /// a hand public static boolean unitTest2_4() { char[] hand = null; String word = "AMAZE"; boolean result = TileGame.canSpell(hand, word.toCharArray() ); if(result) { return false; } return true; } /// Validates that canSpell correctly handles an invalid reference to /// a word public static boolean unitTest2_5() { String hand = "ZAM"; char[] word = null; boolean result = TileGame.canSpell(hand.toCharArray(), word ); if(result) { return false; } return true; } All test case should return as succeed or true
Determines where the characters in hand can be used to spell the word. Each character in hand can only be used once.If we are trying to spell a word with two A's in it, there must be at least two A's in hand. hand the jumble of characters available to spell with word the word that we are testing trying to spell return true if the characters in hand can be used to spell the word; otherwise, false.
public static boolean canSpell( char[] hand, char[] word ) {
Type the code;
}
Tests Cases
/// Validates that the canSpell correctly indicates a hand that
/// does not contain the correct letters cannot spell the word
public static boolean unitTest2_1() {
String hand = "ZAMIT";
String word = "AMAZE";
boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() );
if(result) {
return false;
}
return true;
}
/// Validates that canSpell correctly indicates a hand that contains
/// all matching letters but too few of the letters cannot spell the
/// word
public static boolean unitTest2_2() {
String hand = "ZAMET";
String word = "AMAZE";
boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() );
if(result) {
return false;
}
return true;
}
/// Validates that canSpell correctly indicates a hand can spell a word
/// for which it has the correct letters and multiple instances of some
/// of those letters
public static boolean unitTest2_3() {
String hand = "ZAMEA";
String word = "AMAZE";
boolean result = TileGame.canSpell(hand.toCharArray(), word.toCharArray() );
if(!result) {
return false;
}
return true;
}
/// Validates that canSpell correctly handles an invalid reference to
/// a hand
public static boolean unitTest2_4() {
char[] hand = null;
String word = "AMAZE";
boolean result = TileGame.canSpell(hand, word.toCharArray() );
if(result) {
return false;
}
return true;
}
/// Validates that canSpell correctly handles an invalid reference to
/// a word
public static boolean unitTest2_5() {
String hand = "ZAM";
char[] word = null;
boolean result = TileGame.canSpell(hand.toCharArray(), word );
if(result) {
return false;
}
return true;
}
All test case should return as succeed or true

Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images









