Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Practice Problems

Daily Challenge: Fewest Hops (1300) Solve it to start a streak

segment-tree Problems

15 practice problems tagged segment-tree , from difficulty 1400 to 2200 — solve them in our in-browser judge with instant verdicts. Browse all problems.

Related: lazy-propagation binary-search

ProblemTopics Solvers Acceptance Difficulty
Paint and Sum lazy-propagation segment-tree 0 — 1400
Dynamic Range Sum segment-tree 0 — 1700
Dynamic Range Minimum segment-tree 0 — 1700
Dynamic Range Maximum segment-tree 0 — 1700
Dynamic Range GCD segment-tree 0 — 1700
Dynamic Range XOR segment-tree 0 — 1700
Point Assign, Range Max segment-tree 0 — 1700
Point Assign, Range Min segment-tree 0 — 1700
Point Assign, Range GCD segment-tree 0 — 1700
Leftmost Big Enough segment-tree 0 — 1900
Range Add, Range Sum lazy-propagation segment-tree 0 — 2000
Range Add, Range Min lazy-propagation segment-tree 0 — 2000
Range Add, Range Max lazy-propagation segment-tree 0 — 2000
Bigger Than X, in a Slice binary-search segment-tree 0 — 2100
K-th Smallest in a Slice binary-search segment-tree 0 — 2200