Aptitude | GATE CS 1998 | Question 23
How many substrings of different length (non-zero) can be formed from a character string of length n ?
(A) n
(B) n^2
(C) 2^n
(D) n(n+1)/2
Answer: (D)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post