Find the subsequence of length 3 with the highest product from a sequence of non-negative integers, with the elements in increasing order.

Find the subsequence of length 3 with the highest product from a sequence of non-negative integers, with the elements in increasing order.

题目类型: 技术面试题

这是一道技术面试题，常见于澳洲IT公司面试中。

难度: medium

标签: interviewbit, data-structure, topic-specific, data-structures, algorithms

参考答案摘要

Input: n = 8 arr[ ] = {6, 7, 10, 1, 2, 3, 11, 12} Output: {10, 11, 12} The three increasing elements of the given arrays are 10, 11, and 12, which form a three-size subsequence with the highest produc...

本题提供 STAR 原则详细解答和技术解析，登录匠人学院学习中心即可查看完整答案。