Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by neopentane
1
votes
1
GATE CSE 1989 | Question: 4-i
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
7.0k
views
answered
Jul 20, 2022
Combinatory
gate1989
descriptive
combinatory
normal
proof
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register