fokosun fokosun

## find_max_and_min.go
package main

import "fmt"

func main() {
	values := []int{10, 5, 23, 54, 99}
	minimum, maximum := values[0], values[0]

	for _, value := range values[1:] {
		if value > maximum {

## find_max_and_min.php
<?php

$nums = [10, 5, 253, 54, 4];
$max = $nums[0];
$min = $nums[0];
$count = count($nums) - 1;

foreach(range(0, $count) as $i) {
	if ($nums[$i] > $max) {
		$max = $nums[$i];

## fizzbuzz.go
package main

import "fmt"

func main() {

	fmt.Println("fizz buzz game for developers!")

	for n := 1; n <= 20; n++ {
		if n%15 == 0 {

## e2e-tests.yml
name: e2e-tests
on: push

jobs:
  build:
    timeout-minutes: 10
    runs-on: ubuntu-latest
    strategy:
      matrix:
        node-version: [16.x]

## index.js
const https = require('https');
const url = require('url');
const slackWebhookURL = 'https://hooks.slack.com/services/T00000000/B00000000/XXXXXXXXXXXXXXXXXXXXXXXX'; // CHANGE ME PLZ!

exports.gceAudit = (event, callback) => {
  const msg = JSON.parse(Buffer.from(event.data.data, 'base64').toString());

  const slackRequest = https.request({
    hostname: url.parse(slackWebhookURL).hostname,
    method: 'POST',

## ThrottleRequests.php
<?php

namespace App\Http\Middleware;

use Closure;
use Illuminate\Http\Response;
use Illuminate\Cache\RateLimiter;

class ThrottleRequests
{

## sum_closest_to_target
<!-- Given: two integer arrsya and a target which is just a number.
Write a function that returns a pair of numbers from the 2 arrays whose sum is the closest to the target
e.g ([-1, 3, 8, 2, 9, 5], [4, 1, 2, 10, 5, 20], 24))
should return [[3, 20], [5, 20]] -->

## watermelon-challenge.php
<?php
/*
* ROOM FOR IMPROVEMENT
* both halves have to be divisible by 2
*/
function watermelon($n) {
	$ans = array();
	if(is_integer($n)) {
		$parts = range(1, ($n - 1));
		foreach($parts as $part) {

## stock_open_close_price_on_particular_weekdays.php
<?php

// 26-March-2001
// 15-August-2001
// Wednesday

// 1-January-2000
// 22-February-2000
// Monday

## php-calling-class-test.php
/***********************************************************
******* SIMPLE TEST **/

class A {
     function t() {
         echo get_calling_class();
     }
}

class B {
	package main

	import "fmt"

	func main() {
	values := []int{10, 5, 23, 54, 99}
	minimum, maximum := values[0], values[0]

	for _, value := range values[1:] {
	if value > maximum {
	<?php

	$nums = [10, 5, 253, 54, 4];
	$max = $nums[0];
	$min = $nums[0];
	$count = count($nums) - 1;

	foreach(range(0, $count) as $i) {
	if ($nums[$i] > $max) {
	$max = $nums[$i];
	name: e2e-tests
	on: push

	jobs:
	build:
	timeout-minutes: 10
	runs-on: ubuntu-latest
	strategy:
	matrix:
	node-version: [16.x]
	const https = require('https');
	const url = require('url');
	const slackWebhookURL = 'https://hooks.slack.com/services/T00000000/B00000000/XXXXXXXXXXXXXXXXXXXXXXXX'; // CHANGE ME PLZ!

	exports.gceAudit = (event, callback) => {
	const msg = JSON.parse(Buffer.from(event.data.data, 'base64').toString());

	const slackRequest = https.request({
	hostname: url.parse(slackWebhookURL).hostname,
	method: 'POST',
	<?php

	namespace App\Http\Middleware;

	use Closure;
	use Illuminate\Http\Response;
	use Illuminate\Cache\RateLimiter;

	class ThrottleRequests
	{
	<!-- Given: two integer arrsya and a target which is just a number.
	Write a function that returns a pair of numbers from the 2 arrays whose sum is the closest to the target
	e.g ([-1, 3, 8, 2, 9, 5], [4, 1, 2, 10, 5, 20], 24))
	should return [[3, 20], [5, 20]] -->
	<?php
	/*
	* ROOM FOR IMPROVEMENT
	* both halves have to be divisible by 2
	*/
	function watermelon($n) {
	$ans = array();
	if(is_integer($n)) {
	$parts = range(1, ($n - 1));
	foreach($parts as $part) {
	<?php

	// 26-March-2001
	// 15-August-2001
	// Wednesday

	// 1-January-2000
	// 22-February-2000
	// Monday
	/***********************************************************
	***** SIMPLE TEST /

	class A {
	function t() {
	echo get_calling_class();
	}
	}

	class B {