Sort a List Without Built-In Sort | Dataford Interview Questions

Sort a list of numbers from largest to smallest without using a built-in sort function

Asked in the HireVue coding challenge stage. Reported by a commenter as their own challenge.

Implement sort_descending(nums). The function receives a list of integers and returns a new list containing the same values ordered from largest to smallest. Do not call sort, sorted, or an equivalent library sorting function. The input list should remain unchanged.

Function Signature

def sort_descending(nums):

Input and Output

Input: a list of integers.
Output: a new list of those integers in descending order.

Constraints

0 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
The input list must not be modified
Built-in sorting functions are not allowed

Function Signature

def sort_descending(nums):

Your question is Sort a List Without Built-In Sort. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Sort a list of numbers from largest to smallest without using a built-in sort function

Asked in the HireVue coding challenge stage. Reported by a commenter as their own challenge.

Function Signature

def sort_descending(nums):

Input and Output

Input: a list of integers.
Output: a new list of those integers in descending order.

Constraints

0 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
The input list must not be modified
Built-in sorting functions are not allowed

Function Signature

def sort_descending(nums):

Your question is Sort a List Without Built-In Sort. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.