Check whether the given string contains only digit characters in.

Convert a numeric string to array of numbers. It is granted that numbers in array are non-negative.

Всё хуйня, посоны. Последние шесть тестов - битые. Бот не проходит, да и я тоже. Такие дела.

Receive: "true"Expected: "false"Arguments: "[rgkljviptafmzynodqbuwecsxhr]"

Receive: "true"Expected: "false"Arguments: "[nmstxewhzfgrlykbvdcqpjouian]"

Receive: "true"Expected: "false"Arguments: "[zyxwrbuliqncfjvetohsdkmpagzyx]"

Receive: "true"Expected: "false"Arguments: "[smcgdqkejxfwuyotznlrpbahivsmc]"

Receive: "true"Expected: "false"Arguments: "[rgkljviptafmzynodqbuwecsxhr]"

Receive: "true"Expected: "false"Arguments: "[nwzdtsfaloeqipvkmryhjxbcgunwzd]"

Determine whether a given point belongs to a circle.
Tip: to solve the problem, you need to find the hypotenuse.

Find the smallest second number in array.

Зачем давать на вход 2 числа, если известно, что они в форме n и n+1?

Для теста [0,1]: ни 0, ни 1, говоря строго математически, не являются ни простыми, ни составными числами (правда по разным причинам), поэтому их факторизация на простые множители не определена.

Если исходить из предположения, что факторизация 0 и 1 это пустота (nil) в обоих случаях, то nil == nil и ответ true.
А если из соображения что их факторизация это неопределенность (NULL) (к тому же по разным причинам), то NULL != NULL и ответ false.

Разные языки программирования и интерпретаторы трактуют факторизацию этих чисел по разному и выбирать конкретную реализацию за эталон считаю неправильным. А с точки зрения теоретической математики ответ должен быть false.

Либо добавьте в условие пункт "Если число нельзя разложить на простые множители, то считайте факторизацию этого числа равной 0" , либо уберите вообще этот тест =)

It is unclear what to do for a 3-element list, as either difference could be the "typical" difference that you need to fill in for.

Also, for a 2-element list, it does not say that the missing element goes between the two given.

Suggestion: the description on this challenge is actually pretty clear if the test cases are changed to no longer include lists with < 4 elements.

Find square sum of all even numbers in array.

В задаче написано:

"... Arrays can be of different lengths, so if one arrays ends before the other, just continue adding elements from the remaining array"

Пример не соответствует заданию:

"Example: [5,"4",1,"9"] == solution([5,1,3], ["4","9"])"

Тест видимо проверяет такой же вариант:

F
======================================================================
FAIL: test_solution (__main__.TestSolution)
----------------------------------------------------------------------
Traceback (most recent call last):
  File "checker.py", line 15, in test_solution
    self.assertEqual(expected, solution.solution(*arguments), msg)
AssertionError: Lists differ: [4, 2, -4, 2] != [4, 2, -4, 2, -2, 3]

Second list contains 2 additional elements.
First extra element 4:
-2

- [4, 2, -4, 2]
+ [4, 2, -4, 2, -2, 3]
?             +++++++
 : Arguments was: [[4, -4], [2, 2, -2, 3]]

или вот:

F
======================================================================
FAIL: test_solution (__main__.TestSolution)
----------------------------------------------------------------------
Traceback (most recent call last):
  File "checker.py", line 15, in test_solution
    self.assertEqual(expected, solution.solution(*arguments), msg)
AssertionError: Lists differ: [] != [1]

Second list contains 1 additional elements.
First extra element 0:
1

- []
+ [1]
?  +
 : Arguments was: [[], [1]]

Исходный код:

def solution(first_array, second_array):
  result_array = first_array
  for i, item in enumerate(second_array):
    if i < len(first_array):
      result_array.insert(2 * i + 1, item)
    else:
      result_array.append(item)
  return result_array

Calculate array sum from 1 to n.

Checker assumes that something like this is the correct code:

def solution(h, m):
  ang1 = (360.0 / 12) * h + (360.0 / (12 * 60)) * m
  ang2 = (360.0 / 60) * m
  return abs(ang1 - ang2)

But it isn't. A better solution is:

def solution(h, m):
  ang1 = (360.0 / 12) * h + (360.0 / (12 * 60)) * m
  ang2 = (360.0 / 60) * m
  return min(abs(ang1 - ang2), abs(ang1 + 360 - ang2))

It defines the angle between arrows as the smallest angle among clockwise and counterclockwise directions.

Calculate area of triangle using Heron's Formula.

In ruby it's just one method:

def solution(a)
  a.transpose
end

that's not fair comparing to other languages

Задача:

https://files.slack.com/files-pri/T06BMRFQB-F0LUWMMN0/pasted_image_at_2016_02_11_05_21_pm.png

