Roman Borisoglebskyi flymio

flymio / apple_and_orange.php

Created October 6, 2018 23:08

solution for https://www.hackerrank.com/challenges/apple-and-orange/

	<?php

	// Complete the countApplesAndOranges function below.
	function countApplesAndOranges($s, $t, $a, $b, $apples, $oranges) {
	$ap = 0; $or = 0;
	foreach($apples as $c){
	$g = $a+$c;
	if ($g >= $s && $g <=$t){
	$ap++;
	}

flymio / kangaroo.php

Created October 6, 2018 23:20

https://www.hackerrank.com/challenges/kangaroo/

	<?php

	// Complete the kangaroo function below.
	function kangaroo($x1, $v1, $x2, $v2) {
	$xc1=$x1; $xc2=$x2;
	for($i=$x1;$i<$x2;$i++){
	$xc1+=$v1;
	$xc2+=$v2;
	if ($xc1==$xc2) return "YES";
	}

flymio / between_two_sets.php

Created October 7, 2018 00:09

solution for https://www.hackerrank.com/challenges/between-two-sets/

	<?php

	/*
	* Complete the getTotalX function below.
	*/
	function getTotalX($a, $b) {
	$f = lcm($a);
	$l = gcd($b);
	$count = 0;

flymio / breaking-best-and-worst-records.php

Created January 2, 2019 14:33

solution for https://www.hackerrank.com/challenges/breaking-best-and-worst-records

	<?php

	// Complete the breakingRecords function below.
	function breakingRecords($scores) {
	$max = $scores[0]; $min = $scores[0];
	$max_count=0;
	$min_count=0;
	foreach($scores as $value){
	if ($value>$max){
	$max=$value; $max_count++;

flymio / sock-merchant.php

Created January 3, 2019 18:02

solution for https://www.hackerrank.com/challenges/sock-merchant/

	<?php

	// Complete the sockMerchant function below.
	function sockMerchant($n, $ar) {
	$arnew = array();
	$cnt=0;
	foreach($ar as $val){
	if (isset($arnew[$val])){
	$cnt++;
	unset($arnew[$val]);

flymio / the-birthday-bar.php

Created January 21, 2019 15:31

solution for https://www.hackerrank.com/challenges/the-birthday-bar/

	<?php

	// Complete the birthday function below.
	function birthday($s, $d, $m) {
	$tot = 0;
	for($i=0;$i<=sizeof($s)-1;$i++){
	$cnt=1;$sum=$s[$i];$ok=0;
	for($j=$i+1;$j<=sizeof($s)-1;$j++)
	{
	$cnt++;

flymio / divisible-sum-pairs.pl

Created January 21, 2019 15:57

solution for https://www.hackerrank.com/challenges/divisible-sum-pairs/

	#!/usr/bin/perl
	use Data::Dumper;
	use strict;
	use warnings;

	# Complete the divisibleSumPairs function below.
	sub divisibleSumPairs {
	my $n = shift;
	my $k = shift;
	my $ar = shift;

flymio / test_buttons_resize.html

Last active February 8, 2019 18:07

flymio / longest-substring-without-repeating-characters.php

Created February 19, 2019 22:09

	<?

	function lengthOfLongestSubstring($s) {
	$a = str_split($s);
	$max = '';
	$cur = '';
	$ch = '';
	for($i=0;$i<sizeof($a);$i++){
	$g = explode($a[$i],$cur);

flymio / basket.js

Last active October 8, 2021 14:31

	sep = Brackets.templateLiteral;
	// склонение числительных
	function declOfNum(number, titles) {
	cases = [2, 0, 1, 1, 1, 2];
	return titles[ (number%100>4 && number%100<20)? 2 : cases[(number%10<5)?number%10:5] ];
	}

	// всякая херня типа расчета суммы заказа (товары+доставка) и пр. - макросы
	Brackets.addFilter('priceQ', function (price, quantity) {
	return (parseFloat(price) * parseFloat(quantity)).toFixed(2);