Cody

Problem 39. Which values occur exactly three times?

Solution 1532957

Submitted on 18 May 2018 by Varun Garg
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
x = [1 2 5 2 2 7 8 3 3 1 3 8 8 8]; y_correct = [2 3]; assert(isequal(threeTimes(x),y_correct))

max = -1 min = 1000 max = 1 min = 1 max = 2 max = 5 max = 7 max = 8 neg = [] freq = 0 0 0 0 0 0 0 0 freq = 1 0 0 0 0 0 0 0 freq = 1 1 0 0 0 0 0 0 freq = 1 1 0 0 1 0 0 0 freq = 1 2 0 0 1 0 0 0 freq = 1 3 0 0 1 0 0 0 freq = 1 3 0 0 1 0 1 0 freq = 1 3 0 0 1 0 1 1 freq = 1 3 1 0 1 0 1 1 freq = 1 3 2 0 1 0 1 1 freq = 2 3 2 0 1 0 1 1 freq = 2 3 3 0 1 0 1 1 freq = 2 3 3 0 1 0 1 2 freq = 2 3 3 0 1 0 1 3 freq = 2 3 3 0 1 0 1 4 y = [] y = 2 y = 2 3

2   Pass
x = [1 1 1]; y_correct = [1]; assert(isequal(threeTimes(x),y_correct))

max = -1 min = 1000 max = 1 min = 1 neg = [] freq = 0 freq = 1 freq = 2 freq = 3 y = [] y = 1

3   Pass
x = [5 10 -3 10 -3 11 -3 5 5 7]; y_correct = [-3 5]; assert(isequal(threeTimes(x),y_correct))

max = -1 min = 1000 max = 5 min = 5 max = 10 min = -3 max = 11 neg = [] neg = 0 0 0 freq = 0 0 0 0 0 0 0 0 0 0 0 freq = 0 0 0 0 1 0 0 0 0 0 0 freq = 0 0 0 0 1 0 0 0 0 1 0 gg = 3 neg = 0 0 1 freq = 0 0 0 0 1 0 0 0 0 2 0 gg = 3 neg = 0 0 2 freq = 0 0 0 0 1 0 0 0 0 2 1 gg = 3 neg = 0 0 3 freq = 0 0 0 0 2 0 0 0 0 2 1 freq = 0 0 0 0 3 0 0 0 0 2 1 freq = 0 0 0 0 3 0 1 0 0 2 1 y = [] y = -3 y = -3 5