РЕШЕНИЕ:

https://files.slack.com/files-pri/T06BMRFQB-F0LV1SHTK/pasted_image_at_2016_02_11_05_22_pm.png

Проверка в google chrome кода:

https://files.slack.com/files-pri/T06BMRFQB-F0LV2N9QS/pasted_image_at_2016_02_11_05_22_pm.png

Проблема:

В **Example ** solution("( {) } ") = false
в решении задачи solution("( {) } ") = true

Не корректные тесты решения задачи условие в Example.
Хочется, чтобы это были не корректные тесты

Create function that calculates GCD.

Calculate grade of five student subjects.
If grade average is bigger than 90, final grade is A.
If grade average is bigger than 80, final grade is B.
If grade average is bigger than 70, final grade is C.
If grade average is bigger than 60, final grade is D.
In other cases final grade is F.

• Выпилить ненужные(?) модули:
  • reader
  • checker
• Ненужные файлы:
  • issue.example.yml
  • issue\test не конвертированные из старой версии
• Поправить неймспейсы:
  • выпилить :include-macros true
  • выпилить ненужные require
• Обновить зависимости
• Удалить отладочные выводы
• Написать тесты на core
• Поправить Readme.md
  • ссылка на travis

Create a function which takes 2 parameters (str1 and str2) and locates the first occurrence of the str2 in the str1 and returns the position, -1 if not found.

Implement the function that calculates sum of two complex numbers.

Create a function to describe a line passing through two points with coordinates (x1, x1) and (x2, y2). General view of the equation of the line is y = kx + b. If the line cannot be built, then an empty string should be returned.

Determine if the year is a leap year. Leap years are all divisible by 4, with the exception of centuries, which are not divisible by 400.

Find the largest second number in array.

Maybe explicitly specify in a description which numbers would be translated to what (6←→9, 8, 1, 0 to themselves)

https://github.com/Hexlet/battle_asserts/blob/master/src/battle_asserts/issues/fancy_number.clj

Implement the calculation function f(x) by the formula:
f(x) = x^2 for -2 <= x <2;
x^2 + 4x + 5 for x >= 2;
4 for x < -2.
Using this function for n given numbers, calculate f(x). Among the calculated values, find the biggest.

Write a function that takes two string and checks whether it is possible to write the first string with characters from the second string, while respecting the order in which these characters appear in the second string.

"faya" "fgvvfdxcacpolhyghbreda" -> true
"faya" "fgvvfdxcacpolhyghbred" -> false

Сonvert Celsius temperature to Fahrenheit. Use floor rounding for the result temperature.

При прохождении тестов, а также при генерации ассертов (lein run) в некоторых случаях процесс зависает на файле src/battle_asserts/issues/levenshtein_distance.clj . Причина скорее всего в геренераторе аргументов.

https://github.com/Hexlet/battle_asserts/tree/master/src/battle_asserts/issues/credit_card_validator.clj

According to steps given in battle description example card is invalid. But its valid.
Algorithm steps has to be reviewed

© Powered by Evgen Zaytsev

Stairway to heaven

Task:

100 dicks randomly spread out of 100 stairs, there can be as many dicks as you want on one step. We gotta go down these stairs.
Every time you step on a stair-step with dicks, the brat ratio increases by the number of dicks.
You can go down one or two steps at a time. Write a function to descend the stairs minimizing the brat ratio.
The function receives an array with the number of dicks on each step and returns the minimum brat index.

JS solution:

export default stairs => {
  const { length } = stairs;
  if (length === 1) return stairs[0];
  if (length === 2) return Math.min(stairs[1], stairs[0]);

  const iter = (i, acc1, acc2) => {
    if (i === length) return Math.min(acc1, acc2);
    const newAcc1 = stairs[i] + Math.min(acc1, acc2);
    return iter(i + 1, newAcc1, acc1);
  };

  return iter(2, stairs[1], stairs[0]);
};

Tests:

import calcBratIndex from "./index";

let result;

beforeEach(() => (result = []));

it("test 1s", () => {
  for (let i = 0; i < 100; i += 1) {
    result.push(1);
  }
  expect(calcBratIndex(result)).toEqual(50);
});

it("test 1s & 0s", () => {
  for (let i = 0; i < 100; i += 1) {
    const el = i % 2 === 0 ? 1 : 0;
    result.push(el);
  }
  expect(calcBratIndex(result)).toEqual(0);
});

it("short array", () => {
  result = [1, 0, 3, 5, 10, 0, 11, 1];
  while (result.length < 100) {
    result.push(0);
  }
  expect(calcBratIndex(result)).toEqual(6);
});

codesandbox:

https://codesandbox.io/s/angry-bose-jv7ct?file=/src/index.js:0-383

