โ† Goldman Sachs questions

Sub-sequences of length 3

Filed under Goldman Sachs

Given an array of distinct integers, count the number of triplets (i, j, k) such that i < j < k and (arr[i] < arr[j] < arr[k] OR arr[i] > arr[j] > arr[k]).

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Goldman Sachs questions

Collected from public candidate posts and coding forums. Updated Nov 2026.