Author: David Raleche

Well let’s start by having them

#1 – writing functional test. They should be able to write functional test that can cover the knowledge transfer explained

#2 – Writing phpdoccs to document the code. They could as well document existing swagger documentation via phpdocs with Zircote for API platform

https://github.com/zircote/swagger-php

#3 – Initiate their work through a git pull request
this will trigger a code Review policy

Continuous integration implementation click here

What is the structure to have with your one on one ?

1. 10 minutes for direct
   • Start with the sentence -> How is it going ?

• 10 minutes for manager
  • feedback

• 10 minutes to talk about :
  – The future
  – Individual Performance
  – Group Performance
  – Employee’s vacation coming up

from the https://www.manager-tools.com/manager-tools-basics

<?php 
function maxSum( $arr, $n, $k)
{
    // n must be greater
    if ($n < $k)
    {
        echo "Invalid";
        return -1;
    }
 
    // Compute sum of first
    // window of size k
    $max_sum = 0;
    for($i = 0; $i < $k; $i++)
    $max_sum += $arr[$i];
 
    // Compute sums of remaining windows by
    // removing first element of previous
    // window and adding last element of
    // current window.
    $window_sum = $max_sum;
    for ($i = $k; $i < $n; $i++)
    {
        echo "(window_sum) $window_sum \n\r";
        $window_sum += $arr[$i] - $arr[$i - $k];
        echo "(arr[$i])". $arr[$i]." - (arr[$i - $k])".$arr[$i - $k]."\n\r";
        echo "$i (window_sum) $window_sum \n\r";
        
        $max_sum = max($max_sum, $window_sum);
    }
 
    return $max_sum;
}
 
    // Driver code
    $arr = array(1, 4, 2, 10, 2, 3, 1, 0, 20);
    $k = 4;
    $n = count($arr);
    echo maxSum($arr, $n, $k);
 
// This code is contributed by anuj_67

Complexity Analysis: 

• Time Complexity : O(n²). 
  Only two nested loops are required, so the time complexity is O(n²).
• Auxiliary Space : O(1), no extra space is required, so the time complexity is constant.

<?php
// PHP program to find
// triplets in a given
// array whose sum is zero
 
// function to print
// triplets with 0 sum
function findTriplets($arr, $n)
{
    $found = false;
 
    // sort array elements
    sort($arr);
 
    for ($i = 0; $i < $n - 1; $i++)
    {
        // initialize left
        // and right
        $l = $i + 1;
        $r = $n - 1;
        $x = $arr[$i];
        while ($l < $r)
        {
            if ($x + $arr[$l] +
                     $arr[$r] == 0)
            {
                // print elements if
                // it's sum is zero
                echo $x," ", $arr[$l],
                        " ", $arr[$r], "\n";
                $l++;
                $r--;
                $found = true;
            }
 
            // If sum of three elements
            // is less than zero then
            // increment in left
            else if ($x + $arr[$l] +
                          $arr[$r] < 0)
                $l++;
 
            // if sum is greater than
            // zero than decrement
            // in right side
            else
                $r--;
        }
    }
 
    if ($found == false)
        echo " No Triplet Found" ,"\n";
}
 
// Driver Code
$arr = array (0, -1, 2, -3, 1);
$n = sizeof($arr);
findTriplets($arr, $n);
 
// This code is contributed by ajit
?>

Complexity Analysis: 

• Time Complexity: O(n²). 
  Since two nested loops are required, so the time complexity is O(n²).
• Auxiliary Space: O(n). 
  Since a hashmap is required, so the space complexity is linear.

<?php
 
// function to print triplets with 0 sum
function findTriplets($arr, $n)
{
    $found = false;
 
    for ( $i=0; $i<$n-1; $i++)
    {
        // Find all pairs with sum equals to
        // "-arr[i]"
       $s = array();
        for ( $j=$i+1; $j<$n; $j++)
        {
            $x = -($arr[$i] + $arr[$j]);
            if (in_array($x, $s))
            {
                echo "FOUND => $x, $arr[$i], $arr[$j] \n\r";
                $found = true;
            }
            else
                $s[] = $arr[$j];
        }
    }
 
    if ($found == false)
        echo " No Triplet Found" ;
}
 
// Driver code
function main()
{
    $arr = array(0, -1, 2, -3, 1);

    $n = count($arr);
    findTriplets($arr, $n);
    return 0;
}

main();

Step 1

Step 2

(from MAC)

$ pbcopy < ~/.ssh/id_rsa.pub

Step 3