I’ve seen this solution passed tests: (== 26 (count (set s)))

Something like {:expected false :arguments ["0123456789abcdefghijklmnop"]}

Maybe add some uppercase too?

https://github.com/Hexlet/battle_asserts/blob/master/src/battle_asserts/issues/complete_string.clj

эта задача разумным образом не решается на javascript, поскольку нам все double, вследствие чего происходит потеря точности

battle_asserts/src/battle_asserts/issues/arrange_numbers_to_form_biggest_number.clj - all tests accept using of lexicographic order and joining them, but in this method array = [9,1,91] would be 9191, when max number is 9911.

Пытался решить задачу https://github.com/hexlet-codebattle/battle_asserts/blob/master/src/battle_asserts/issues/sort_elements_by_frequency.clj

Проблемы:

1. Очень неочевидный стектрейс – [ Array(16) ] to deeply equal [ Array(16) ]
   2. Если залогировать вывод – кажется все в порядке – [ 3, 3, 3, 3, 0, 0, 0, 0, 4, 4, 1, 1, -2, -2, 2, -4 ] (для входных данных [0,0,3,3,1,-2,3,2,3,1,0,-4,4,0,-2,4])

UPD: Неправильно понял задачу, поэтому понял, в чем проблема, вопрос про стектрейс актуальный.

При проверке даже пустого кода сообщается о синтаксических ошибках.
Прикладываю скрин сообщения об ошибке.

Implement a function that divide two complex numbers. Result Number should be formatted as follows real+imgi or -real+imgi and so on. If number can't be computed, return Division by zero!11!1

It'll be awesome to write issue description with usage of markdown

Create simple calculator that supports next operations: add, substract, divide, multiply, modulo.

Не полные тесты.
Столкнулся с вот таким решением на js:
module.exports = a => {
for(var i=0;i<a.length;i++) {
var q = a.substr(0,a.length-i);
if(a.lastIndexOf(q) > 0)
return q.length;
}
return 0;
}

И человеку засчитало это как правильное решение.

Контрпример: "aab"
В этом случае это решение вернет 1, когда будет i=2, q=="a", "aab".lastIndexOf("a") == 2, return 1;
Хотя правильный ответ 0.
Надо дополнить тесты, что бы такие решения не принимались.

Input: ["4271" "1234"]

• Secret: "4271"
• Guess: "1234"

Output: [1 2]

Exp: 1 bull and 2 cows. (The bull is "2", the cows are "4" and "1".)

https://en.wikipedia.org/wiki/Bulls_and_Cows

Change to

gen/s-pos-int

• https://github.com/hexlet-codebattle/battle_asserts/blob/master/src/battle_asserts/issues/drop_every_n_element.clj#L10
• https://github.com/hexlet-codebattle/battle_asserts/blob/master/src/battle_asserts/issues/missing_number_in_progression.clj#L23

Generate the array of first n prime numbers.

Task:

Two teams playing soccer. Someone is betting on the result of the match, for example 1: 2.
Write a function that takes the assumed and real score as the arguments
and returns 2 if the score is correct, 1 if the winner is correct but
the score is wrong and 0 if the winner is wrong.

JS solution:

export default ([guess1, guess2], [actual1, actual2]) => {
  const guessedDiff = guess2 - guess1;
  const actualDiff = actual2 - actual1;

  if (Math.sign(guessedDiff) !== Math.sign(actualDiff)) return 0;
  if (guess1 === actual1) return 2;
  return 1;
};

tests:

import calcReward from "./index";

it("wrong guess", () => {
  const actual = calcReward([1, 2], [2, 1]);
  expect(actual).toEqual(0);
});

it("correct winner, wrong diff", () => {
  const actual = calcReward([2, 2], [3, 3]);
  expect(actual).toEqual(1);
});

it("correct", () => {
  const actual = calcReward([3, 1], [3, 1]);
  expect(actual).toEqual(2);
});

https://github.com/Hexlet/battle_asserts/blob/master/src/battle_asserts/issues/anagram_finder.clj

expected is [["ssol", "ssol"], ["ryucnot", "ryucnot", "tunycro"]]
apply(:solution, arguments) is [["ryucnot", "ryucnot", "tunycro"], ["ssol", "ssol"]]

Find the maximum absolute value of an array. If array is empty, return -1

E.g. for {drink:-2, respect:-2} tests were throwing when "respect" was chosen. Out of which logic is completely unclear. Different languages may have different internal logic of sorting the keys, and so may iterate in different order, even in randomized.

Create function that calculates LCM (Least Common Multiple)

Implement function that take three numbers and returns square sum of biggest two.

Implement the function that multiply two complex numbers.

Could you please replace site url http://wddx.ru with http://codebattle.io/ in repo description?