September 11th, 2012, 09:28 PM
Thanks nuzzle for thorough explanation. I actually implemented a greedy algorithm and it worked perfectly. Thanks for your time.
September 7th, 2012, 08:55 PM
If we are given an equation say 3x + 2y <= 10, we want to find the value of x and y such that
x + y = maximum and 10 - 3x - 2y is minimized. How can this be done? I am thinking of it as a...
January 25th, 2011, 07:58 PM
Thanks nuzzle ! The O(n) algorithm I used is exactly same as yours. Thanks for your time.
January 9th, 2011, 07:42 PM
Don't worry guys ! I found out the O (n) algorithm.
January 9th, 2011, 04:35 PM
I am trying to find a O (n) algorithm for this problem but unable to do so even after spending 3 - 4 hours. The brute force method times out (O (n^2)). I am confused as to how to do it ? Does...
April 29th, 2009, 10:53 PM
I have written an inefficient program for string matching. In this program we are suppose to tell whether it is possible to have all possible permutations of the first string (all distinct...
April 5th, 2009, 04:18 PM
I have written a program, in which it will ask the user to enter a string of length exactly 9. I have got a dictionary file with me which contains over two hundred thousand words. My job is to...