Reliance Industries Interview Preparation

def maxProduct(arr1, arr2):
    arr1.sort()
    arr2.sort()
    return sum(a * b for a, b in zip(arr1, arr2))

def isAnagram(s1, s2):
    return sorted(s1.replace(' ', '')) == sorted(s2.replace(' ', ''))

def merge(arr1, arr2):
    result = []
    i = j = 0
    while i < len(arr1) and j < len(arr2):
        if arr1[i] <= arr2[j]:
            result.append(arr1[i])
            i += 1
        else:
            result.append(arr2[j])
            j += 1
    return result + arr1[i:] + arr2[j:]

def reverse(head):
    prev = None
    while head:
        next_temp = head.next
        head.next = prev
        prev = head
        head = next_temp
    return prev

def isPalindrome(n):
    return str(n) == str(n)[::-1]

def firstUnique(s):
    freq = {}
    for c in s:
        freq[c] = freq.get(c, 0) + 1
    for c in s:
        if freq[c] == 1:
            return c
    return None

def maxSubarray(arr):
    max_sum = arr[0]
    curr_sum = 0
    for num in arr:
        curr_sum = max(num, curr_sum + num)
        max_sum = max(max_sum, curr_sum)
    return max_sum

def reverse(s):
    return s[::-1]

def binarySearch(arr, target):
    left, right = 0, len(arr) - 1
    while left <= right:
        mid = (left + right) // 2
        if arr[mid] == target:
            return mid
        elif arr[mid] < target:
            left = mid + 1
        else:
            right = mid - 1
    return -1