There isn't a question name but the question goes:
Given the start and end of a number range (inclusive) and the number of tags, return the most evenly spaced out order.
//Example 1
int start = 1;
int end = 9;
int tag = 5;
//most evenly-spaced answer
[1,3,5,7,9] //total 5 tags
//Example 2
int start = 1;
int end = 12;
int tag = 5;
//acceptable answers
[1,4,7,10,12]
[1,3,6,9,12]
[1,4,7,10,12]
// etc... basically all except 1 element has difference of 2 while others have difference of 3
//not acceptable answers
[1,4,5,8,12]
[1,2,3,4,12]If anyone know if this question (or similar) is on LC please let me know! Been trying to solve this question (with vauge memory of what the question actually is) but to no avail.
Comments (2)