Skip to main content

Featured

say hello world with C++ - Solution in Hacker Rank - hackerranksolutions8

  Objective This is a simple challenge to help you practice printing to  stdout . You may also want to complete  Solve Me First  in C++ before attempting this challenge. We’re starting out by printing the most famous computing phrase of all time! In the editor below, use either  printf  or  cout  to print the string  Hello ,World!  to  stdout . The more popular command form is  cout . It has the following basic form: cout<<value_to_print<<value_to_print; Any number of values can be printed using one command as shown. The  printf  command comes from C language. It accepts an optional format specification and a list of variables. Two examples for printing a string are: printf("%s", string);   printf(string); Note that neither method adds a newline. It only prints what you tell it to. Output Format Print   Hello ,World!   to stdout. Sample Output Hello, World! Solution:- //Say Hello, ...
Post a Comment
Read more

Java String Tokens Hacker Rank Solution

 Problem:-

Given a string, , matching the regular expression [A-Za-z !,?._'@]+, split the string into tokens. We define a token to be one or more consecutive English alphabetic letters. Then, print the number of tokens, followed by each token on a new line.Note: You may find the String.split method helpful in completing this challenge.

Input Format

A single string,s .

Constraints

  •  is composed of any of the following: English alphabetic letters, blank spaces, exclamation points (!), commas (,), question marks (?), periods (.), underscores (_), apostrophes ('), and at symbols (@).

Output FormatOn the first line, print an integer, n , denoting the number of tokens in string S (they do not need to be unique). Next, print each of the N tokens on a new line in the same order as they appear in input string S .

Sample Input

He is a very very good boy, isn't he?

Sample Output

10
He
is
a
very
very
good
boy
isn
t
he

ExplanationWe consider a token to be a contiguous segment of alphabetic characters. There are a total of 10  such tokens in string S, and each token is printed in the same order in which it appears in string S .

Solution:-

import java.io.*;


import java.util.*;



public class Solution {



    public static void main(String[] args){


      Scanner scan = new Scanner(System.in);


      String s=scan.nextLine();


    //Complete the code


        s = s.trim();


        if (s.length()>400000){


            return ;


        }else if (s.length()==0){


            System.out.println(0);


            return ;


        }else{   


        String[] words = s.split("[!,?.*_'@\\ ]+");


        int count = words.length;


        System.out.println(count);


        for(String word : words){


            System.out.println(word);


        }


      }


    }


}

Comments

Post a Comment