Number of Distinct Substrings in a String: coding question

Available question text

Count the number of distinct substrings of a given string. Efficient solutions use suffix automata or suffix array + LCP (or rolling hashes) to avoid quadratic enumeration and run in O(n)–O(n log n) time for large n.

Continue with questions that share topics or the same question type.

Split a String Into the Max Number of Unique Substrings
Coding
Binary String With Substrings Representing 1 To N
Coding
Check if String Is Decomposable Into Value-Equal Substrings
Coding
Construct Smallest Number From DI String
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 1698. Number of Distinct Substrings in a String
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

Number of Distinct Substrings in a String

Available question text

Related questions

Number of Distinct Substrings in a String

Available question text

Related questions