Number of Substrings with distinct characters

In this article, we have explored various algorithms that will help us in determining the number of substrings that a string can have with distinct characters.

We will be exploring the following algorithms:

Naive algorithm, with a time complexity of O(n³)Optimized naive algorithm, with a time complexity of O(n²)Optimized algorithm with hash mapping, with a time complexity of O(n)

Table of content:

Understanding the problem(1) Naive algorithm(2) Optimized naive algorithm(3) Optimized algo...