|
Given time in format "[HH:MM {AM|PM}" and number of minutes. Return the time after adding the number of minutes in the same time format . For example with time as "10:23 AM" and period as 13 your program should return "10:36 AM"
http://linkmingle.com/details/1563
created by interview_questions on 2008-06-28 20:18:35
|
|
You have a 2-D input array of characters. You need to find whether a given string can be found in the array . Write a program to do it
http://linkmingle.com/details/1532
created by interview_questions on 2008-06-27 04:44:31
|
|
Create a Circular Link List from a Given Binary Tree
http://linkmingle.com/details/1530
created by interview_questions on 2008-06-27 02:21:10
|
|
Given a 2-Dimensional(NXN) array A[][]. Change A[] such that if A[i][j]=1 Set all ith row and jth column elements as '1'. Can you do it in O(N*N)
http://linkmingle.com/details/1374
created by interview_questions on 2008-06-23 05:01:42
|
|
Find the median value of N sorted arrays.
http://linkmingle.com/details/1290
created by interview_questions on 2008-06-22 05:42:38
|
|
Given 3 eggs and there is an N storied building. If an egg drops from k-th floor or above, it will break. As before you need to minimize the number of egg drops to find k in the worst case.
http://linkmingle.com/details/1289
created by interview_questions on 2008-06-22 05:36:15
|
|
If a bear starts from a location on earth, walks one mile south, turns left and walks one mile to the east and then turns left again and walks one mile north and arrives at its original position. How many such locations exists?
http://linkmingle.com/details/1273
created by interview_questions on 2008-06-21 22:58:37
|
|
A 2 dimensional array has each row in ascending order and also each column in ascending order. Write a program to search an element in this array?.
http://linkmingle.com/details/1234
created by interview_questions on 2008-06-19 04:35:50
|
|
Find a square root of a number without using the square root function.
http://linkmingle.com/details/1226
created by interview_questions on 2008-06-19 02:52:27
|
|
Given a square matrix with n x n cells with each cell either filled with a black pixel or a white pixel. Design an algorithm to find the maximum subsquare such that all four borders are filled with black pixels
http://linkmingle.com/details/1224
created by interview_questions on 2008-06-19 00:46:14
|
IndiaDiscuss.com : Social Bookmarkings and News Networking Site for India
RSS
Save Link 
Create/Add to List
