How to get all the possible K length Substrings in a String in C# - Step by Step Examples

How to get all the possible K length Substrings in a String in C# ?

Answer

To get all possible K length substrings of a string in C#, you can use nested loops to iterate through each possible substring.

✐ Examples

1 All Substrings of Length 3 in 'Hello World'

In this example,

We declare a variable str with a value of "Hello World".
We initialize an empty list substrings to store all substrings of length 3.
We use nested loops to iterate through each possible start and end index for the substring.
Within the loops, we extract the substring using substring method and add it to the substrings list.
Finally, we print the substrings list.

C# Program

using System;
using System.Collections.Generic;
class Program
{
    static void Main()
    {
        string str = "Hello World";
        int k = 3;
        List<string> substrings = new List<string>();
        for (int i = 0; i <= str.Length - k; i++)
        {
            for (int j = i; j < i + k; j++)
            {
                substrings.Add(str.Substring(i, j - i + 1));
            }
        }
        Console.WriteLine("All substrings of length " + k + ": " + string.Join(" ", substrings));
    }
}

Output

All substrings of length 3: Hel ell llo lo  o W  Wo Wor orl rld

Summary

In this tutorial, we learned How to get all the possible K length Substrings in a String in C# language with well detailed examples.

◀ Previous Next ▶

C# Tutorials

C# How-Tos