← All problemsSign in

2679. Sum in a Matrix

LeetCodeArraySortingHeap (Priority Queue)MatrixSimulationOpen on judge ↗

You are given a 0-indexed 2D integer array nums. Initially, your score is 0. Perform the following operations until the matrix becomes empty: - From each row in the matrix, select the largest number and remove it. In the case of a tie, it does not matter which number is chosen. - Identify the highest number amongst all those removed in step 1. Add that number to your score. Return the final sco

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

Sign in to chat with the tutor and save your progress.

Sign in to start