729A - Interview with Oleg - CodeForces Solution


implementation strings *900

Please click on ads to support us..

Python Code:

n = int(input())
s = input()
check = True
ans = ""
a = 0
if n < 3:
    print(s)
else:
    for i in range(n):
        i += a
        if i > n - 1 and check:
            break
        if check:
            if s[i:i + 3] == "ogo":
                check = False
                a += 2
                ans += "***"
                if i == n - 3:
                    break
            else:
                ans += s[i]
        else:
            if s[i:i + 2] != "go":
                a -= 1
                check = True
            else:
                a += 1
                if i == n - 2:
                    break
print(ans)


Comments

Submit
0 Comments
More Questions

Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree
590. N-ary Tree Postorder Traversal