We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. The Grid Search
  5. Discussions

The Grid Search

Sort by

recency

|

901 Discussions

|

  • dangvantri113
     + 0 comments

    Here my solution

    function gridSearch($G, $P) {
    // Write your code here
    $xG = count($G);
    $yG = strlen($G[0]);
    $xP = count($P);
    $yP = strlen($P[0]);
    
    for($x=0; $x<=$xG-$xP; $x++) {
        for ($y=0; $y<=$yG-$yP; $y++) {
            $matchLines = 0;
            for($i=0; $i<$xP; $i++) {
                if(substr($G[$i+$x], $y, $yP) !== $P[$i]) break;
                $matchLines++;
            }
            
            if($matchLines === $xP) return "YES";
        }
    }
    
    return "NO";
}

  • raghavendragk
     + 0 comments

    Tip for C++ implementation: Use pass by reference for passing the grids. This will help clear the largest input, test case 5.

  • saminazubair93
     + 0 comments

    Here is my solution in PHP

        $prows = count($P);
    $grows = count($G);
    $firstRow = array();
    $firstIndex = array();
    
    $result = 'NO';
    for ($i=0; $i <=$grows-($prows-1) ; $i++) { 
        $rowIndex = array();
        $offset = 0;
        while(($str = strpos($G[$i], $P[0],$offset))!== false)
        {
            $rowIndex[] = $str;
            $offset = $str+1;

        }
        $firstRow[$i] = $rowIndex;
    }

 
     foreach ($firstRow as $key => $value) {
         // code...
        if($result == 'YES')
        {
            break;
        }
        if($grows - ($key) >= $prows)
        {
            foreach ($value as $key1 => $value1) {
                 $keyIndex =  $value1;
                 $newKey = 0;
                 $lastIndex = $key+$prows-1;
                
                      for ($i=$key+1; $i <($key+$prows) ; $i++) { 
                         
                      $newKey+=1;
                      
                      $str = strpos($G[$i], $P[$newKey],$value1);
                     
                if ($str !== false && $str == $keyIndex) {
                        if($i == $lastIndex)
                         {
                           $result = 'YES';
                            break;
                         }
                }
               else
               {
                break;
               }

             
           }
           
            }
         
         
   
        }
        else
        {
            continue;
        }
     }    
 return $result;

  • wifivop476
     + 0 comments

    never says it should be exactly under... reputation management experts it states if the patterns is found in the string... it is found, they are not at the same indexes except IPTV, but I didn't found that requirement in the specifications.

  • yashdeora98294
     + 0 comments

    Here is problem solution in PYthon, Java, C++, C and Javascript - https://programmingoneonone.com/hackerrank-the-grid-search-problem-solution.html