You've successfully subscribed to The Poor Coder | Hackerrank Solutions
Great! Next, complete checkout for full access to The Poor Coder | Hackerrank Solutions
Welcome back! You've successfully signed in.
Success! Your account is fully activated, you now have access to all content.
Hackerrank - Mars Exploration Solution

Hackerrank - Mars Exploration Solution

Beeze Aal
Beeze Aal

Sami's spaceship crashed on Mars! She sends a series of SOS messages to Earth for help.

Letters in some of the SOS messages are altered by cosmic radiation during transmission. Given the signal received by Earth as a string, , determine how many letters of Sami's SOS have been changed by radiation.

For example, Earth receives SOSTOT. Sami's original message was SOSSOS. Two of the message characters were changed in transit.

Function Description

Complete the marsExploration function in the editor below. It should return an integer representing the number of letters changed during transmission.

marsExploration has the following parameter(s):

  • s: the string as received on Earth

Input Format

There is one line of input: a single string, .

Note: As the original message is just SOS repeated  times, 's length will be a multiple of .

Constraints

  • will contain only uppercase English letters, ascii[A-Z].

Output Format

Print the number of letters in Sami's message that were altered by cosmic radiation.

Sample Input 0

SOSSPSSQSSOR

Sample Output 0

3

Explanation 0

= SOSSPSSQSSOR, and signal length . Sami sent  SOS messages (i.e.: ).

Expected signal: SOSSOSSOSSOS
Recieved signal: SOSSPSSQSSOR
Difference:          X  X   X

We print the number of changed letters.

Sample Input 1

SOSSOT

Sample Output 11

Explanation 1

= SOSSOT, and signal length . Sami sent  SOS messages (i.e.: ).

Expected Signal: SOSSOS     
Received Signal: SOSSOT
Difference:           X

We print the number of changed letters, which is .

Sample Input 2

SOSSOSSOS

Sample Output 2

0

Explanation 2

Since no character is altered, we print 0.

Solution in Python

s = input()
print(sum(1 for i in range(len(s)) if (i%3 in [0,2] and s[i]!="S") or (i%3==1 and s[i]!="O")))

Alternative one liner

print(sum((1 for i,v in enumerate(input()) if ((i+2)%3 and v!="S") or (not (i+2)%3 and v!="O"))))

Alternative solution

def marsExploration(s):
    c=0
    for i in range(0, len(s), 3):
        if s[i+0]!="S": c+=1
        if s[i+1]!="O": c+=1
        if s[i+2]!="S": c+=1
    return c
s = input()
print(marsExploration(s))