Skip to content
Avio Lines
← Segment Tree & BIT lineD23Stop 14 of 21

Count Good Triplets in an Array (LeetCode 2179)

HardLeetCode 2179 · Segment Tree Applications · Google, Amazon +2 · 1:04:09Count Good Triplets in an Array · Segment Tree Concepts & Qns · Video 12 · Leetcode 2179
MIK's code LeetCode ↗ YouTube ↗

My notes

Sign in to keep private notes on every station, with video timestamps.

Try it before watching

Pause here and write your approach in two lines. Compare it with MIK's when the video ends.

Sign in to write your approach →

About this video

Video solution for LeetCode 2179 Count Good Triplets in an Array by codestorywithMIK: Segment Tree & BIT, Hard. Topics: Array, Binary Search, Divide and Conquer, Binary Indexed Tree. Watch the explanation, then check the code and solve it on LeetCode.

Difficulty
hard
Topics
Array, Binary Search, Divide and Conquer, Binary Indexed Tree, Segment Tree, Merge Sort, Ordered Set
Patterns
Segment Tree Applications
Duration
1:04:09