Is Find Products with Three Consecutive Digits easy or hard?

It is easy. The acceptance rate is about 80 percent, and the solution is a single regex filter. The main challenge is knowing that [0-9]{3} matches a run of exactly three adjacent digits and that longer runs still match.

How to solve Find Products with Three Consecutive Digits in O(n)?

Scan each name once and track a running count of consecutive digit characters. Reset the count on any non-digit and return the row as soon as the count hits 3. Treat L as a constant for the per-name check, which gives linear time in total input size.

Find Products with Three Consecutive Digits Python or Java solution?

In Python, use re.search(r'[0-9]{3}', name) on each name, or filter a Pandas DataFrame with str.contains(r'[0-9]{3}', regex=True). In Java, use Pattern.compile("[0-9]{3}").matcher(name).find() on each row. The core logic is the same: one regex check per name.

What is the best approach for Find Products with Three Consecutive Digits?

The best approach is regex matching with the pattern [0-9]{3}. It filters rows in one step in MySQL with REGEXP or in Pandas with str.contains. Both run in O(n * L) time, where n is the row count and L is the average name length.

What data structure is used in Find Products with Three Consecutive Digits?

No special data structure is required. You work on strings and the regex engine, which uses a finite automaton internally. The table rows are the only data structure you query.

What is the time complexity of Find Products with Three Consecutive Digits?

The time complexity is O(n * L), where n is the number of products and L is the average length of each name. Each name is scanned once. The extra space is O(1) because the pattern is fixed and no new structures are built.

Is Find Products with Three Consecutive Digits asked at Google, Amazon, or Meta?

This problem is a basic SQL and string-matching exercise, so it is not tied to a single company in our tag data. It appears in SQL practice sets and warm-up rounds. Expect similar pattern-matching questions in database screens at large tech companies.

Description Solution

3415. Find Products with Three Consecutive Digits

Easy80.0% acceptancePremium elsewhere, free here

Table: Products

+-------------+---------+
| Column Name | Type    |
+-------------+---------+
| product_id  | int     |
| name        | varchar |
+-------------+---------+
product_id is the unique key for this table.
Each row of this table contains the ID and name of a product.

Write a solution to find all products whose names contain a sequence of exactly three consecutive digits in a row.

Return the result table ordered by product_id in ascending order.

The result format is in the following example.

Note that the name may contain multiple such sequences, but each should have length three.

Example:

Input:

products table:

+-------------+--------------------+
| product_id  | name               |
+-------------+--------------------+
| 1           | ABC123XYZ          |
| 2           | A12B34C            |
| 3           | Product56789       |
| 4           | NoDigitsHere       |
| 5           | 789Product         |
| 6           | Item003Description |
| 7           | Product12X34       |
+-------------+--------------------+

Output:

+-------------+--------------------+
| product_id  | name               |
+-------------+--------------------+
| 1           | ABC123XYZ          |
| 5           | 789Product         |
| 6           | Item003Description |
+-------------+--------------------+

Explanation:

Product 1: ABC123XYZ contains the digits 123.
Product 5: 789Product contains the digits 789.
Product 6: Item003Description contains 003, which is exactly three digits.

Note:

Results are ordered by product_id in ascending order.
Only products with exactly three consecutive digits in their names are included in the result.

Still stuck?Read the written solution.

Open solution

LanguageLoading editor…

1class Solution:
  def solve(self):
      pass


Starter codePython 3Spaces: 4

Examples

No sample inputs for this problem yet. The examples in the statement show the format.

Your code is saved on this device.Solution