Sprinklr SDE Interview Question 2024 August| Advanced Data Structures (Tries) | On-campus

Question 1: Number of Distinct Substrings Problem Statement Given a string S of length N consisting of lowercase English letters, find the total number of strictly distinct substrings that can be formed from the string. Two substrings are distinct if they contain different characters or occur at different lengths. Note that an empty string is NOT considered a valid distinct substring in this problem. Constraints 1 <= N <= 1000 String consists of lowercase English letters. Example Input: s = ...