This interview is the first of two technical interviews for the internship.

The interviewer explained what the team does on the job, then asked the usual "tell me about yourself" question.

We then moved on to solve two technical questions. For the first, I had to explain my solution orally. For the second question, I had to explain while writing code.

Given an array of integers (or a linked list) and an integer K, write an algorithm to find two elements of the array which sum up to K.

Requirements:

• Time complexity of Theta(N), where N is the number of elements in the array/list.
• The algorithm can access the array/list only once.
• The size of the array/list is unknown beforehand.
• The elements should sum up to K exactly.

Using the C++11 standard library:

1. Implement the function: void* aligned_alloc(size_t alignment, size_t size)
2. Implement the function: aligned_free(void* ptr)

Note: You can use malloc() and free() from the standard library in your solution.