Structuring the Document in C - Hacker Rank Solution

CodeWorld19

21 May, 2020

Problem

A document is represented as a collection paragraphs, a paragraph is represented as a collection of sentences, a sentence is represented as a collection of words and a word is represented as a collection of lower-case ([a-z]) and upper-case ([A-Z]) English characters. You will convert a raw text document into its component paragraphs, sentences and words. To test your results, queries will ask you to return a specific paragraph, sentence or word as described below.

Alicia is studying the C programming language at the University of Dunkirk and she represents the words, sentences, paragraphs, and documents using pointers:

A word is described by:

struct word {
    char* data;
};

A sentence is described by:

struct sentence {
    struct word* data;
    int word_count;//the number of words in a sentence
};

The words in the sentence are separated by one space (" "). The last word does not end with a space.

A paragraph is described by:

struct paragraph {
    struct sentence* data  ;
    int sentence_count;//the number of sentences in a paragraph
};

The sentences in the paragraph are separated by one period (".").

A document is described by:

struct document {
    struct paragraph* data;
    int paragraph_count;//the number of paragraphs in a document
};

The paragraphs in the document are separated by one newline("\n"). The last paragraph does not end with a newline.

For example:

Learning C is fun.
Learning pointer is more fun.it is good to have pointers.

The only sentence in the first paragraph could be represented as:

struct sentence first_sentence_in_first_paragraph;
first_sentence_in_first_paragraph.data = {"Learning", "C", "is", "fun"};

The first paragraph itself could be represented as:

struct paragraph first_paragraph;
first_paragraph.data = {{"Learning", "C", "is", "fun"}};

The first sentence in the second paragraph could be represented as:

struct sentence first_sentence_in_second_paragraph;
first_sentence_in_second_paragraph.data = {"Learning", "pointers", "is", "more", "fun"};

The second sentence in the second paragraph could be represented as:

struct sentence second_sentence_in_second_paragraph;
second_sentence_in_second_paragraph.data = {"It", "is", "good", "to", "have", "pointers"};

The second paragraph could be represented as:

struct paragraph second_paragraph;
second_paragraph.data = {{"Learning", "pointers", "is", "more", "fun"}, {"It", "is", "good", "to", "have", "pointers"}};

Finally, the document could be represented as:

struct document Doc;
Doc.data = {{{"Learning", "C", "is", "fun"}}, {{"Learning", "pointers", "is", "more", "fun"}, {"It", "is", "good", "to", "have", "pointers"}}};

Alicia has sent a document to her friend Teodora as a string of characters, i.e. represented by char* not struct document. help her convert the document to struct document from by completing the following function :

void initialise_document(char* text) to initialise the document. you have to intialise the global variable Doc of type struct document.
struct paragraph kth_paragraph(int k) to return the kth paragraph in the document.
struct sentence kth_sentence_in_mth_paragraph(int k, int m) to return the kth sentence in the mth paragraph.
struct word kth_word_in_mth_sentence_of_nth_paragraph(int k, int m, int n) to return the kth word in the mth sentence of the nth paragraph.

input Format :

The first line contains the integer paragraph_count.

Each of the next paragraph_count line contains a paragraph as a single string.

The next line contains the integer q, the number of queries.

Each of the next q lines contains a query in one of the following formats:

1 k: this corresponds to calling the function kth_paragraph.
2 k m: this corresponding to calling the function kth_sentence_in_mth_paragraph.
3 k m n: this corresponds to calling the function kth_word_in_mth_sentence_of_nth_paragraph

Constraints :

The text which is passed to get_document has words separated by a spaces (" "), sentences separated by a period(".") and paragraphs separated by a newline("\n").
The last word in a sentence does not end with a space.
The last paragraph does not end with a newline.
The words contain only upper-case and lower-case English letters.
1 <= number of characters in the entire document <= 1000.
1 <= number of paragraphs in the entire document <= 5.

Output Format :

Print the paragraph, sentence or the word corresponding to the query to check the logic of your code.

Sample Input :

2
Learning C is fun.
Learning pointers is more fun.It is good to have pointers.
3
1 2
2 1 1
3 1 1 1

Sample Output :

Learning pointers is more fun.It is good to have pointers.
Learning C is fun
Learning

Explanation :

The first query returns the second paragraph.
The second query returns the first sentence of the first paragraph.
The third query returns the first word of the first sentence of the first paragraph.

Solution :

//Structuring the Document in C - Hacker Rank Solution
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#define MAX_CHARACTERS 1005
#define MAX_PARAGRAPHS 5

struct word 
{
    char* data;
};

struct sentence 
{
    struct word* data;
    int word_count;//denotes number of words in a sentence
};

struct paragraph 
{
    struct sentence* data  ;
    int sentence_count;//denotes number of sentences in a paragraph
};

struct document 
{
    struct paragraph* data;
    int paragraph_count;//denotes number of paragraphs in a document
};

/* Start the program Structuring the Document in C - Hacker rank Solution */

struct document get_document(char* text)
{
    struct document doc;
    struct paragraph *cur_paragraph = NULL;
    struct sentence *cur_sentence = NULL;
    char *new_word = NULL;

    doc.data = NULL;
    doc.paragraph_count = 0;

