dasider41

<?php
function arrayFlat(array $array): array
{
    return array_reduce($array, function ($acc, $item) {
        return array_merge($acc, is_array($item) ? arrayFlat($item) : [$item]);
    }, []);
}

function countItems(array $arr, string $item): int
{

dasider41

const arr = [
  "apple",
  [
    "banana",
    "strawberry",
    "apple",
    ["banana", "strawberry", "apple", ["banana", "strawberry", "apple"]]
  ]
];

dasider41

<?php
/*
https://leetcode.com/problems/two-sum/submissions/

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

dasider41

/*
Write a function:

class Solution { public int solution(int[] A); }

that, given an array A of N integers, returns the smallest positive integer (greater than 0) that does not occur in A.

For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5.

Given A = [1, 2, 3], the function should return 4.

dasider41

<?php
/*
Write a program that outputs the string representation of numbers from 1 to n.

But for multiples of three it should output “Fizz” instead of the number and for the multiples of five output “Buzz”. For numbers which are multiples of both three and five output “FizzBuzz”.

Example:

n = 15,

dasider41

<?php

/*
Given two arrays, write a function to compute their intersection.

Example 1:

Input: nums1 = [1,2,2,1], nums2 = [2,2]
Output: [2,2]
Example 2:

dasider41

<?php

/*
In Pascal's triangle, each number is the sum of the two numbers directly above it.

Example:

Input: 5
Output:
[

dasider41

<?php
/*
Find First and Last Position of Element in Sorted Array

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

Your algorithm's runtime complexity must be in the order of O(log n).

If the target is not found in the array, return [-1, -1].

dasider41

<?php
/*
 Range Sum Query 2D - Immutable
Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).

Example:
Given matrix = [
  [3, 0, 1, 4, 2],
  [5, 6, 3, 2, 1],
  [1, 2, 0, 1, 5],

dasider41

/*
Rotate Function

Given an array of integers A and let n to be its length.

Assume Bk to be an array obtained by rotating the array A k positions clock-wise, we define a "rotation function" F on A as follow:

F(k) = 0 * Bk[0] + 1 * Bk[1] + ... + (n-1) * Bk[n-1].

Calculate the maximum value of F(0), F(1), ..., F(n-1).