Sorting interview questions

Implement bubble sort, repeatedly swapping adjacent out-of-order pairs until the array is sorted.

Implement a function that merges two sorted linked lists into a single sorted linked list.

Implement insertion sort by building the sorted portion one element at a time from the input.

Implement a function that determines whether a person can attend every meeting given their time intervals.

Implement selection sort to order an array by repeatedly picking the smallest remaining element.

Sort integers without comparisons — counting sort tallies occurrences into buckets, and radix sort applies it digit by digit from the least significant.

Build a users data table that lets you sort by any column in ascending or descending order.

Implement a function that returns the minimum number of intervals to remove so the remaining ones do not overlap.

Implement a function that inserts a new interval into a sorted list and merges any resulting overlaps.

Implement a function that merges all overlapping intervals in a list and returns the consolidated set in sorted order.

Implement merge sort recursively by splitting the array and merging the sorted halves back together.

Extend a simplified in-memory ORM with richer filtering predicates and multi-field sorting.

Implement a function that returns the fewest meeting rooms required to host a list of time intervals without conflicts.

Implement orderBy — stably sort objects by multiple keys, each ascending or descending.

Implement quick sort recursively, partitioning around a pivot and sorting each side independently.

Implement a function that sorts positioned canvas elements into natural left-to-right, top-to-bottom reading order.

Implement a function that groups misaligned 2D canvas elements into rows, then sorts them into a natural reading order.

Implement a function that returns every unique triplet of distinct indices whose values sum to zero.

Build a generic, reusable data table that supports column-driven sorting and pagination for any dataset.

Build a generalized data table component that supports pagination, column sorting, and per-column filtering.

Build a data table with sortable columns, pagination, and row selection over a dataset.

Implement heap sort by building a max-heap and repeatedly extracting the largest element.

Implement a function that returns a topological ordering of nodes in a directed acyclic graph.