coding question 1: arr = [4,1,3,5,6,4,7,4,2] #k = 4 #w = 3 #find if k is part of all non-overlapping windows of size w in single loop #constraints- no additional array, no hashmaps, single loop coding question 2: remove duplicates from list of array without creating new array, without using inbuilt functions, without using more than 1 loop.