Pergunta de entrevista da empresa Drawbridge

Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.

Resposta da entrevista

Sigiloso

26 de abr. de 2019

Need to come up with a very specific formula to solve this problem.