Contains string substring?

Inputs

  • String
  • Searched substring

Outputs

  • 1/0

Neuron type

Best algorithm has been found - locked

Patterns

Pattern Input Output
1.
String: 123456
Searched substring: 3
1/0: 1
2.
String: abc
Searched substring: d
1/0: 0
3.
String: Marry and Chris
Searched substring: and
1/0: 1
4.
String: neuron
Searched substring: X
1/0: 0

Applicable neurons

  • 0
  • Position
  • IF
  • a > b
  • a = b
  • IF a=b THEN c ELSE d
  • character l
  • [a, b)
  • character }
  • get minutes from time (hh:mm:ss)

Algorithm

Test

Code made by AI:
/**
 * 0: 
 *
 * @return {Array}
 */
function neuron500()
{
return [0];
}

/**
 * Position: Search position substring of string
 *
 * @param x1 MyString
 * @param x2 FindMe
 * @return {Array}
 */
function neuron523(x1, x2)
{
return [x1.toString().indexOf(x2.toString())];
}

/**
 * a > b: IF a>b THEN 1 ELSE 0;
 *
 * @param x1 a
 * @param x2 b
 * @return {Array}
 */
function neuron589(x1, x2)
{
return [(Number(x1) > Number(x2)) ? 1 : 0];
}

/**
 * Contains string substring?: 
 * 
 * @param x1 String
 * @param x2 Searched substring
 * @return {Array}
 */
function neuron824(x1, x2)
{
  var outputs = [];
  outputs[0] = x1;
  outputs[1] = x2;

  arr = neuron500();
  outputs[2] = arr[0];

  arr = neuron523(outputs[0], outputs[1]);
  outputs[3] = arr[0];

  arr = neuron589(outputs[3], outputs[2]);
  outputs[4] = arr[0];

  return[outputs[4]];
}


Code made by AI:

Create your family tree for free