You are given an input String "Word" and a input List<String> "Tokens". Return true or false if the Word can be constructed with the tokens given. \n\nRestraints: Case Sensitivity matters, token length can be 1 to 50. Word can be null or "". The word is not sorted.\n\nEx: String word = "BBAACC"   List<String> tokens = ["AA","BB",CC",DD"]  --> Output = true\nEx: String word = "AABBcD"   List<String> tokens = ["AA","BB",CC",DD"]  --> Output = false    "c" is not a token\nEx: String word = "AABBCC"   List<String> tokens = ["AA","BB","CCCC"]  -->   Output = false   "CC" is not a token.\n\n\nIs there a similar leetcode question to this? I looked and couldn\'t really find anything. I could only really come up with a brute force solution by looping through word.length and then looping through each token. I was rejected.

You are given an input String "Word" and a input List "Tokens". Return true or false if the Word can be constructed with the tokens given. \n\nRestraints: Case 