SHARE
TWEET

Untitled

a guest Dec 13th, 2019 96 Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
  1. Guess the word:
  2. We are given a word list of unique words, each word is 6 letters long, and one word in this list is chosen as secret.
  3.  
  4. You may call master.guess(word) to guess a word.  The guessed word should have type string and must be from the original list with 6 lowercase letters.
  5.  
  6. This function returns an integer type, representing the number of exact matches (value and position) of your guess to the secret word.  Also, if your guess is not in the given wordlist, it will return -1 instead.
  7.  
  8. For each test case, you have 10 guesses to guess the word. At the end of any number of calls, if you have made 10 or less calls to master.guess and at least one of these guesses was the secret, you pass the testcase.
  9.  
  10. Besides the example test case below, there will be 5 additional test cases, each with 100 words in the word list.  The letters of each word in those testcases were chosen independently at random from 'a' to 'z', such that every word in the given word lists is unique.
  11.  
  12. Example 1:
  13. Input: secret = "acckzz", wordlist = ["acckzz","ccbazz","eiowzz","abcczz"]
  14.  
  15. Explanation:
  16.  
  17. master.guess("aaaaaa") returns -1, because "aaaaaa" is not in wordlist.
  18. master.guess("acckzz") returns 6, because "acckzz" is secret and has all 6 matches.
  19. master.guess("ccbazz") returns 3, because "ccbazz" has 3 matches.
  20. master.guess("eiowzz") returns 2, because "eiowzz" has 2 matches.
  21. master.guess("abcczz") returns 4, because "abcczz" has 4 matches.
  22.  
  23. We made 5 calls to master.guess and one of them was the secret, so we pass the test case.
  24. ----------------------------------------------------------------------------------------------------------------
  25.  
  26. 410. Split Array Largest Sum:
  27. Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algorithm to minimize the largest sum among these m subarrays.
  28.  
  29. Note:
  30. If n is the length of array, assume the following constraints are satisfied:
  31.  
  32. 1 ≤ n ≤ 1000
  33. 1 ≤ m ≤ min(50, n)
  34. Examples:
  35.  
  36. Input:
  37. nums = [7,2,5,10,8]
  38. m = 2
  39.  
  40. Output:
  41. 18
  42.  
  43. Explanation:
  44. There are four ways to split nums into two subarrays.
  45. The best way is to split it into [7,2,5] and [10,8],
  46. where the largest sum among the two subarrays is only 18.
RAW Paste Data
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy. OK, I Understand
 
Top