The number of substrings (of all lengths inclusive) that can be formed from a…
GATE · 1994 · CS · Question 1 subparts
The number of substrings (of all lengths inclusive) that can be formed from a character string of length n is
- A.
n
- B.
n²
- C.
n(n−1)/2
- D.
n(n+1)/2
Attempted by 658 students.
Sign up free to check your answer
Sign up freeLoading lesson…