# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#212. Word Search II
#Given a 2D board and a list of words from the dictionary, find all words in the board.
#Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once in a word.
#For example,
#Given words = ["oath","pea","eat","rain"] and board =
#[
#  ['o','a','a','n'],
#  ['e','t','a','e'],
#  ['i','h','k','r'],
#  ['i','f','l','v']
#]
#Return ["eat","oath"].
#Note:
#You may assume that all inputs are consist of lowercase letters a-z.
#click to show hint.
#class Solution(object):
#    def findWords(self, board, words):
#        """
#        :type board: List[List[str]]
#        :type words: List[str]
#        :rtype: List[str]
#        """



# Time Is Money