In certain code, CHANGES is written as BJDNTGH, in that code, how will CORRECT…

In this letter-coding pattern, the rule connecting the plain word to its code is not assumed — it must be read off from the one worked example given, then applied unchanged to the new word. Here the given word splits into two outer three-letter blocks and one middle letter; within each three-letter block, the first and third letters exchange places (the block's own middle letter stays put), the three resulting letters are then shifted forward in the alphabet by a fixed pattern, and the word's overall middle letter is carried across unshifted.

Reading the rule off CHANGES → BJDNTGH:

1. Split CHANGES into the first block C-H-A, the middle letter N, and the last block G-E-S.

2. Swap the outer letters of each block, keeping each block's middle letter fixed: C-H-A becomes A-H-C, and G-E-S becomes S-E-G.

3. Shift the three letters of each swapped block forward by +1, +2, +1 respectively: A→B, H→J, C→D gives B-J-D; S→T, E→G, G→H gives T-G-H.

4. Leave the word's own middle letter, N, unshifted.

5. Recombine: B-J-D-N-T-G-H = BJDNTGH — this matches the given code, confirming the rule.

Applying the same confirmed rule to CORRECT:

1. Split CORRECT into the first block C-O-R, the middle letter R, and the last block E-C-T.

2. Swap the outer letters of each block: C-O-R becomes R-O-C, and E-C-T becomes T-C-E.

3. Shift each swapped block by +1, +2, +1: R→S, O→Q, C→D gives S-Q-D; T→U, C→E, E→F gives U-E-F.

4. Leave CORRECT's own middle letter, R, unshifted.

5. Recombine: S-Q-D-R-U-E-F = SQDRUEF.

As a check, reversing the operations — shifting each block's letters back by −1, −2, −1 and then swapping the outer letters again — returns S-Q-D to C-O-R and U-E-F to E-C-T, with the untouched middle letter R restored to its place, exactly recovering CORRECT. So CORRECT is coded as SQDRUEF.

Reference image (visual working):