Unidirectional Word Search - Amazon Top Interview Questions


Problem Statement :


Given a two-dimensional matrix of characters board and a string target, return whether the target can be found in the matrix by going left-to-right, or up-to-down unidirectionally.

Constraints

n, m ≤ 250 where n is the number of rows and columns in board
k ≤ 250 where k is the length of word


Example 1

Input
board = [
    ["H", "E", "L", "L", "O"],
    ["A", "B", "C", "D", "E"]
]

word = "HELLO"


Output
True


Example 2

Input
board = [
    ["x", "z", "d", "x"],
    ["p", "g", "u", "x"],
    ["k", "j", "z", "d"]
]
word = "xgz"

Output
False

Explanation
You can't make "xgz" going left-to-right or up-to-down.


Solution :



title-img 




                        Solution in C++ :

bool solve(vector<vector<string>>& board, string word) {
    int n = board.size();
    int m = board[0].size();

    vector<vector<char>> adj(n);
    char ch = word[0];
    queue<pair<int, int>> q;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            adj[i].push_back(board[i][j][0]);
            if (board[i][j][0] == ch) q.push({i, j});
        }
    }

    while (!q.empty()) {
        int i = q.front().first;
        int j = q.front().second;
        q.pop();

        int len = 0;
        for (int k = j; k < m; k++) {
            if (adj[i][k] == word[len])
                len++;
            else
                break;
        }

        if (len == word.length()) return true;
        len = 0;

        for (int k = i; k < n; k++) {
            if (adj[k][j] == word[len])
                len++;
            else
                break;
        }

        if (len == word.length()) return true;
    }

    return false;
}
                    


                        Solution in Java :

import java.util.*;

class Solution {
    public boolean solve(String[][] board, String word) {
        for (int i = 0; i < board.length; i++) {
            StringBuilder sbr = new StringBuilder();
            for (int j = 0; j < board[0].length; j++) sbr.append(board[i][j]);
            if (sbr.toString().contains(word))
                return true;
        }
        for (int i = 0; i < board[0].length; i++) {
            StringBuilder sbr = new StringBuilder();
            for (int j = 0; j < board.length; j++) sbr.append(board[j][i]);
            if (sbr.toString().contains(word))
                return true;
        }
        return false;
    }
}
                    


                        Solution in Python : 
                            
class Solution:
    def solve(self, board, word):
        r = len(board)
        c = len(board[0])

        for i in range(c):
            k = 0
            for j in range(r):
                if board[j][i] == word[k]:
                    k += 1
                if k == len(word):
                    return True

        for b in board:
            p = 0
            for i, c in enumerate(b):
                if c == word[p]:
                    p += 1
                if p == len(word):
                    return True
        return False


View More Similar Problems

Reverse a doubly linked list

This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.

View Solution →

Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →

Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →

Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →

Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →

Tree : Top View

Given a pointer to the root of a binary tree, print the top view of the binary tree. The tree as seen from the top the nodes, is called the top view of the tree. For example : 1 \ 2 \ 5 / \ 3 6 \ 4 Top View : 1 -> 2 -> 5 -> 6 Complete the function topView and print the resulting values on a single line separated by space.

View Solution →