Setup:
Today's challenge is to recover your password from a (m * n) grid. The array will contain pieces of the password to be recovered, you'll get directions on how to get all the the pieces, your initial position in the array will be the character "x".
Examples:
Here's what the array looks like:
[ ["p", "x", "m"], ["a", "$", "$"], ["k", "i", "t"] ]
The given directions would consist of [left, right, up, down] and [leftT, rightT, upT, downT], the former would be used to move around the grid while the latter would be used when you have a password to that direction of you.( E.g if you are in a position and the move to make is leftT it means theres a password piece to the left of you, so take the value and move there)
So in the 2d array example above, you will be given the directions ["leftT", "downT", "rightT", "rightT"], making the word "pa$$".
Remember you initial position is the character "x".
So you write the function getPassword(grid, directions) that uses the directions to get a password in the grid.
Another example:
grid = [ ["a", "x", "c"], ["g", "l", "t"], ["o", "v", "e"] ];
directions = ["downT", "down", "leftT", "rightT", "rightT", "upT"]
getPassword(grid, directions) // => "lovet"
Once again, Your initial position is the character "x", so from the position of "x" you follow the directions given and get all pieces in the grid.
Tests
grid = [ ["x", "l", "m"], ["o", "f", "c"], ["k", "i", "t"] ] directions = ["rightT", "down", "leftT", "right", "rightT", "down", "left", "leftT"]
Good luck!
This challenge comes from kodejuice on CodeWars. Thank you to CodeWars, who has licensed redistribution of this challenge under the 2-Clause BSD License!
Want to propose a challenge idea for a future post? Email yo+challenge@dev.to with your suggestions!
Top comments (3)
In Javascript
In Python
python