    for (char *s = text; *s; ++s)
    {
        if (*s == ' ' || *s == '.')
        {
            
            if (cur_paragraph == NULL)
            {
                doc.paragraph_count++;
                doc.data = (struct paragraph *) realloc(doc.data, sizeof(struct paragraph) * doc.paragraph_count);

                cur_paragraph = doc.data + doc.paragraph_count - 1;
                cur_paragraph->data = NULL;
                cur_paragraph->sentence_count = 0;

                cur_sentence = NULL;
            }
            if (cur_sentence == NULL)
            {
                cur_paragraph->sentence_count++;
                cur_paragraph->data = (struct sentence *) realloc(cur_paragraph->data, sizeof(struct sentence) * cur_paragraph->sentence_count);

                cur_sentence = cur_paragraph->data + cur_paragraph->sentence_count - 1;
                cur_sentence->data = NULL;
                cur_sentence->word_count = 0;
            }

            cur_sentence->word_count++;
            cur_sentence->data = (struct word *) realloc(cur_sentence->data, sizeof(struct word) * cur_sentence->word_count);
            cur_sentence->data[cur_sentence->word_count - 1].data = new_word;
            new_word = NULL;

            if (*s == '.')
                cur_sentence = NULL;       
            *s = 0;
        }

        else if (*s == '\n')
        {
            cur_sentence = NULL;
            cur_paragraph = NULL;
        }
        else
        {
            if (new_word == NULL)
            {
                new_word = s;
            }
        }
    }

    return doc;
}

struct word kth_word_in_mth_sentence_of_nth_paragraph(struct document Doc, int k, int m, int n)
{
    return Doc.data[n - 1].data[m - 1].data[k - 1];
}

struct sentence kth_sentence_in_mth_paragraph(struct document Doc, int k, int m)
{
    return Doc.data[m - 1].data[k - 1];
}

struct paragraph kth_paragraph(struct document Doc, int k)
{
    return Doc.data[k - 1];
}

/* end the program Structuring the Document in C - Hacker rank Solution */

void print_word(struct word w) 
{
    printf("%s", w.data);
}

void print_sentence(struct sentence sen) 
{
    for(int i = 0; i < sen.word_count; i++) 
    {
        print_word(sen.data[i]);
        if (i != sen.word_count - 1) 
        {
            printf(" ");
        }
    }
}

void print_paragraph(struct paragraph para) 
{
    for(int i = 0; i < para.sentence_count; i++)
    {
        print_sentence(para.data[i]);
        printf(".");
    }
}

void print_document(struct document doc) 
{
    for(int i = 0; i < doc.paragraph_count; i++) 
    {
        print_paragraph(doc.data[i]);
        if (i != doc.paragraph_count - 1)
            printf("\n");
    }
}

char* get_input_text() 
{	
    int paragraph_count;
    scanf("%d", &paragraph_count);

    char p[MAX_PARAGRAPHS][MAX_CHARACTERS], doc[MAX_CHARACTERS];
    memset(doc, 0, sizeof(doc));
    getchar();
    for (int i = 0; i < paragraph_count; i++) 
    {
        scanf("%[^\n]%*c", p[i]);
        strcat(doc, p[i]);
        if (i != paragraph_count - 1)
            strcat(doc, "\n");
    }

    char* returnDoc = (char*)malloc((strlen (doc)+1) * (sizeof(char)));
    strcpy(returnDoc, doc);
    return returnDoc;
}

int main() 
{
    char* text = get_input_text();
    struct document Doc = get_document(text);

    int q;
    scanf("%d", &q);

    while (q--) 
    {
        int type;
        scanf("%d", &type);

        if (type == 3)
        {
            int k, m, n;
            scanf("%d %d %d", &k, &m, &n);
            struct word w = kth_word_in_mth_sentence_of_nth_paragraph(Doc, k, m, n);
            print_word(w);
        }

        else if (type == 2) 
        {
            int k, m;
            scanf("%d %d", &k, &m);
            struct sentence sen= kth_sentence_in_mth_paragraph(Doc, k, m);
            print_sentence(sen);
        }

        else
        {
            int k;
            scanf("%d", &k);
            struct paragraph para = kth_paragraph(Doc, k);
            print_paragraph(para);
        }
        printf("\n");
    }     
}

Disclaimer :-

the above whole problem statement is given by hackerrank.com but the solution is generated by the codeworld19 authority if any of the query regarding this post or website fill the following contact form thank you.

CodeWorld19

Hey, I am Parthe Omkar

Anonymous Tuesday, August 16, 2022

I enjoyed your blog Thanks for sharing such an informative post. We are providing Blogs, coding tips, and coding languages like python, Java, C, C++, and JavaScript practice problems and solutions.
Click on the below links to visit our website for HackerRank solutions or Codechef solutions or Leetcode solutions.

HackeRank Solutions in C

HackerRank C++ Programming Solutions

HackerRank Java Programming Solutions

HackerRank Python Programming Solutions

HackerRank SQL Programming Solutions

CodeChef DSA Learning Series Solutions

Leetcode Solutions

LinkedIn Skill Assessment Answers

NPTEL Solutions

Structuring the Document in C - Hacker Rank Solution

Problem

input Format :

Constraints :

Output Format :

Sample Input :

Sample Output :

Explanation :

Solution :

CodeWorld19

Categories

Archive