Do it for FUN | SUMFIのBlog

[BOJ] Cow Land 2025-04-20|PSBOJ|Segment Tree-Problem Solving-Heavy Light Decomposition

[BOJ] Milk Visits 2025-04-20|PSBOJ|Problem Solving-Lazy Propagation Segment Tree-Heavy Light Decomposition-Offline Query Technique

[BOJ] Disruption 2025-04-20|PSBOJ|Problem Solving-Lazy Propagation Segment Tree-Heavy Light Decomposition

[BOJ] 트리와 쿼리 3 2025-04-19|PSBOJ|Problem Solving-Heavy Light Decomposition

트리와 쿼리 3

[BOJ] LCA 2 2025-04-19|PSBOJ|Lowest Common Ancestor-Problem Solving

[BOJ] 트리와 쿼리 10 2025-04-19|PSBOJ|Lowest Common Ancestor-Problem Solving-Lazy Propagation Segment Tree-Heavy Light Decomposition

트리와 쿼리 10

[BOJ] 국제 메시 기구 2025-04-19|PSBOJ|Lowest Common Ancestor-Problem Solving-Lazy Propagation Segment Tree-Heavy Light Decomposition

국제 메시 기구

[AtCoder] E - Colorful Subsequence 2025-04-16|PSAtCoder|Problem Solving-Dynamic Programming

E - Colorful Subsequence

[AtCoder] F - Many Lamps 2025-04-16|PSAtCoder|Problem Solving-DFS-Greedy

F - Many Lamps

[LeetCode] Count Good Triplets 2025-04-14|PSLeetCode|Problem Solving

1534. Count Good Triplets

Given an array of integers arr, and three integers a, b and c. You need to find the number of good triplets.

A triplet (arr[i], arr[j], arr[k]) is good if the following conditions are true:

0 <= i < j < k < arr.length

|arr[i] - arr[j]| <= a

|arr[j] - arr[k]| <= b

|arr[i] - arr[k]| <= c

Where |x| denotes the absolute value of x.

Return the number of good triplets.

Algolia