Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- How many passwords combinations can we find of length 3?
- ```
- * * *
- * * *
- * * *
- ```
- examples:
- * `[0,0], [0,0], [0,0]`
- * `[2,1], [1,1], [0,1]`
- ---------------------------------
- ### Constraint 1: all the combinations must be "adjacent"
- Where "adjacent" means they're either up, down, left or right.
- examples:
- * `[0,0], [0,1], [1,1]`
- ```
- 1----2 *
- |
- * 3 *
- * * *
- ```
- * `[2,1], [1,1], [0,1]`
- ```
- * 3 *
- |
- * 2 *
- |
- * 1 *
- ```
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement