You are given a stream of elements that is too large to fit into memory. Write an algorithm to select…

Problem Statement (Asked By Uber) Given a list of integers, return a new list such that each element at index…

A heap is a specialized tree-based data structure that satisfies the heap property. It is commonly used to implement priority…

sequential search is a method for finding an element within a list. It sequentially checks each element of the list…

The idea of a dictionary used as a hash table to get and retrieve items using keys is often referred…

The shell sort improves on the insertion sort by breaking the original list into a number of smaller sub-lists, each…

The selection sort improves on the bubble sort by making only one exchange for every pass through the list.

A quick sort first selects a value, which is called the pivot value. Although there are many different ways to…

Merge sort is a recursive algorithm that continually splits a list in half. If the list is empty or has…

Insertion Sort builds the final sorted array (or list) one item at a time.