ThoughtWorks Interview Question for SDE1s
- 1of 1 vote
Bob And GCD- uppubhai December 11, 2017 in India
Bob has an array A of size N. He doesn't like arrays in which the GCD of all elements is not K. He can perform multiple operations on an array. In each operation, he can either increase or decrease the value of an element by 1.
You have to tell the minimum operation Bob will take to make GCD of all elements in an array equal to KK ?
GCD here is Greatest Common Divisor.
The first line contains T, the number of test cases.
For Each Testcase :
The first line contains 2 integers - K and N respectively, separated by a space.
The second line contains N integers, separated by a space, in order of their position in array.
For each test case, print minimum number of operations Bob take in a new line.
4 5 6
Ans - 2
| Report Duplicate | Flag | PURGE
Interview Type: Written Test
Open Chat in New Window