On 27 August 2011 08:48, ankit arun talk.ankit...@gmail.com wrote:
thanks everybody for so many suggestions... :)
so let us know when you finish all those :P
On Sat, Aug 27, 2011 at 6:40 AM, Rahul raikra...@gmail.com wrote:
If the seeker wants to do entire self study , then I would
Ya sure... :)
After posting it Igot even more confused...
On Sat, Aug 27, 2011 at 9:33 AM, siddharth srivastava
akssps...@gmail.comwrote:
On 27 August 2011 08:48, ankit arun talk.ankit...@gmail.com wrote:
thanks everybody for so many suggestions... :)
so let us know when you finish all
yeah i wen first post answer i said it is for finding sum=k;
n just add one more condition in loop for finding k;
i.e. if(sub+a[i]k)
return sub,a[i];
is it fine nw?
On Sat, Aug 27, 2011 at 7:55 AM, raj kumar megamonste...@gmail.com wrote:
It's not knapsack in knapsack we find max or min subset
does they take apti+technical in written or only pure technical in
written??plz help me guysits really imp.thnx in advancce..
On Aug 26, 10:00 pm, Neha Gupta nehagup...@gmail.com wrote:
college?
--
You received this message because you are subscribed to the Google Groups
Algorithm
please search for an older post for the topic before posting anything
there's already a post on this topis
thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe
good test case jai
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit
+1 t jai.
Sanju
:)
On Fri, Aug 26, 2011 at 9:46 PM, raj kumar megamonste...@gmail.com wrote:
good test case jai
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
i also want to know buddy.. if u knw thn help me buddy
On Thu, Aug 25, 2011 at 11:01 PM, vivek vivek.thapar2...@gmail.com wrote:
hello buddy...hows u...american express
also cuming to our campus,..have u got any info abt its
technical written
Guys american express coming to our college for training.
Plz anyone who has faced the written test and procedure.. please share
their views.. it wud be helpful for us..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group,
Please mention the source of the question when you ask such question to
confirm that a solution exists for this prob.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To
exactly try posting links to the problem...
On Sat, Aug 27, 2011 at 10:33 AM, raj kumar megamonste...@gmail.com wrote:
Please mention the source of the question when you ask such question to
confirm that a solution exists for this prob.
--
You received this message because you are
How to rotate 1d array of length clockwise 'k' times??
(1,2,3,4,5,6,7,8)-(4,5,6,7,8,1,2,3) for k=3 n= 8
Give solutions which do not swap the array k times!! i.e less than O(nk)
--
*Dheeraj Sharma*
Comp Engg.
NIT Kurukshetra
+91 8950264227
--
You received this message because you are
i joined this group yesterday...dATS y i posted..after psoting i
search for this but i got only questions n not the process...
thnx moiz 4 ur unfo.
On Aug 27, 9:40 am, raj kumar megamonste...@gmail.com wrote:
please search for an older post for the topic before posting anything
there's already
101 - 113 of 113 matches
Mail list logo
