More Interview Questions:
As I went through more interviews, I was asked some interesting questions. If you happen to know the solutions or want to know the solutions, you write to me.

[1] Given an array of n integers both positive and negative integers. Find the sub-sequence of the array which has the largest sum. Find the algorithm with a better complexity than brute force one.

[2] Given a character array, print all the palindromes. Find an efficient algorithm.

[3] Write a C program to show if stack is growing into higher memory.

[4] How to make a server accept client connections in a non-blocking mode efficiently ?

[5] Find the Kth largest element in a binary search tree.

[6] Many more to come ...