Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Divide a string in N equal parts

  • Difficulty Level : Easy
  • Last Updated : 31 Aug, 2021

Difficulty Level: Rookie
Question: 
Write a program to print N equal parts of a given string. 
Solution: 
1) Get the size of the string using string function strlen() (present in the string.h) 
2) Get the size of a part. 

  
     part_size = string_length/n

3) Loop through the input string. In loop, if index becomes multiple of part_size then put a part separator(“\n”)
Implementation: 
 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

C++




// C++ program to divide a string
// in n equal parts
#include <iostream>
#include <string.h>
 
using namespace std;
 
class gfg {
 
    // Function to print n equal parts of str
public:
    void divideString(char str[], int n)
    {
 
        int str_size = strlen(str);
        int i;
        int part_size;
 
        // Check if string can be divided in
        // n equal parts
        if (str_size % n != 0) {
            cout << "Invalid Input: String size";
            cout << " is not divisible by n";
            return;
        }
 
        // Calculate the size of parts to
        // find the division points
        part_size = str_size / n;
        for (i = 0; i < str_size; i++) {
            if (i % part_size == 0)
                cout << endl;
            cout << str[i];
        }
    }
};
 
// Driver code
int main()
{
    gfg g;
 
    // length od string is 28
    char str[] = "a_simple_divide_string_quest";
 
    // Print 4 equal parts of the string
    g.divideString(str, 4);
    return 0;
}
 
// This code is contributed by SoM15242
C



// C program to divide a string
// in n equal parts
#include <stdio.h>
#include <string.h>
 
// Function to print n equal parts of str
void divideString(char* str, int n)
{
    int str_size = strlen(str);
    int i;
    int part_size;
 
    // Check if string can be divided in
    // n equal parts
    if (str_size % n != 0) {
        printf("Invalid Input: String size");
        printf(" is not divisible by n");
        return;
    }
 
    // Calculate the size of parts to
    // find the division points
    part_size = str_size / n;
    for (i = 0; i < str_size; i++) {
        if (i % part_size == 0)
            printf("\n");
        printf("%c", str[i]);
    }
}
 
int main()
{
    // length od string is 28
    char* str = "a_simple_divide_string_quest";
 
    // Print 4 equal parts of the string
    divideString(str, 4);
 
    getchar();
    return 0;
}
Java



// Java program to divide a string
// in n equal parts
 
class GFG {
    // Method to print n equal parts of str
    static void divideString(String str, int n)
    {
        int str_size = str.length();
        int part_size;
 
        // Check if string can be divided in
        // n equal parts
        if (str_size % n != 0) {
            System.out.println("Invalid Input: String size"
                               + "is not divisible by n");
            return;
        }
 
        // Calculate the size of parts to find
        // the division points
        part_size = str_size / n;
 
        for (int i = 0; i < str_size; i++) {
            if (i % part_size == 0)
                System.out.println();
            System.out.print(str.charAt(i));
        }
    }
 
    // Driver Code
    public static void main(String[] args)
    {
        // length od string is 28
        String str = "a_simple_divide_string_quest";
 
        // Print 4 equal parts of the string
        divideString(str, 4);
    }
}
Python



# Python program to print n equal parts of string
 
# Function to print n equal parts of string
 
 
def divideString(string, n):
    str_size = len(string)
 
    # Check if string can be divided in n equal parts
    if str_size % n != 0:
        print "Invalid Input: String size is not divisible by n"
        return
 
    # Calculate the size of parts to find the division points
    part_size = str_size/n
    k = 0
    for i in string:
        if k % part_size == 0:
            print "\n",
        print i,
        k += 1
 
 
# Driver program to test the above function
# Length of string is 28
string = "a_simple_divide_string_quest"
 
# Print 4 equal parts of the string
divideString(string, 4)
 
# This code is contributed by Bhavya Jain
C#



// C# program to divide a string
// in n equal parts
using System;
 
class GFG {
 
    // Method to print n
    // equal parts of str
    static void divideString(String str, int n)
    {
        int str_size = str.Length;
        int part_size;
 
        // Check if string
        // can be divided in
        // n equal parts
        if (str_size % n != 0) {
            Console.Write("Invalid Input: String size"
                          + "is not divisible by n");
            return;
        }
 
        // Calculate the size
        // of parts to find
        // the division points
        part_size = str_size / n;
 
        for (int i = 0; i < str_size; i++) {
            if (i % part_size == 0)
                Console.WriteLine();
            Console.Write(str[i]);
        }
    }
 
    // Driver Code
    static void Main()
    {
 
        // length od string is 28
        String str = "a_simple_divide_string_quest";
 
        // Print 4 equal parts of the string
        divideString(str, 4);
    }
}
 
// This code is contributed by Anuj_67
PHP



<?php
// PHP program to divide a string
// in n equal parts
 
