Hacker Rank "Division Sum pairs" solution

Question :---

You are given an array of

integers,

, and a positive integer,

. Find and print the number of

pairs where

and

is divisible by

For example,

and

. Our three pairs meeting the criteria are

and

Function Description

Complete the divisibleSumPairs function in the editor below. It should return the integer count of pairs meeting the criteria.

divisibleSumPairs has the following parameter(s):

n: the integer length of array
ar: an array of integers
k: the integer to divide the pair sum by

Input Format

The first line contains

space-separated integers,

and

.
The second line contains

space-separated integers describing the values of

Constraints

Output Format

Print the number of

pairs where

and

is evenly divisible by

Sample Input

6 3
1 3 2 6 1 2

Sample Output

Explanation

Here are the

valid pairs when

Solution : -

<?php

/* Write your PHP code here */

$ar = array(1,3,2,6,1,2);

$k = 3;

$n = 6;

$count = 0;

$sum = 0;

for($i=0;$i<$n-1;$i++){

for($j=$i+1;$j<$n;$j++){

$sum = $ar[$i] + $ar[$j];

if($sum % $k == 0){

$count++;

}

echo $count;

Comments

PHP Hacker Rank Question "Birthday Cake Candles" solution !

You are in-charge of the cake for your niece's birthday and have decided the cake will have one candle for each year of her total age. When she blows out the candles, she’ll only be able to blow out the tallest ones. Your task is to find out how many candles she can successfully blow out. For example, if your niece is turning years old, and the cake will have candles of height , , , , she will be able to blow out candles successfully, since the tallest candle is of height and there are such candles. Function Description Complete the function birthdayCakeCandles in the editor below. It must return an integer representing the number of candles she can blow out. birthdayCakeCandles has the following parameter(s): k : the integer threshold of students on time for class to continue a : an array of integers representing student arrival times Input Format The first line...

PHP Hacker rank Question solution Mini-Max sum in PHP

Given five positive integers, find the minimum and maximum values that can be calculated by summing exactly four of the five integers. Then print the respective minimum and maximum values as a single line of two space-separated long integers. For example, . Our minimum sum is and our maximum sum is . We would print 26 24 Function Description Complete the miniMaxSum function in the editor below. It should print two space-separated integers on one line: the minimum sum and the maximum sum of of elements. miniMaxSum has the following parameter(s): arr : an array of integers Input Format A single line of five space-separated integers. Constraints Output Format Print two space-separated long integers denoting the respective minimum and maximum values that can be calculated by summing exactly four of the five integers. (The output can be greater than a 32 bi...

PHP Hacker Rank "Apple and Orange" Solution

Sam's house has an apple tree and an orange tree that yield an abundance of fruit. In the diagram below, the red region denotes his house, where is the start point, and is the endpoint. The apple tree is to the left of his house, and the orange tree is to its right. You can assume the trees are located on a single point, where the apple tree is at point , and the orange tree is at point . When a fruit falls from its tree, it lands units of distance from its tree of origin along the -axis. A negative value of means the fruit fell units to the tree's left, and a positive value of means it falls units to the tree's right. Given the value of for apples and oranges, determine how many apples and oranges will fall on Sam's house (i.e., in the inclusive range )? For example, Sam's house is between and . The apple tree ...

ajayyadavexpo.com

Search This Blog