Quick Overview

Count all nonempty contiguous substrings of a lowercase string that contain no repeated character. The input may contain 100,000 characters, and equal substring text still counts separately when it comes from different positions.

Count Substrings with No Repeated Characters

Company: NVIDIA

Role: Software Engineer

Category: Coding & Algorithms

Difficulty: hard

Interview Round: Technical Screen

Overview: Count all nonempty contiguous substrings of a lowercase string that contain no repeated character. The input may contain 100,000 characters, and equal substring text still counts separately when it comes from different positions.

Loading…