PracticeLevel 5: AlgorithmsEx 113. Insert while sorted
0/150 Solved(0%)
Level 5Exercise #113

Insert while sorted

Insert target into a sorted list in place and return the list.

What you’ll practice

This Level 5 exercise focuses on insort in the Algorithms curriculum. Solve the challenge prompt above using clear, idiomatic Python and the relevant language or standard-library tools.

Relevant Python reference: bisect — Array bisection algorithm.

Sample Test Cases

Example #1
Input:insert_sorted([1,3,7], target=4)
Output:[1,3,4,7]

Further Reading

Reference Solution

Reveal Reference Solution
def insert_sorted(values: list[int], target: int) -> list[int]:
from bisect import insort
insort(values, target)
return values
Pro Tips & Keyboard Shortcuts
Color Theme
Ctrl + K then T

Open VS Code Color Theme Quick Pick to select from 20 dark and light themes.

Editor SettingsCtrl + K

Open practice settings drawer to toggle line numbers, indenting, font size & hints.

Search MenuCtrl + /

Expand sidebar menu, focus search bar, and highlight search text instantly.

Focus Code Editor
Esc or Ctrl + `

Instantly highlight and focus code editor from anywhere, restoring cursor right where you left off.

Normal ViewEsc

Collapse sidebar and close all popups or settings drawers for clean focus view.

solution.py· Python 3.11 WASM