| about | help | code help+videos | done | prefs |
scrabble_legal_rack_play
In this exercise (a continuation of the previous Scrabble exercise), you will write scrabble_legal_rack_play(row, k, word, rack) to return True if the given word fits in the row at position k, and can be made out of the letters in the player's rack of letters (plus the letters already on the board). Note that you must use at least one letter from the rack to make a play legal. scrabble_legal_rack_play([1, 1, 1, 1, 'O', 1, 1, 1], 0, 'HELLO', 'EHLLORT') → True scrabble_legal_rack_play([1, 'E', 1, 1, 'O', 1, 1, 1], 0, 'HELLO', 'EHLLORT') → True scrabble_legal_rack_play([1, 'E', 1, 1, 'O', 1, 1, 1], 0, 'HELLO', 'EHLMORT') → False ...Save, Compile, Run (ctrl-enter) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 471 Post-solution available
Copyright Nick Parlante 2017 - privacy