[LeetCode]#182. Duplicate Emails

+----+---------+
| Id | Email |
+----+---------+
| 1 | a@b.com |
| 2 | c@d.com |
| 3 | a@b.com |
+----+---------+
+---------+
| Email |
+---------+
| a@b.com |
+---------+
# Write your MySQL query statement below
select Email
from Person
group by Email
having count(Email) > 1;

--

--

--

Interesting in any computer science.

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

The rise (and importance) of native spatial tools for a spatial computer era

Structural Software Design Patterns in SOLID Data Science (Pt. 2)

Roberts conversational guide to running ShipIt

5 Transcription Hacks to use in 2021 to halve your workflow.

MuesliSwap audit competition

How to Install easily Spark for Python

Tutorial Fuzzy Logic Mamdani for Arduino

Tutorial Fuzzy Logic Mamdani for Arduino

The Top 5 Use-Cases for Persistence in OpenHAB

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Fatboy Slim

Fatboy Slim

Interesting in any computer science.

More from Medium

LeetCode — First Bad Version

LeetCode Patterns Adventure 27 — Lowest Common Ancestor of a Binary Search Tree

Leetcode Easy: Binary Tree Inorder Traversal

Binary tree with a root of one. No left node, right node of 2.Node 2 has a left node of 3

Find All Numbers Disappeared in an Array (space complexity O(n) and O(1)