Question: Given an integer k > 0 and an array, A, of n bits, describe an efficient algorithm for finding the shortest subarray of A that
Given an integer k > 0 and an array, A, of n bits, describe an efficient algorithm for finding the shortest subarray of A that contains k 1’s. What is the running time of your method?
Step by Step Solution
3.39 Rating (183 Votes )
There are 3 Steps involved in it
Scan through A using two pointers i and j such that Ai j always has k 1s and ... View full answer
Get step-by-step solutions from verified subject matter experts
