Live Coding Test Solution of Airwrk

gistfile1.txt

// Problem - 1
# solution of problem - 1

# define a fucntion
def subarray_equals_k(nums, k):
    count = 0
    c_s = 0
    x = {0: 1}  # dictionary 

    for num in nums:
        c_s += num

        if ( c_s - k ) in x:
            count += x[c_s - k]
        
        if c_s in x:
            x[c_s] += 1
        
        else:
            x[c_s] = 1

    return count

nums = [1,2,3]
target = 3

solution = subarray_equals_k(nums, target)

print(solution)


// problem - 2

# solution-2

s = 'abcabcbb'
def find_longest_substring(s):
    char_x = set()
    left = 0
    max_length = 0

    # for right in range(len(s)):
    #     while s[right] in char_x:
    #         # need to remove the s[left] and +1 left
    #         char_x.remove(s[left])
    #         left += 1
        
    #     char_x.add(s[right]) # abcabcbb
    
    right = len(s) - 1

    while left < right:
        if s[left] == s[right]:
            char_x.add(s[left])
            left += 1
            right -= 1
            
        

    
    print(char_x)


print(find_longest_substring(s))

// problem-3

# function to find the missing number
def find_missing_nums(nums):
    # logic is 
    # len(nums) + 1 and multipy with len(nums) then +1
    n = len(nums)
    value = n * ( n + 1 ) // 2
    final = sum(nums)

    print( final)
    print(value - final)




nums = [9,6,4,2,3,5,7,0,1]
print(find_missing_nums(nums))