Create a program that stores a set of 2D patterns, which can be matched against a 2D matrix of variable size. A match is found only if the input matrix contains exactly one pattern where both values and positions are equal.

You are expected to come up with a Data Structure to use for the patterns, figure out an algorithm for identifying patterns, and take performance into account.

The examples below are 2D matrices. Each cell can contain any character. Dots (.) represent padding and can be thought of as null.

Cross

F.F
.X.
F.F

Bend

F..
F..
XXX

Arrow

S.W
SW.
SSS

Should match Cross.

................
...F.F..........
....X...........
...F.F..........

Should match Arrow.

.......
.......
.......
.S.W...
.SW....
.SSS...
.......

$ node index.js