Home Problem Set Companies Projects Live Scene Contribute Requests

Loading Question...

Range Queries and Point Updates over a weighted rooted Tree - Juspay Hiring Challenge 2026 - Juspay Hiring Challenge Interview Question | Codinzhub

CodinzHub

Home Problem Set Companies Projects Live Scene Contribute Requests

Range Queries and Point Updates over a weighted rooted Tree - Juspay Hiring Challenge 2026

Problem

From Juspay's OA

Given a tree with N nodes and

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

solution.cpp

Run code to see test results

00:00 / 69:42

Range Queries and Point Updates over a weighted rooted Tree - Juspay Hiring Challenge 2026

HardMed•534 views

Problem

From Juspay's OA

Given a tree with N nodes and

…

Given an array of values, determine the required result under the following conditions.

Input: [4, 8, 15, 16, 23, 42]

Output: 3

Constraints: 1 ≤ n ≤ 10⁵

Access the full question

Unlock the full statement, examples, constraints, and solution guidance.

HardMed•534 views

Asked at

Juspay Hiring Challenge

Author: Amit Dayal

Software Engineer

Expert in Data Structures & Algorithms. Building tools to help developers crack FAANG interviews.

Reviewed by Senior Engineers

GitHub

Up Next

Router Disruption Avoidance - Morgan Stanley Online Assessment IGDTUW

Morgan Stanley • Pending

Smallest Permutation - Morgan Stanley Online Assessment IGDTUW

Morgan Stanley • Pending

Accenture Online Assessment - IIT (BHU) Varanasi

Accenture • Pending

Minimum Bit Flips to Convert One Number to Another - Morgan Stanley Online Assessment - IGDTUW

Morgan Stanley • Pending

Minimum Flips to Convert String - Morgan Stanley Online Assessment - IGDTUW

Morgan Stanley • Pending

Last updated Sep 2026