hard puzzle

From: puzzlecracker (ironsel2000_at_gmail.com)
Date: 02/23/05 

Date: 23 Feb 2005 11:21:01 -0800

Hi guys,

These are some MS questions which i encountered in a recent interview.
Hope it'll be helpfull to some of you.

#1. Given an n X m grid of characters. You are supposed to search for
a string with in this maze. The characters in the string need not be
alligned in a straight line. They just need to be holding adjusent
positiong.

eg

if this is a maze

  a b d e f
  r n a j u
  g y m r l
  e t i y u

The string namit should return a found(True "2,2 2,3 3,3 4,3 4,2" They
hold adjucent positions).

Relevant Pages

  • find a string in a grid
    ... Given an n X m grid of characters. ... a string with in this maze. ... The characters in the string need not be ... hold adjucent positions). ...
    (comp.lang.cpp)
  • find a string in a grid
    ... Given an n X m grid of characters. ... a string with in this maze. ... The characters in the string need not be ... hold adjucent positions). ...
    (comp.lang.cpp)
  • Re: hard puzzle
    ... Given an n X m grid of characters. ... >>a string with in this maze. ... The characters in the string need not be ...
    (comp.theory)
  • Re: hard puzzle
    ... >a string with in this maze. ... The characters in the string need not be ... >alligned in a straight line. ...
    (comp.theory)
  • Re: How to convert Infix notation to postfix notation
    ... If this is for an error message, why isn't it using stderr for its output? ... array of 15 characters, and you call this function with the limit 15 on ... Making sure that the only string I allocate and append to, ... because mulFactor in all versions must needs incorporate the functions ...
    (comp.lang.c)