Highly technical interview with emphasis on low-level software tricks and tips in C programming. For example:

• Compute the next highest power of 2 in O(1) time.
• Given a pointer to an element in a singly linked list, delete the element in O(1) time.
• Find the largest palindrome in a string.
• Print the binary representation of a number.
• Multiply two numbers using just shift and add.
• Find the first occurrence of a number in an array with duplicates.
• Find the missing number in an array of size N containing numbers from 1 to N only.
• Iterative solution to computing the Fibonacci series.
• Largest sum of consecutive numbers in an array with negative numbers.
• Average/worst case time complexity of Heapsort, Mergesort, and Quicksort.
• Which sorting algorithm will you use and when, etc.

Largest palindrome in a string.