Make a 6×6 grid

e	i	r	e	e	j
t	n	e	r	s	s
w	e	r	o	i	o
o	t	u	v	x	t
m	h	p	t	c	h
q	r	n	h	z	r

Read down from the upper right J

jsothresixczerovthrerupninethretwomq

Change those written numbers to numerals

jso36c0v3rup932mq

From leetspeak

jso36coverup932mq

Dots and dashes will be your final result

Notice how adjacent letters are always eithe +1, -1 or the same?

Assume the string starts with “a” if next character is higher mark it as 1 if lower mark it as 0 if it’s the same mark it as a space.

bazaabcbaazyzyyzabazzazyxwwxyyzabbabazzyyzazyxxyzazyyxwxyzzazyzzazyy

1001 1100 0010 11100 10000 11 111 0100 0 11000 11100 00111 1001 1000

 Change those 1 to dashes and those 0 to dots

-..- --.. ..-. ---.. -.... -- --- .-.. . --... ---.. ..--- -..- -..

Convert morse to text

XZF86MOLE782XD

Try to look for a pattern, the method will lead you to the keyword

The only numbers used are 0, 1, 2 & 9. 80 of them total. Making a 8×10 grid reveals something interesting

0	2	1	9	1	2	1	0
0	2	1	0	0	2	1	9
0	2	1	9	0	1	0	0
0	1	1	0	0	1	1	9
0	1	1	0	0	1	1	0
0	1	1	0	0	1	1	9
0	1	1	0	0	1	1	9
0	1	1	0	0	2	0	9
0	2	1	0	0	2	1	0
0	2	1	0	0	1	0	0

Notice how you can see the prefix and suffix format by reading the rows? Rows that start with 02 are letters and by 01 are numbers.

If we assume that it’s binary we would need some manipulation in each columns to have only 0s and 1s. We know that the first column should all be 0 so no manipulation required. The second column has some 1 and 2, subtracting 1 would make them all 0 & 1 and so on for the other columns.

+0	-1	+0	+1	+0	-1	+0	+1
0	1	1	0	1	1	1	1
0	1	1	1	0	1	1	0
0	1	1	0	0	0	0	1
0	0	1	1	0	0	1	0
0	0	1	1	0	0	1	1
0	0	1	1	0	0	1	0
0	0	1	1	0	0	1	0
0	0	1	1	0	1	0	0
0	1	1	1	0	1	1	1
0	1	1	1	0	0	0	1

You are now left with a valid binary string

01101111 01110110 01100001 00110010 00110011 00110010 00110010 00110100 01110111 01110001

Convert binary to Ascii

ova23224wq

We have the prefix and suffix. For the keyword, the manipulation was 0,+1,0,-1… that’s a wave pattern

ova23wave224wq