|
interview_questions
|
|
|
|
|
Bookmarks
|
|
|
|
|
|
|
|
|
Dynamic Programming
|
 Save Link
Create/Add to List
|
|
|
|
|
|
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
|
|
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
|
|
Move through the array from top to bottom (i.e, index 0,1,..,n), swapping each card in turn with another card from a random position in the part of the pack that has not yet been passed through (including itself). With unbiased random numbers, it always generates a random permutation.
Complexity: O(n)
http://linkmingle.com/details/795
created by interview_questions on 2008-05-29 02:20:36
|
|
You are given an array containing both positive and negative integes.Find the subarray with the largest sum (in O(N)).
http://linkmingle.com/details/786
created by interview_questions on 2008-05-28 03:36:20
|
|
|
RSS
