LeetCode 2593: Find Score of an Array After Marking All Elements Solution

Master LeetCode problem 2593 (Find Score of an Array After Marking All Elements), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2593. Find Score of an Array After Marking All Elements

Medium

Array Hash Table Sorting Heap (Priority Queue)Simulation

Problem Explanation

Explanation

To solve this problem, we can iterate through the array while keeping track of the unmarked elements. We will repeatedly choose the smallest unmarked element, mark it and its adjacent elements if they exist, and add its value to the score. This process continues until all elements are marked.

We can use a priority queue (min-heap) to efficiently find the smallest unmarked element at each step. We will also maintain a set to keep track of marked elements.

Time complexity: O(n log n) where n is the number of elements in the array Space complexity: O(n)

Solution Code

import java.util.*;

class Solution {
    public int arrayScore(int[] nums) {
        PriorityQueue<Integer> unmarked = new PriorityQueue<>();
        for (int num : nums) {
            unmarked.offer(num);
        }

        Set<Integer> marked = new HashSet<>();
        int score = 0;

        while (!unmarked.isEmpty()) {
            int current = unmarked.poll();
            if (marked.contains(current)) {
                continue;
            }
            score += current;
            marked.add(current);

            if (marked.contains(current - 1)) {
                unmarked.remove(current - 1);
                marked.add(current - 1);
            }
            if (marked.contains(current + 1)) {
                unmarked.remove(current + 1);
                marked.add(current + 1);
            }
        }

        return score;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2593 (Find Score of an Array After Marking All Elements)?

This page provides optimized solutions for LeetCode problem 2593 (Find Score of an Array After Marking All Elements) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2593 (Find Score of an Array After Marking All Elements)?

The time complexity for LeetCode 2593 (Find Score of an Array After Marking All Elements) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2593 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2593 in Java, C++, or Python.

Back to LeetCode Solutions