Re: [algogeeks] Re: Amazon interview Question (Array yet again!)

2010-09-04 Thread vikash jain
i think this prob cannot be solved by DP then... Because anytime a new value coming into the non decreasing sub-array obtained by the DP equation can be disrupted(like in the above example). I think a backtracking approach cud prove useful. (Recursion) anytime we get a new element we can do two

Re: [algogeeks] Re: fork() problem

2010-09-04 Thread vikash jain
yes ..19 is the correct answer. p(f1) / \ p1 p

Re: [algogeeks] Re: Take 5 digit number and find 2 power that number.............

2010-09-02 Thread vikash jain
nice... -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group

Re: [algogeeks] Re: find duplicate and missing element

2010-09-02 Thread vikash jain
@ashish: cud u plzz explain a bit more... -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com.

Re: [algogeeks] Re: Converting a decimal number to base -2

2010-08-30 Thread vikash jain
can you plzz tel me y -1 is interpreted as 11 ? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to

Re: [algogeeks] Re: Subsequence

2010-08-30 Thread vikash jain
@Yan Wang..can u tel me wat u meant by saying the following : And we know all the different numbers in A[...]. we put them in a rigorously increasing sequence B[1..p], where B[1] B[2] ... B[p-1] B[p], and for every i from 1 to n, A[i] can be found in B[1..p]. -- You received this message

Re: [algogeeks] Re: Subsequence

2010-08-30 Thread vikash jain
@Yan Wang..can u tel me wat u meant by saying the following : And we know all the different numbers in A[...]. we put them in a rigorously increasing sequence B[1..p], where B[1] B[2] ... B[p-1] B[p], and for every i from 1 to n, A[i] can be found in B[1..p]. -- You received this

Re: [algogeeks] Re: Amazon interview Question (Array yet again!)

2010-08-30 Thread vikash jain
@gene ..if u just give an example herethat will make things more clear... -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to