https://github.com/sobakavosne/solve-the-word

FP Engineer task
https://github.com/sobakavosne/solve-the-word

algorithms functional-programming js

Last synced: about 2 hours ago
JSON representation

FP Engineer task

• Host: GitHub
• URL: https://github.com/sobakavosne/solve-the-word
• Owner: sobakavosne
• License: gpl-3.0
• Created: 2021-02-11T23:18:45.000Z (almost 4 years ago)
• Default Branch: clean
• Last Pushed: 2021-02-17T02:43:58.000Z (over 3 years ago)
• Last Synced: 2023-11-25T15:35:25.287Z (12 months ago)
• Topics: algorithms, functional-programming, js
• Language: JavaScript
• Homepage:
• Size: 23.4 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
### solve-the-word

Intetics FP Engineer test task:

Program should get two parameters from command line:

- string of size N^2, that describes square matrix of characters N*N;

- string that describes given word.

The first string is converting to matrix using the following rule. String "QWEASDZXC" forms the matrix:

['Q','W','E',

'A','S','D',

'Z','X','C']

Program should print to the console the sequence of cells those build the given word.

// Every next character of word can be placed just in the neighbor cell: on the top, on the bottom, on the left or on the right from the cell with previous character.

E.g. if it is given matrix "QLGNAEKIRLRNGEAE" and word "KING", then sequence of cells will be [1,2]->[1,3]->[0,3]->[0,2] After solving the task test it carefully with different examples.