Algorithm Interview Questions

“Describe a routine which returns the set of integers in {1..100} divisible without remainder by 3 but not by 9.”

View Answers (3)

“Code a solution to rotate bitmap by 90 degrees given a structure definition representing the bitmap and a function prototype for the function to do the rotation.”

View Answers (1)

“Given the definition of a Fibonacci sequence, write a function to give the n-th term of the sequence.”

View Answers (2)

“Implement a Linked List class (for ints only) that supports an append function, which simply appends to the end of the list.

After that, they asked me to implement an appendAt function that takes two ints as arguments, and appends the second argument to the node containing the first argument in the list.

e.g for a list 1 -> 2 -> 3 -> 4 -> 5 , appendAt(3,6) would result in a list: 1 -> 2 -> 3 -> 6 -> 4 -> 5

e.g for a list 1 -> 2 -> 2 -> 3 -> 4 -> 5, appendAt(2,8) would result in: 1 - > 2 -> 8 -> 2 -> 3 -> 4 -> 5 (i.e if the first argument appears more than once in the list, then append the second argument to the first instance of the node containing the first argument)

I gave an iterative solution to the problem. The interviewer then asked me to write it recursively.

This one is really easy, I faltered on it for some reason.”

View Answers (1)

“You are given a Binary Search Tree of ints with duplicate entries. You are guaranteed that if an element has a duplicate entry, it is in the right subtree of that element. Write a function to count the total number of duplicates.

(note, if a tree contains the same element two times, the count of duplicates is 1, not 2)”

View Answers (2)

“Write a function that takes an integer and counts the number of bits.”

View Answers (1)

“How do you reverse a linked list”

View Answers (1)

“Depth First Search algorithm and code in C to "print" values of node in a tree.”

Answer Question

“Given a list of integers that fall within a known short but unknown range of values, how to find the median value?”

View Answers (1)