Find duplicate values v. 2

Inputs

1. value
2. value
3. value

Outputs

Duplicate value (if not exists, then nothing)

Neuron type

Checked - ready to generate algorithm

Patterns

Pattern

Input

Output

1.

1. value:	1
2. value:	a
3. value:	a

Duplicate value (if not exists, then nothing):

a

2.

1. value:	22
2. value:	22
3. value:	S

Duplicate value (if not exists, then nothing):

22

3.

1. value:	3
2. value:	4
3. value:	5

Duplicate value (if not exists, then nothing):

4.

1. value:	a
2. value:	2
3. value:	a

Duplicate value (if not exists, then nothing):

a

5.

1. value:	c
2. value:	c
3. value:	c

Duplicate value (if not exists, then nothing):

c

Applicable neurons

empty string
NOT
NAND
Get first letter
\\b
character {
word city
select .... order by .... asc (A, B, C)

Algorithm

Algorithm doesn't exists

Create your family tree for free