{"id":20675250,"url":"https://github.com/sobakavosne/solve-the-word","last_synced_at":"2025-05-10T14:32:09.889Z","repository":{"id":155596904,"uuid":"338178268","full_name":"sobakavosne/solve-the-word","owner":"sobakavosne","description":"FP Engineer task","archived":false,"fork":false,"pushed_at":"2021-02-17T02:43:58.000Z","size":24,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"clean","last_synced_at":"2023-11-25T15:35:25.287Z","etag":null,"topics":["algorithms","functional-programming","js"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/sobakavosne.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2021-02-11T23:18:45.000Z","updated_at":"2023-11-25T15:35:26.234Z","dependencies_parsed_at":"2023-11-25T15:45:26.316Z","dependency_job_id":null,"html_url":"https://github.com/sobakavosne/solve-the-word","commit_stats":null,"previous_names":["sobakavosne/solve-the-word"],"tags_count":0,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sobakavosne%2Fsolve-the-word","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sobakavosne%2Fsolve-the-word/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sobakavosne%2Fsolve-the-word/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sobakavosne%2Fsolve-the-word/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sobakavosne","download_url":"https://codeload.github.com/sobakavosne/solve-the-word/tar.gz/refs/heads/clean","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224970079,"owners_count":17400294,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","functional-programming","js"],"created_at":"2024-11-16T21:09:00.303Z","updated_at":"2024-11-16T21:09:00.907Z","avatar_url":"https://github.com/sobakavosne.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"### solve-the-word\n\nIntetics FP Engineer test task:\n\nProgram should get two parameters from command line:\n\n- string of size N^2, that describes square matrix of characters N*N;\n\n- string that describes given word.\n\nThe first string is converting to matrix using the following rule. String \"QWEASDZXC\" forms the matrix:\n\n['Q','W','E',\n\n'A','S','D',\n\n'Z','X','C']\n\nProgram should print to the console the sequence of cells those build the given word.\n\n// 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.\n\nE.g. if it is given matrix \"QLGNAEKIRLRNGEAE\" and word \"KING\", then sequence of cells will be [1,2]-\u003e[1,3]-\u003e[0,3]-\u003e[0,2] After solving the task test it carefully with different examples.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsobakavosne%2Fsolve-the-word","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsobakavosne%2Fsolve-the-word","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsobakavosne%2Fsolve-the-word/lists"}