c Interview Questions

Sort: Popular Date
Sort: Popular Date

“Find the minimum depth of binary search tree”

“Convert a binary search tree to a sorted, circular, doubly-linked list, in place (using the tree nodes as the new list nodes).”

“Given two integer arrays. Find the Largest Common sub array. For example,
arr1 = {1,2,3,2,3,2} arr2={2,2,3,3,4,5}, the largest common sub array is {2,2,3,3}”

“Define binary search tree. Develop a procedure to verify a binary search tree.”

“Asked to implement a function that takes an integer and returns whether or not the number had an odd or even number of 1 bits.”

“Assume that you are given the head and tail pointers of a doubly linked list where each node can also have a single child pointer to another similar doubly linked list. There are no cycles in this…”

“identify the number of 1s in an integer is odd or even”

2 of 2 found helpful

“Given a page size and a number, align the number with the nearest page.

(Note: This was a phone interview question. The interviewer and I used an online document to share ideas about this problem.”

“How to remove a node from a singly-linked list when only given the pointer to the node”

1 of 1 found helpful

“Find k largest/smallest number in a series of numbers. What data-structures will you use? Code it on white board.”

110 of 276 Interview Questions