Tool to find common items in two lists. The operation of intersection of two lists consists in finding a set of all elements present in both list 1 and list 2.

dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day! A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!

Tool to find common items in two lists. The operation of intersection of two lists consists in finding a set of all elements present in both list 1 and list 2.

Answers to Questions

How to find common items present in two lists?

dCode detects items in the lists and display common points between the two sets (i.e. the elements present in both List 1 and List 2).

Example: List 1 : 2, 4, 6, 8, 10, 12, 14, 16, 18, 20 (list of even numbers) List 2 : 2, 3, 5, 7, 11, 13, 17, 19 (list of prime numbers) Common item : 2

dCode also can detect différences between lists but also return statistical data such as precision and recall.

What is an intersection operation?

An intersection is the name given to the mathematical operation that identifies common items between two lists. It is a comparison set operator (from the set theory).

The equivalent of the intersection in the Boolean logic is the operator AND.

Example:A AND B is true only if A is true and B is true

How to represent an set intersection?

It is common to represent the common elements with a Venn diagram (with 2 rings).

Source code

dCode retains ownership of the online 'Items in Common' tool source code. Except explicit open source licence (indicated CC / Creative Commons / free), any algorithm, applet or snippet (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt / encrypt, decipher / cipher, decode / encode, translate) written in any informatic language (PHP, Java, C#, Python, Javascript, Matlab, etc.) no data, script or API access will be for free, same for Items in Common download for offline use on PC, tablet, iPhone or Android !

Need Help ?

Please, check our community Discord for help requests!