Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

added-segment-tree-problem #477

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

added-segment-tree-problem #477

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 30 additions & 0 deletions blog/2024-06-25-segment-tree-problem/segment-tree-problem.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,30 @@
---
slug: Segment-Tree-problems
title: Segment Tree Problems
authors: [Manish15559]
tags: ["30daysofcpp", "Segment-Tree","practice-problems","leetcode","cses","atcoder","codeforces"]
---

## Beginner :
- [Static Range Sum Queries](https://cses.fi/problemset/task/1646)
- [Static Range Minimum Queries](https://cses.fi/problemset/task/1647)
- [Dynamic Range Sum Queries](https://cses.fi/problemset/task/1648)
- [Dynamic Range Minimum Queries](https://cses.fi/problemset/task/1649)
- [Range Xor Queries](https://cses.fi/problemset/task/1650)
- [Range Update Queries](https://cses.fi/problemset/task/1651)

## Intermediate:
- [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/description/)
- [Longest Increasing Subsequence II](https://leetcode.com/problems/longest-increasing-subsequence-ii/description/)
- [Smooth Subsequence](https://atcoder.jp/contests/abc339/tasks/abc339_e)
- [Xenia and Bit Operations](https://codeforces.com/problemset/problem/339/D)
- [Knight Tournament](https://codeforces.com/contest/356/problem/A)
- [Global and Local Inversions](https://leetcode.com/problems/global-and-local-inversions/description/)


## Advanced:
- [Block Placement Queries](https://leetcode.com/problems/block-placement-queries)
- [Maximum Sum of Subsequence With Non-adjacent Elements](https://leetcode.com/problems/maximum-sum-of-subsequence-with-non-adjacent-elements)
- [Forest Queries](https://cses.fi/problemset/task/1652)
- [Hotel Queries](https://cses.fi/problemset/task/1143)
- [DZY Loves Fibonacci Numbers ](https://codeforces.com/contest/446/problem/C)