|
In DP solution for the problem is constructed from few or all previously found sub-solutions. DP solutions usually have a polynomial time complexity and such questions are basically asked during almost all programming interviews.
I will show you how to solve the famous Coinage DP Problem in this article.
http://linkmingle.com/details/1761
created by interview_questions on 2008-07-04 03:48:49
|
|
Get an inside look at Google's Hyderabad office
http://linkmingle.com/details/1727
created by interview_questions on 2008-07-03 22:15:44
|
|
Want any more inspiration to send your resmume to Google ... Try these videos ....
and then these Interview Questions
http://linkmingle.com/details/1737
created by interview_questions on 2008-07-03 22:41:49
|
|
if the probability of observing a car in 30 minutes on a highway is p, what is the probability of observing a car in 5 minutes ?
http://linkmingle.com/details/1692
created by interview_questions on 2008-07-03 02:35:27
|
|
Given a matrix (2D array) of m x n elements (m rows, n columns), write a function that prints the elements in the array in a spiral manner.
http://linkmingle.com/details/1564
created by interview_questions on 2008-06-28 20:27:16
|
|
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
|
|
Reverse a Link List using Recursion
http://linkmingle.com/details/1531
created by interview_questions on 2008-06-27 02:40:08
|
|
Given an array {0,1,...n-1} . Find all Combinations of size m
http://linkmingle.com/details/1402
created by interview_questions on 2008-06-24 03:44:01
|
RSS
Interview Resources
Save Link 
Create/Add to List
