Re.findall() & Re.finditer() Hacker Rank Solution – Queslers

Problem : Re.findall() & Re.finditer() Hacker Rank Solution

The expression re.findall() returns all the non-overlapping matches of patterns in a string as a list of strings.
Code :

>>> import re
>>> re.findall(r'\w','http://www.hackerrank.com/')
['h', 't', 't', 'p', 'w', 'w', 'w', 'h', 'a', 'c', 'k', 'e', 'r', 'r', 'a', 'n', 'k', 'c', 'o', 'm']

re.finditer()
The expression re.finditer() returns an iterator yielding MatchObject instances over all non-overlapping matches for the re pattern in the string.
Code :

>>> import re
>>> re.finditer(r'\w','http://www.hackerrank.com/')
<callable-iterator object at 0x0266C790>
>>> map(lambda x: x.group(),re.finditer(r'\w','http://www.hackerrank.com/'))
['h', 't', 't', 'p', 'w', 'w', 'w', 'h', 'a', 'c', 'k', 'e', 'r', 'r', 'a', 'n', 'k', 'c', 'o', 'm']

Task :

You are given a string S. It consists of alphanumeric characters, spaces and symbols(+,-).
Your task is to find all the substrings of S that contains 2 or more vowels.
Also, these substrings must lie in between 2 consonants and should contain vowels only.
Note :
Vowels are defined as: AEIOU and aeiou.
Consonants are defined as: QWRTYPSDFGHJKLZXCVBNM and qwrtypsdfghjklzxcvbnm.

---

Input Format :

A single line of input containing string S.

Constraints :

• 0 < len(s)<100

Output Format :

Print the matched substrings in their order of occurrence on separate lines.
If no match is found, print -1.

---

Sample Input :

>>> import re
>>> re.finditer(r'\w','http://www.hackerrank.com/')
<callable-iterator object at 0x0266C790>
>>> map(lambda x: x.group(),re.finditer(r'\w','http://www.hackerrank.com/'))
['h', 't', 't', 'p', 'w', 'w', 'w', 'h', 'a', 'c', 'k', 'e', 'r', 'r', 'a', 'n', 'k', 'c', 'o', 'm']

Sample Output :

ee
Ioo
Oeo
eeeee

Explanation :

ee is located between consonant d and f.
Ioo is located between consonant k and m.
Oeo is located between consonant p and r.
eeeee is located between consonant t and t.

Re.findall() & Re.finditer() Hacker Rank Solution in python 2

import re
consonants = 'qwrtypsdfghjklzxcvbnm'
vowels = 'aeiou'
match = re.findall(r'(?<=['+consonants+'])(['+vowels+']{2,})(?=['+consonants+'])',raw_input(),flags = re.I)
if match:
    for i in match:
        print i
else:
    print -1

Re.findall() & Re.finditer() Hacker Rank Solution in python 3

# Enter your code here. Read input from STDIN. Print output to STDOUT

import re
v = "aeiou"
c = "qwrtypsdfghjklzxcvbnm"
m = re.findall(r"(?<=[%s])([%s]{2,})[%s]" % (c, v, c), input(), flags = re.I)
print('\n'.join(m or ['-1']))

Re.findall() & Re.finditer() Hacker Rank Solution in pypy

# Enter your code here. Read input from STDIN. Print output to STDOUT
from __future__ import print_function
import re
list = re.findall(r'(?<=[qwrtypsdfghjklzxcvbnm])([aeiou]{2,})[qwrtypsdfghjklzxcvbnm]', raw_input(), flags=re.I)
print('\n'.join(list or ['-1']))

Re.findall() & Re.finditer() Hacker Rank Solution in pypy 3

import re

m = re.findall(r"(?<=[^aeiou])([aeiou]{2,})(?=[^aeiou])", input(), re.IGNORECASE)

if m:
    print(*m, sep="\n")
else:
    print(-1)

Re.findall() & Re.finditer() Hacker Rank Solution Review:

In our experience, we suggest you solve thisRe.findall() & Re.finditer() Hacker Rank Solution and gain some new skills from Professionals completely free and we assure you will be worth it.

Re.findall() & Re.finditer() is available on Hacker Rank for Free, if you are stuck anywhere between compilation, just visit Queslers to get all Hacker Rank Solution

Re.findall() & Re.finditer() Hacker Rank Solution Conclusion:

I hope this Re.findall() & Re.finditer() Hacker Rank Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Hacker Rank, Leetcode, Codechef, Codeforce Solution.

This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.

Keep Learning!

More Hacker Rank Problem & Solutions >>

Mini-Max Sum Hacker Rank Solution

String Validators Hacker Rank Solution

Text Alignment Hacker Rank solution

String validators Hacker Rank Solution

Staircase Hacker Rank Solution