Last Stone Weight

Uber Interview Question

Problem Overview

Difficulty: Easy
LeetCode Pattern: Heap

You are given an array of integers stones where stones[i] is the weight of the ith stone.

We are playing a game with the stones.

On each turn, we choose the heaviest two stones and smash them together.

Suppose the heaviest two stones have weights x and y with x <= y.

The result of this smash is:

• If x =…