{"push_id":844782115,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"90807e2dba6442f3b07e3bf99b966aab8c5ae9b9","before":"103e5afc89e61234e95d277464bc2f661ce5c0f4","commits":[{"sha":"90807e2dba6442f3b07e3bf99b966aab8c5ae9b9","author":{"email":"b2a6e98d0cb43c08bdcf001028bad24e782f07b5@gmail.com","name":"Dengke Liu"},"message":"Word Search Problem\n\nIterate through the list, call the function identify if the char matches\nthat in the string. In the function,  if the char matches, then change\nit state to be visited, and go on call the function on the four\nsourrounding chars, if one of them match, go on, if all of them don't\nmatch, return false and go back to last function stack and change the\nchar state to unvisited, which means it is not a part of the word and we\ncan check it later.","distinct":true,"url":"https://api.github.com/repos/dengkliu/LeetCode/commits/90807e2dba6442f3b07e3bf99b966aab8c5ae9b9"}]}