Prep
Code
Questions
Roadmap
CSES Set
Patterns & Comp
Companies
Profile
Sign In
Create Account
Home
Topics
Segment Tree
Segment Tree
71 problems
Algorithms pattern questions across top companies
All
Unsolved
Solved
Starred
Table
Topics
Filters
Timeframe:
All Time
71
Last 30 Days
3
Last 3 Months
10
Last 6 Months
21
> 6 Months
42
Showing
71
questions
#715
Range Module
Hard
design
WalkCCC
Amazon
Coupang
Google
#1157
Online Majority Element In Subarray
Hard
array
WalkCCC
Nutanix
#1687
Delivering Boxes from Storage to Ports
Hard
array
WalkCCC
Nutanix
#2569
Handling Sum Queries After Update
Hard
array
WalkCCC
Trilogy
#3161
Block Placement Queries
Hard
array
WalkCCC
Amazon
Capital One
Google
#3187
Peaks in Array
Hard
array
WalkCCC
Siemens
#3380
Maximum Area Rectangle With Point Constraints I
Medium
array
WalkCCC
Google
UKG
#3382
Maximum Area Rectangle With Point Constraints II
Hard
array
WalkCCC
Google
UKG
#3410
Maximize Subarray Sum After Removing All Occurrences of One Element
Hard
array
WalkCCC
Google
Rubrik
#3525
Find X Value of Array II
Hard
array
WalkCCC
Google
Rubrik
#2080
Range Frequency Queries
Medium
array
WalkCCC
Amazon
Microsoft
Quora
#1649
Create Sorted Array through Instructions
Hard
array
WalkCCC
Akuna Capital
#3072
Distribute Elements Into Two Arrays II
Hard
array
WalkCCC
Autodesk
Capital One
Google
#218
The Skyline Problem
Hard
array
WalkCCC
Amazon
Apple
Bloomberg
#1521
Find a Value of a Mysterious Function Closest to Target
Hard
array
WalkCCC
American Express
#493
Reverse Pairs
Hard
array
WalkCCC
Amazon
Bloomberg
Goldman Sachs
#4051
Count Subarrays with Distant Sums
Hard
array
WalkCCC
Media.net
#2179
Count Good Triplets in an Array
Hard
array
WalkCCC
Bloomberg
Google
Walmart Labs
#729
My Calendar I
Medium
array
WalkCCC
Amazon
Apple
Flexport
#3915
Maximum Sum of Alternating Subsequence With Distance at Least K
Hard
array
WalkCCC
Visa
#3209
Number of Subarrays With AND Value of K
Hard
array
WalkCCC
DE Shaw
#850
Rectangle Area II
Hard
array
WalkCCC
Flipkart
Google
#1505
Minimum Possible Integer After at Most K Adjacent Swaps On Digits
Hard
string
WalkCCC
HashedIn
#2940
Find Building Where Alice and Bob Can Meet
Hard
array
WalkCCC
Amazon
Google
Infosys
#3901
Good Subsequence Queries
Hard
array
WalkCCC
Amazon
Infosys
#406
Queue Reconstruction by Height
Medium
array
WalkCCC
Amazon
Google
Media.net
#2907
Maximum Profitable Triplets With Increasing Prices I
Medium
array
WalkCCC
IBM
#2921
Maximum Profitable Triplets With Increasing Prices II
Hard
array
WalkCCC
IBM
#3291
Minimum Number of Valid Strings to Form Target I
Medium
array
WalkCCC
Media.net
#3165
Maximum Sum of Subsequence With Non-adjacent Elements
Hard
array
WalkCCC
Google
Infosys
Page 1 of 3
Prev
Next