2718. Sum of Matrix After Queries

LeetCodeArrayHash TableOpen on judge ↗

You are given an integer n and a 0-indexed 2D array queries where queries[i] = [typei, indexi, vali]. Initially, there is a 0-indexed n x n matrix filled with 0's. For each query, you must apply one of the following changes: - if typei == 0, set the values in the row with indexi to vali, overwriting any previous values. - if typei == 1, set the values in the column with indexi to vali, overwrit

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI