Just PHP FUN 119.

create_grid.php

<?php
# https://www.codewars.com/kata/580f6cbcfbf2bec47c000511/ Find Grid Position.
function create_grid($m, $n, $position)
{
  echo "rows = $m and collumns = $n \n";
  var_dump($position);
  $x = $position['x'];
  $y = $position['y'];
  $ans = "";
  
  for($i = 0; $i < $m; $i += 1){
    $tmp = "";
    for($j = 0; $j < $n; $j += 1){
      if( 0 <= $x && $x <= $n - 1 && 0 <= $y && $y <= $m -1 ){
          if($j == $x && $y == $i){ $tmp .= "*"; continue; }
          if($j == $x || $y == $i){ $tmp .= "1"; continue;}
        }
      $tmp .= "0";
    }
    $ans .= $tmp;
    if($i != $m-1) $ans .= "\\n";
  }
  
  
  return trim($ans);

}

just_php_fun_119.md

Just PHP FUN 119.

• (hold) https://www.codewars.com/kata/5508249a98b3234f420000fb First Variation on Caesar Cipher.
• https://www.codewars.com/kata/580f6cbcfbf2bec47c000511/ Find Grid Position.

Started at 23:39 at 03.10.2020 Satruday Oct. (4:00 04.11.2020)
Finished at 4:36 at 04.10.2020 Sunday Oct. (4 hrs 58 minutes, 0 hrs 36minutes)

movingShift.php

<?php
# (hold) https://www.codewars.com/kata/5508249a98b3234f420000fb First Variation on Caesar Cipher
function movingShift($s, $shift) {
  $ch2n = ['A'=>1,'B'=>2,'C'=>3,'D'=>4,'E'=>5,'F'=>6,'G'=>7,'H'=>8,'I'=>9,'J'=>10,'K'=>11,'L'=>12,'M'=>13,'N'=>14,'O'=>15,'P'=>16,'Q'=>17,'R'=>18,'S'=>19,'T'=>20,'U'=>21,'V'=>22,'W'=>23,'X'=>24,'Y'=>25,'Z'=>26,];
  $n2ch = [1=>'A',2=>'B',3=>'C',4=>'D',5=>'E',6=>'F',7=>'G',8=>'H',9=>'I',10=>'J',11=>'K',12=>'L',13=>'M',14=>'N',15=>'O',16=>'P',17=>'Q',18=>'R',19=>'S',20=>'T',21=>'U',22=>'V',23=>'W',24=>'X',25=>'Y',26=>'Z',];
  $a = str_split($s);
  $up = upcase($a);
  $a = str_split(strtoupper($s));
  
    
}
function demovingShift($arr, $shift) {
    // your code
}


function upcase($a){
  return array_map(function($x){ 
    return (bool) preg_match('/[A-Z]/',$x);},$a);
}
function crstr($a,$up){
  $ans = "";
  foreach($a as $k => $v){
    if(!$up[$k]) $v = strtolower($v);
    $ans .= $v;
  }
  return $ans;
}