HackerRank Tweets Solution

Hello Programmers, In this post, you will learn how to solve HackerRank Tweets Solution. This problem is a part of the Regex HackerRank Series.

One more thing to add, don’t straight away look for the solutions, first try to solve the problems by yourself. If you find any difficulty after trying several times, then look for the solutions. We are going to solve the  Regex HackerRank Solutions using  CPP, JAVA, PYTHON, JavaScript & PHP Programming Languages.

As you already know that this site does not contain only the Hacker Rank solutions here, you can also find the solution for other problems. I.e. Web Technology, Data StructuresRDBMS ProgramsJava Programs Solutions,  Fiverr Skills Test answersGoogle Course AnswersLinkedin Assessment, and Coursera Quiz Answers.

HackerRank Tweets Solution

Problem

Increasing popularity of hackerrank can be seen in tweets like

• I love #hackerrank
• I just scored 27 points in the Picking Cards challenge on #HackerRank
• I just signed up for summer cup @hackerrank

Given a set of most popular tweets, your task is to find out how many of those tweets has the string hackerrank in it.

Input Format

First line is an integer N. N lines follow. Each line is a valid tweet.

Constraints

• 1 <= N <= 10
• Each character of the tweet is a valid ASCII character.

Output Format

Print the total number of tweets that has hackerrank (case insensitive) in it

Sample Input

4
I love #hackerrank
I just scored 27 points in the Picking Cards challenge on #HackerRank
I just signed up for summer cup @hackerrank
interesting talk by hari, co-founder of hackerrank

Sample Output

4

Explanation

HackerRank Tweets Solution in Cpp

#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<map>
#include<vector>
#include<algorithm>
#include<ctype.h>
using namespace std;
int main()
{
long long num,count,C,L,a[100000],i,j,k,l,m,n,kase;
string s,s1;
vector<long>v1;
vector<long>v2;
map<char,int>m1;
map<char,int>m2;
cin>>kase;
count=0;
string str="hackerrank";
getchar();
while(kase--)
{
s1="";
getline(cin,s);
int len=s.size();
for(i=0; i<len; i++)
{
if(s[i]=='h'||s[i]=='H')
{
s1="";
int len1=i+10;
if(len1>len)
{
break;
}
for(j=i; j<len1; j++)
{
char ch=tolower(tolower(s[j]));
s1+=ch;
}
if(s1==str)
{
count++;
}
}
}
}
cout<<count<<endl;
return 0;
}

HackerRank Tweets Solution in Java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner in = new Scanner(System.in);
int count = 0;
int testcase = in.nextInt();
String b = in.nextLine();
String format = "(?i).*(#|@|)hackerrank.*";
String[] fill = new String[testcase];
for (int i = 0;i<fill.length; i++){
fill[i] = in.nextLine();
if(fill[i].matches(format) == true){
count++;
}
}
System.out.println(count);
}
}

HackerRank Tweets Solution in Python

import re
from sets import Set
import string
import sys
n = int(input())
res = 0
for i in range(n):
s = raw_input()
if(re.match(".*hackerrank.*",string.lower(s))):
res+=1
print(res)

HackerRank Tweets Solution in JavaScript

'use strict';

function processData(input) {
var parse_fun = function (s) { return parseInt(s, 10); };

var hackerRE = new RegExp('[#@]?hackerrank', 'ig');
var lines = input.split('\n');
var N = parse_fun(lines.shift());
var data = lines.splice(0, N);

var res = 0;
data.forEach(function (s) {
var arr = s.match(hackerRE);
if (arr != null) { res += arr.length; }
});
console.log(res);
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
var _input = "";
process.stdin.on("data", function (input) { _input += input; });
process.stdin.on("end", function () { processData(_input); });

HackerRank Tweets Solution in PHP

<?php
\$a = fopen('php://stdin','r');
fscanf(\$a,'%d',\$v);
\$count=0;
while(\$v--)
{
\$b = fgets(\$a);
\$b = trim(\$b);
if(preg_match('/\[email protected]\b/i',\$b) || (preg_match('/\b#hackerrank\b/i', \$b)) || (preg_match("/hackerrank/i",\$b))){
\$count++;
}

}
echo \$count;

Disclaimer: This problem  (HackerRank Tweets) is generated by HackerRank but the solution is provided by Chase2learn. This tutorial is only for Educational and Learning purposes.

Sharing Is Caring