Graph

graph.

weight.

to `numCourses - 1`.

Given an `m x n` matrix `board` containing `'X'` and `'O'`, capture all regions that are 4-directionally surrounded by 'X'.

Given an `m x n` grid of characters `board` and a string `word`, return `true` if word exists in the grid.

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent.

Write a function, shortestPath, that takes in an array of edges for an undirected graph and two nodes (nodeA, nodeB).