1. Given an array of integers(unsorted) and an integer K, count the number of sub-arrays whose difference between smallest and largest element is less than or equal to K\n\n>>>>> I solved it in O(n^2). Got TLE for 3/15 Test cases. Stuck with optimization.Do comment if you guys have any optimised approaches\n\n2. Minimum number of swaps(within the string, you can\'t flip the bits) required to convert a binary string to palndrome. If it\'s not possible, return -1\n\n>>>>> I used the following logic, but only partial test cases were passed. Do comment if you have alternate approaches\n\ncase 1: string length is even\n\tIf number of ones in the string is not even, return -1. Else, return numberOfOnes/2\ncase 2: string length is odd\n   If difference between number of ones before mid character and after mid character is even, return differenceInOnes/2. \n   Else, return (differenceInOnes/2)+1 (Note: You can always make a odd lengthed string palindrome by moving the extra one to middle)\n   \n  I don\'t know what went wrong with my logic on problem 2.\n\nTotally disappointed with my performance. Will strive hard and do well next time. Please post if you guys have any optimised/efficient solutions\n\nThanks\n\n\n

Given an array of integers(unsorted) and an integer K, count the number of sub-arrays whose difference between smallest and largest element is less than or equa