Given an array of integers a, your task is to find how many of its contiguous subarrays of length m contain a pair of integers with a sum equal to k. More formally, given the array a, your task is to count the number of indices 0 ≤ i ≤ a.length - m such that a subarray [a[i], a[i + 1], ..., a[i + m - 1]] contains at least one pair (a[s], a[t]), where: s ≠ t a[s] + a[t] = k
Why did you get married? Could you able to manage work and family?
Asked to count all 3 splits of a string.
How do you put the background pf a textbox in redcolor? (Specific command)
Name your strengths and weaknesses
Design a advertisement webpage using Animation, font and html/css
There was two guys who interviewd me. One of them was from Canda. He sarted to asking me about algorithms, Python, Django and django rest frmae work and data base
Difference between class and object
1. How to handle your pressure? 2. can you stay in the office at night if needed?
Convert Binary Number in a Linked List to Integer
Viewing 4931 - 4940 interview questions