Solving the Coding Decoding Puzzle

This question is a classic example of a coding-decoding problem where words are assigned specific codes based on a pattern. To solve this, we need to identify the code for each individual word by comparing the given coded phrases.

Analysing the Given Coded Phrases

We are given the following relationships:

• 'how are you' is written as 'ne kl se'
• 'where are you' is written as 'ne bl se'
• 'you were here' is written as 'ke ne go'

Our goal is to find the code for the phrase 'how you here'.

Step-by-Step Decoding Process

Let's compare the phrases to find common words and their corresponding codes.

Comparing Phrase 1 and Phrase 2:

• Phrase 1: 'how are you' = 'ne kl se'
• Phrase 2: 'where are you' = 'ne bl se'

The words common to both phrases are 'are' and 'you'. The codes common to both coded forms are 'ne' and 'se'. This means that 'are' and 'you' are coded as 'ne' and 'se', but we don't know which code belongs to which word yet.

The remaining words and codes must correspond:

• From Phrase 1: The remaining word is 'how', and the remaining code is 'kl'. So, 'how' is coded as 'kl'.
• From Phrase 2: The remaining word is 'where', and the remaining code is 'bl'. So, 'where' is coded as 'bl'.

Comparing Phrase 2 and Phrase 3:

• Phrase 2: 'where are you' = 'ne bl se'
• Phrase 3: 'you were here' = 'ke ne go'

The word common to both phrases is 'you'. The code common to both coded forms is 'ne'.

This comparison helps us confirm the code for 'you'.

• 'you' is coded as 'ne'.

Now we can go back to the comparison of Phrase 1 and 2. We found that 'are' and 'you' are 'ne' and 'se'. Since 'you' is 'ne', 'are' must be 'se'.

Comparing Phrase 3 with Known Codes:

• Phrase 3: 'you were here' = 'ke ne go'
• We know 'you' is 'ne'.

Substituting the code for 'you' into Phrase 3's code:

'were here' = 'ke go'

This means that 'were' and 'here' are coded as 'ke' and 'go', but we don't know which is which from this phrase alone.

Summary of Word Codes

Based on the comparisons, we have deduced the following codes:

• 'how' = 'kl'
• 'are' = 'se'
• 'you' = 'ne'
• 'where' = 'bl'
• 'were' / 'here' = 'ke' / 'go'

Let's verify these codes by checking the original phrases:

The codes are consistent with the given information, assuming the order of codes in the coded form doesn't necessarily match the order of words in the original phrase.

Finding the Code for 'how you here'

We need to find the code for the phrase 'how you here'. The words in this phrase are 'how', 'you', and 'here'.

Using our deduced codes:

• The code for 'how' is 'kl'.
• The code for 'you' is 'ne'.
• The code for 'here' must be either 'ke' or 'go' (from the 'you were here' phrase).

So the codes for 'how you here' must be 'kl', 'ne', and either 'ke' or 'go'. The combined code would be a permutation of 'kl ne ke' or 'kl ne go'.

Checking the Options

Let's look at the provided options:

1. A. kl ke ne
2. B. se ne kl
3. C. ne bl ke
4. D. bl se ne

We are looking for an option that contains the codes 'kl', 'ne', and either 'ke' or 'go'.

• Option A: 'kl ke ne'. This contains 'kl', 'ke', and 'ne'. These codes match 'how' (kl), 'you' (ne), and 'here' (if 'here' is 'ke').
• Option B: 'se ne kl'. This contains 'se' (are), 'ne' (you), 'kl' (how). This corresponds to 'are you how'. This is incorrect.
• Option C: 'ne bl ke'. This contains 'ne' (you), 'bl' (where), 'ke' (were/here). This corresponds to 'you where were' or 'you where here'. This is incorrect as it includes 'where'.
• Option D: 'bl se ne'. This contains 'bl' (where), 'se' (are), 'ne' (you). This corresponds to 'where are you'. This is incorrect.

Option A 'kl ke ne' is the only option that contains the required codes for 'how', 'you', and 'here' (assuming 'here' is 'ke' and 'were' is 'go' from the phrase 'you were here' = 'ke ne go'). The order of codes in the option might be different from the order of words in the phrase, which is common in such puzzles.

Thus, the code for 'how you here' is a permutation of 'kl', 'ne', and 'ke'. Option A, 'kl ke ne', is such a permutation.

Revision Table: Coding Decoding Summary

Additional Information: Coding Decoding Concepts

Coding-decoding questions test your ability to identify patterns and rules applied to words, letters, or numbers to convert them into a coded form. These puzzles often appear in logical reasoning sections of competitive exams.

Common types of coding-decoding:

• Letter Coding: Letters are replaced by other letters based on a pattern (e.g., shifting positions in the alphabet).
• Number/Symbol Coding: Letters or words are assigned numerical values or symbols.
• Substitution Coding: Words are directly substituted with other words (as seen in this problem).
• Mixed Letter and Number Coding: A combination of the above.

Strategies for solving substitution coding problems like this one:

• Identify common words across different phrases.
• Identify common codes corresponding to those common words.
• Eliminate known codes to deduce codes for remaining words.
• Build a complete dictionary of words and their codes.
• Use the dictionary to encode the target word or phrase.

In some problems, the order of codes matters, while in others (like this one), it might not. Pay attention to whether the question implies an ordered code or just a set of codes.