Good solution, it saves having to look up the max after each push/pop.
This reminded me of Priority Queues: algs4.cs.princeton.edu/24pq/
Not sure if it fits the criteria of your interview question, but you might find it interesting anyway.
"Priority queues are characterized by the remove the maximum and insert operations"
Thank you for reading!
Priority Queues sound very interesting. I'm definitely going to look those up. Thank you for the input!
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Good solution, it saves having to look up the max after each push/pop.
This reminded me of Priority Queues: algs4.cs.princeton.edu/24pq/
Not sure if it fits the criteria of your interview question, but you might find it interesting anyway.
"Priority queues are characterized by the remove the maximum and insert operations"
Thank you for reading!
Priority Queues sound very interesting. I'm definitely going to look those up. Thank you for the input!