# Coding Interviews: Searching and Sorting

Given an array nums of n integers where nums[i] is in the range [1, n], return *an array of all the integers in the range* [1, n] *that do not appear in* nums.

Given a **non-empty** array of integers nums, every element appears *twice* except for one. Find that single one.

You must implement a solution with a linear runtime complexity and use only constant extra space.

Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You must write an algorithm with O(log n) runtime complexity.

Given an array of integers nums and an integer target, return *indices of the two numbers such that they add up to **target*.

You may assume that each input would have **exactly**** one solution**, and you may not use the *same* element twice.

You can return the answer in any order.