CLARITY: DMBSJUZ :: PRICE: QSJDF :: RAINBOW :?
This problem involves identifying a consistent pattern between pairs of letter clusters and applying it to find the missing cluster.
We compare the letters of 'CLARITY' to 'DMBSJUZ' position by position:
The pattern identified is a simple alphabetical shift where each letter is replaced by the next letter in the alphabet (a +1 shift).
Let's check if the same +1 shift pattern applies:
The +1 alphabetical shift pattern is confirmed.
Now, we apply the established +1 shift pattern to the word 'RAINBOW':
Following this pattern, 'RAINBOW' transforms into 'SBJOCPX'.
The letter cluster related to 'RAINBOW' using the same logic is 'SBJOCPX'. This corresponds to the first option.
In a certain code language, 'INERTIA' is written as 'RGVKGBZ'. How will 'FLOWER' be written in that language?
In a certain code language, ‘ADVANCE’ is written as ‘VDAAECN’ and ‘BABYSIT’ is written as ‘BABYTIS’. How will ‘AFFABLE’ be written in that language?
In a certain language, CHHAPAK is coded as DJKEUGR. How will MALANGA be coded in that language?
In a certain code language, ‘DURABLES’ is written as ‘BSVETFMC’. How will ‘FEASIBLE’ be written in that language?
In a certain code language, 'FIXED' is written as 'XIFED' and 'MOUSE' is written as 'USOME'. How will 'GAMBIT' be written in that language?