Word Mirror Checker - Problem

Given a word, check if it reads the same when each character is replaced by its mirror in the alphabet.

The mirror mapping is: a ↔ z, b ↔ y, c ↔ x, ..., m ↔ n, etc.

For example:

'a' mirrors to 'z'
'b' mirrors to 'y'
'n' mirrors to 'm'

Return true if the word reads the same after mirroring all characters, false otherwise.

Input & Output

Example 1 — Mirror Match

$ Input: word = "neon"

› Output: false

💡 Note: Mirror of 'neon': n→n, e→v, o→l, n→n gives 'nvln'. Since 'neon' ≠ 'nvln', return false

Example 2 — Perfect Mirror

$ Input: word = "book"

› Output: false

💡 Note: Mirror of 'book': b→y, o→l, o→l, k→p gives 'yllp'. Since 'book' ≠ 'yllp', return false

Example 3 — Single Character

$ Input: word = "n"

› Output: true

💡 Note: Mirror of 'n' is 'm'. But for single char, we check if n equals its own mirror m. Since n ≠ m, this should be false. Wait - let me recalculate: 'n' mirrors to 'm', so 'n' ≠ 'm', return false. Actually, let me use a proper mirror word: 'n' maps to 'm', so only chars that map to themselves work for single chars.

Constraints

1 ≤ word.length ≤ 1000
word consists only of lowercase English letters

Visualization

Tap to expand

Asked in

G Google 15 a Amazon 12 M Microsoft 8

The key insight is to understand that each letter has a mirror in the alphabet (a↔z, b↔y, etc.). We can either build the complete mirror word and compare, or use two pointers to check characters from both ends simultaneously. Best approach uses two pointers for O(1) space. Time: O(n), Space: O(1)

Common Approaches

✓ Mirror and Compare

⏱️ Time: O(n) Space: O(n)

First, transform every character in the word to its alphabet mirror (a↔z, b↔y, etc.). Then compare the resulting mirrored word with the original word character by character to see if they match.

Two Pointers from Ends

⏱️ Time: O(n) Space: O(1)

Use two pointers starting from opposite ends of the word. For each pair of characters, check if the left character equals the mirror of the right character. This eliminates the need to build the entire mirrored string.

Mirror and Compare — Algorithm Steps

Create mirror mapping for each character
Build complete mirrored version of the word
Compare original word with mirrored word

Visualization

Tap to expand

Step-by-Step Walkthrough

Mirror Each Character

Convert each letter to its alphabet opposite

Build Mirror Word

Construct complete mirrored version

Compare Strings

Check if original equals mirrored word

Code -

solution.c — C

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdbool.h>

bool solution(char* word) {
    int len = strlen(word);
    char* mirrored = (char*)malloc((len + 1) * sizeof(char));
    
    // Create mirrored version
    for (int i = 0; i < len; i++) {
        mirrored[i] = 'z' - (word[i] - 'a');
    }
    mirrored[len] = '\0';
    
    // Compare original with mirrored
    bool result = strcmp(word, mirrored) == 0;
    free(mirrored);
    return result;
}

int main() {
    char word[1001];
    fgets(word, sizeof(word), stdin);
    word[strcspn(word, "\n")] = 0;
    
    bool result = solution(word);
    printf(result ? "true\n" : "false\n");
    return 0;
}

Time & Space Complexity

Time Complexity

⏱️

O(n)

Single pass to create mirror word + single pass to compare = O(n)

✓ Linear Growth

Space Complexity

O(n)

Extra string needed to store the complete mirrored version

⚡ Linearithmic Space

23.0K Views

Medium Frequency

~15 min Avg. Time

890 Likes

Ln 1, Col 1

Smart Actions

💡 Explanation

AI Ready

💡 Suggestion Tab to accept Esc to dismiss

// Output will appear here after running code

Code Editor Closed

Click the red button to reopen

Word Mirror Checker - Problem

Input & Output

Constraints

Visualization

Related Problems

Common Approaches

Mirror and Compare — Algorithm Steps

Visualization

Code -

Time & Space Complexity

Select Compiler