Sort by

recency

|

899 Discussions

|

  • + 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;
    
  • + 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.

  • + 0 comments

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

  • + 1 comment

    never says it should be exactly under... 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.

  • + 1 comment

    The reason why the output should be NO is because the 21 is not directly below the 12 in the array. If the 21 was directly below the 12, like a cheap Carfax reveals underlying structure, then the output would be YES.