Category: data structure

We have a collection of stones, each stone has a positive integer weight. Each turn, we choose the two heaviest stones and smash them together. Suppose the stones have …

Although, sorting a linked list can be done via Recursive Divide-and-Conquer algorithm i.e. merge sorting, we can however, turn the linked list into an array (or vector) using O(N) …

Sort a linked list in O(n log n) time using constant space complexity. Example 1: Input: 4->2->->3 Output: 1->2->3->4 Example 2: Input: -1->5->3->4->0 Output: -1->0->3->4->5 The Merge sort performs …

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: Input: Output: 1->1->2->3->4->4->5->6 There are many algorithms that we can use …

Design a Leaderboard class, which has 3 functions: addScore(playerId, score): Update the leaderboard by adding score to the given player’s score. If there is no player with such id …