Given an NXN array, filled with battleships that can only be horizontal or vertical, count how many battleships are there in the board. The battleships will always have at least one horizontal/vertical space between them. Solution should be with no extra memory, one pass, and without changing the board.
Given a tree, write a serializer for it. Ensure it can be reconstructed from it as well class Node { public Node Left; Public Node Right; Public byte[] Data; }
Determine if a linked list is circular (give upper and lower on runtime bounds given the choices made/optimal ratio)
How would you test whether a sort function for pairs is correct?
Why do you want to switch?
Given 4 coins of values 1, 5, 10, and 20, find all the combinations of coins that can add up to K.
Reverse a doubly linked list.
Merge k sorted link lists
Given a stack and a no of element, find the max element in O(1) time
About my experience and my life when still student
Viewing 2161 - 2170 interview questions