// Function to print n
// equal parts of str
function divideString($str, $n)
{
    $str_size = strlen($str);
    $i;
    $part_size;
 
// Check if string can be divided
// in n equal parts
if ($str_size % $n != 0)
{
    echo "Invalid Input: String size";
    echo " is not divisible by n";
    return;
}
 
// Calculate the size of parts to
// find the division point
$part_size = $str_size / $n;
for ($i = 0; $i< $str_size; $i++)
{
    if ($i % $part_size == 0)
        echo "\n";
    echo $str[$i];
}
}
 
    // Driver Code
    // length od string is 28
    $str = "a_simple_divide_string_quest";
 
    // Print 4 equal parts of the string
    divideString($str, 4);
 
// This code is contributed by ajit.
?>
Javascript



<script>
    // Javascript program to divide a string
    // in n equal parts
     
    // Method to print n
    // equal parts of str
    function divideString(str, n)
    {
        let str_size = str.length;
        let part_size;
 
        // Check if string
        // can be divided in
        // n equal parts
        if (str_size % n != 0)
        {
            document.write("Invalid Input: String size" +
                          "is not divisible by n");
            return;
        }
 
        // Calculate the size
        // of parts to find
        // the division points
        part_size = parseInt(str_size / n, 10);
 
        for (let i = 0; i< str_size; i++)
        {
            if(i % part_size == 0)
                document.write("</br>");
            document.write(str[i]);
        }
    }
       
    // length od string is 28
    let str = "a_simple_divide_string_quest";
 
    // Print 4 equal parts of the string
    divideString(str, 4);
     
    // This code is contributed by rameshtravel07
</script>
Output


a_simpl
e_divid
e_strin
g_quest
In the above solution, n equal parts of the string are only printed. If we want individual parts to be stored, we need to allocate part_size + 1 memory for all N parts (1 extra for string termination character ‘\0’) and store the addresses of the parts in an array of character pointers. 
Another Approach: Using STL in C++
 
C++



#include <iostream>
 
using namespace std;
 
void divide(string str, int n)
{
 
    if (str.length() % n != 0) {
        cout << "Invalid Input: String size";
        cout << " is not divisible by n";
        return;
    }
 
    int parts = str.length() / n;
    int start = 0;
 
    while (start < str.length()) {
        cout << str.substr(start, parts) << endl;
        start += parts;
        // if(start < str.length()) cout << endl; to ignore
        // final new line
    }
}
 
int main()
{
    string str = "a_simple_divide_string_quest";
    divide(str, 4);
}
 
//Contributed By Jagadeesh
Java



import java.util.*;
 
class GFG {
 
    static void divide(String str, int n) {
 
        if (str.length() % n != 0) {
            System.out.print("Invalid Input: String size");
            System.out.print(" is not divisible by n");
            return;
        }
 
        int parts = str.length() / n;
        int start = 0;
        int t = parts;
        while (start < str.length()) {
            String temp = new String(str);
 
            System.out.print(temp.substring(start, parts) + "\n");
            start = parts;
            parts += t;
            // if(start < str.length()) System.out.println(); to ignore
            // final new line
        }
    }
 
  // Driver code
    public static void main(String[] args) {
        String str = "a_simple_divide_String_quest";
        divide(str, 4);
    }
}
 
// This code is contributed by umadevi9616
Output
a_simpl
e_divid
e_strin
g_quest
Plein case write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 



My Personal Notes
arrow_drop_up
Previous
Breaking a number such that first part is integral division of second by a power of 10
Next

Given a string, find its first non-repeating character
Recommended Articles
Page :
Split a string in equal parts such that all parts are palindromes
27, Dec 18
Partition the string in two parts such that both parts have at least k different characters
03, Jul 19
Divide a number into two parts
08, Apr 19
Count ways to partition a string such that both parts have equal distinct characters
08, Apr 20
Split the string into minimum parts such that each part is in the another string
12, Jun 20
Divide given numeric string into at most two increasing subsequences which form an increasing string upon concatenation
03, Sep 21
Partition a number into two divisible parts
27, Jan 17
Divide large number represented as string
22, Jun 17
Number of ways to divide string in sub-strings such to make them in lexicographically increasing sequence
11, Nov 19
Minimize count of alternating subsequences to divide given Binary String with subsequence number
17, Nov 21
Count characters of a string which when removed individually makes the string equal to another string
09, Jun 21
Karatsuba algorithm for fast multiplication using Divide and Conquer algorithm
18, Apr 13
Longest Common Prefix using Divide and Conquer Algorithm
22, Jun 16
String Range Queries to find the number of subsets equal to a given String
14, Aug 19
Check if a string can be made equal to another string by swapping or replacement of characters
24, Jan 21
Length of longest substring to be deleted to make a string equal to another string
15, Sep 20
Check whether two strings can be made equal by reversing substring of equal length from both strings
15, Jul 20
Check length of a string is equal to the number appended at its last
16, Jan 17
Find an equal point in a string of brackets
08, Apr 17
Longest sub-string having frequency of each character less than equal to k
29, Dec 17
Count number of equal pairs in a string
02, Jan 18
Append a digit in the end to make the number equal to the length of the remaining string
17, Jul 19
Program to check if first and the last characters of string are equal
04, Apr 18
Form lexicographically smallest string with minimum replacements having equal number of 0s, 1s and 2s
28, Jan 19
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox