Skip to content

Loading the question…

Explore

Questions Companies Concepts Guides Sign in

How it works Questions Companies Concepts Guides Pricing Sample scorecard

Count Good Triplets: coding question | SysRound

Questions / Coding

CodingDifficulty not specifiedLeetCode 1534

Count Good Triplets

Count the number of index triplets (i < j < k) in arr such that the pairwise absolute differences satisfy |arr[i]-arr[j]| ≤ a, |arr[j]-arr[k]| ≤…

Open practice workspace

Available question text

Count the number of index triplets (i < j < k) in arr such that the pairwise absolute differences satisfy |arr[i]-arr[j]| ≤ a, |arr[j]-arr[k]| ≤ b, and |arr[i]-arr[k]| ≤ c. With arr.length ≤ 100, the constraints make a direct check over all triplets efficient.

Related questions

Continue with questions that share topics or the same question type.

Count Good Triplets in an Array
Coding
Count Even-Product Triplets
Coding
Count Good Meals
Coding
Count Good Nodes in Binary Tree
Coding

Sources · 1 reference

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

Google
Leetcode 1534. Count Good Triplets
Reported Dec 25, 2024 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source

Make space for your answer

Use code, block notes, and a whiteboard in one workspace.

Start practicing

Company associations

Google

More coding questions

Practice system design interviews out loud with an AI interviewer, a shared whiteboard and a scorecard for your level.

Questions by company

Sample scorecard

Use it as an app

About and how we write

Terms and guidelines

© 2026 SysRound. SysRound is an AI practice tool. The AI interviewer and the AI feedback can be wrong. Use it for your own practice, not to hire people.