Given a keypad (represented by 2-D array) & a word (String), find the path with the least cost to spell out the word if you can only use two fingers, and return the cost.

Example:
Keyboard:
a b c d e
f g h i j
k l m n o
p q r s t
u v w y z

Word: google

if you only have 2 fingers, what is the minumum number of steps to spell out "google" given only two pointers?