# Given sorted_nums = [1, 3, 7, 12, 18, 25, 33, 40, 55, 68, 82], implement O(log n) binary search for

Canonical URL: <https://datadriven.io/problems/given-sortednums-1-3-7-12-18-25-33-40-55-68-82-0b9c7ce5>

Domain: Python · Difficulty: medium

## Problem

Given sorted_nums = [1, 3, 7, 12, 18, 25, 33, 40, 55, 68, 82], implement O(log n) binary search for target = 33. Print the index where 33 is found. If not found, print -1.

## Related

- [All practice problems](https://datadriven.io/problems)
- [Mock interview mode](https://datadriven.io/interview/given-sortednums-1-3-7-12-18-25-33-40-55-68-82-0b9c7ce5)
- [Python Interview Questions](https://datadriven.io/python-interview-questions)
- [Data Engineering Interview Prep Guide](https://datadriven.io/data-engineer-interview-prep)
- [Daily Challenge](https://datadriven.io/daily)

---

Source: DataDriven (https://datadriven.io). 100% free data engineering interview prep. Live code execution against Postgres 16, Python 3.11, and Spark sandboxes. No paywall, no premium tier, no signup gate.