Increasing Triplet Subsequence at Google

Medium39.2% acceptance

This problem has 37.5% frequency at Google.

Problem Description

Given an integer array `nums`, return `true` _if there exists a triple of indices_`(i, j, k)`_such that_`i < j < k` _and_`nums[i] < nums[j] < nums[k]`. If no such indices exists, return `false`.

Read full problem and hints

Topics

Array Greedy

Also asked at 8 companies

Amazon Bloomberg Coupang FactSet Meta Microsoft Nutanix TikTok

View Full Problem

Problem Description

Topics

Also asked at 8 companies

More Google Questions