HackerRank java problem solving

Published: 16 April 2020
on channel: Code Tech Gyan

4,023

Learn how to solve HackerRank Problem and get the optimized solution.
This is a HackerRank Question and you get the solution to one of their problem on Tokens in Java String.
#Hackerrankjava #HackerRankTutorials #codetechgyan #HackerRank #programming #algorithms #coding #competitiveprogramming #java #codinginterview #problemsolving #hackerrankchallenges

HackerRank Problem Statement :
Given a string, s, 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

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

YOU CAN ALSO SEE PYTHON VIDEO ON THIS CHANNEL
• PYTHON PROGRAMMING INTRODUCTION

On this page of the site you can watch the video online HackerRank java problem solving with a duration of hours minute second in good quality, which was uploaded by the user Code Tech Gyan 16 April 2020, share the link with friends and acquaintances, this video has already been watched 4,023 times on youtube and it was liked by 48 viewers. Enjoy your viewing!

132