Given an array and a triple, find the number of occurrences of the triple as a subsequence in the give array.\n\nFor example, \n\narray [1, 2, 2, 1, 2, 1, 2, 3], triple [1, 1, 2]\n\nthis should return 4, because we have\n\n(0, 3, 4), (0, 3, 6), (0, 5, 6), (3, 5, 6) those subsequence can form the triple [1, 1, 2]\n\nCan we do this better than O(n ^ 3) ?

Given an array and a triple, find the number of occurrences of the triple as a subsequence in the give array.\n\nFor example, \n\narray [1, 2, 2, 1, 2, 1, 2, 3]