Media Net

At the start of interview i was asked some core CS fundamental questions - Difference in hashing and encryption Difference in 64 bit Operating system and 32 Bit Operating system What is Overloading and Overridding And 2-3 more similar questions Then i was asked a DSA question - Given an array A and int K, I can perdorm the following operation at most once that is i can select any number and add it into a subarray My goal is to maximise the frequency of element K in the array. Solution - Started with the brute force with Time Complexity of O(n^3)- Checking every subaray and setting every possible element and choosing x = k - a[i]. The second solution i though was of a sliding window choosing every distinct numbers apart from K at a time and then transforming the array as if the element = k then change it to -1, if it is the choosen value then make it 1 else make it 0 and then finding the maximum subsum of subarray using Kadane's The time complexity was O(n * distinct numbers in array) I could not think beyond this but there is a more optimised way, This was a leetcode question