g0101_0200.s0180_consecutive_numbers.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-kotlin Show documentation
Show all versions of leetcode-in-kotlin Show documentation
Kotlin-based LeetCode algorithm problem solutions, regularly updated
180\. Consecutive Numbers
Medium
SQL Schema
Table: `Logs`
+-------------+---------+
| Column Name | Type |
+-------------+---------+
| id | int |
| num | varchar |
+-------------+---------+
id is the primary key for this table.
Write an SQL query to find all numbers that appear at least three times consecutively.
Return the result table in **any order**.
The query result format is in the following example.
**Example 1:**
**Input:**
Logs table:
+----+-----+
| id | num |
+----+-----+
| 1 | 1 |
| 2 | 1 |
| 3 | 1 |
| 4 | 2 |
| 5 | 1 |
| 6 | 2 |
| 7 | 2 |
+----+-----+
**Output:**
+-----------------+
| ConsecutiveNums |
+-----------------+
| 1 |
+-----------------+
**Explanation:** 1 is the only number that appears consecutively for at least three times.