Forem: Tshihab07

Replacing a substring in a string with another string using python without built-in function

Tshihab07 — Wed, 12 Jul 2023 18:43:15 +0000

"""
suppose a text txt is given. we want to replace the first occurrence of the pattern P1 by another pattern P2.
REPLACE(txt, P1, P2)
"""

def REPLACE(txt, p1, p2):
    if p1 not in txt:
        return "Pattern not found"

    # getting index of the pattern
    idx = txt.find(p1)

    # initialize variables to store new string
    temp_txt = ""
    new_txt = ""


    # deleting substring from the text
    for i in range(len(txt)):
        if i < idx or i >= idx + len(p1):
            temp_txt += txt[i]


    # adding p2 in txt as replacement
    for i in range(len(temp_txt)):
        if i == idx-1:
            new_txt += temp_txt[i]

            for j in range(len(p2)):
                new_txt += p2[j]

        else:
            new_txt += temp_txt[i]


    return new_txt

Hackerrank - Apple and Orange Solution in Python

Tshihab07 — Tue, 12 Jul 2022 17:30:05 +0000

step - 1: Get maximum between apple and orange array

step - 2: iterate over the maximum

step - 3: check the array indexes and if True add the fruit's position with the tree location (a or b) so that we get the actual position of the fruit

step - 4: nested if condition for the actual position of the fruit is in between the house range (s and t) and if true the count will be increased

Step - 5: print the output

def countApplesAndOranges(s, t, a, b, apples, oranges):
    # Write your code here
    apple_count = 0
    orange_count = 0

    max_length = max(len(apples), len(oranges))

    for idx in range(max_length):
        if idx < len(apples):
            count = apples[idx] + a
            if s <= count <= t:
                apple_count += 1

        if idx < len(oranges):
            count = oranges[idx] + b
            if s <= count <= t:
                orange_count += 1

    print(apple_count)
    print(orange_count)

Hackerrank - Sherlock and Array Solution in Python

Tshihab07 — Mon, 11 Jul 2022 10:13:47 +0000

Time Complexity of the program O(n).
if the middle value is q and the sum is p then we can write the equation as follow

p + q + p = sum [as the left and the right sum are same]
2p = sum - q

According to that Mathematical Logic The code can be written as follow:

def balancedSums(arr):
    # Write your code here
    left_sum = 0
    arr_sum = sum(arr)

    for i in arr:

        if (2 * left_sum) == arr_sum - i:
            return "YES"

        left_sum += i

    return "NO"