Scan first array check repeated values as in example( rt_triangle(4, {0,
-1, -1, 1}, {1, -2, 1, -2}))
-1,-1 is repeated twice at indices in array respectively 1and 2.
now in second y-axis array check values at indices given by first array (in
above example these values are -2 and 1 respectively)
c
@sai ram: Logic is NOT fine. That is the first thing you should accept.
You need to design an efficient solution to run in the required time limit.
I think the
time limit for this problems allows only O(n* log n) solutions to be
accepted and your
solution is slower than that.
On Fri, Aug 17, 2012
In there exam dey will ask 20 question on apti and one or two lago's will
be der.
last time they didn't checked the algo part becoz they dnt knw the answer
of that
then 2 intervw and after that telephonic intervw
On Sun, Aug 19, 2012 at 10:46 AM, Arun Kindra wrote:
> Can anyone know Indus Valley
Is it for campus recruitment process or Off campus?
And can u specify the Apti topic, and is there any analytical reasoning?
If possible plz share Coding ques.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email
Yeah sorry, misread the question then had a quick attempt :) I don't see
where you get the lg n from though. I didn't do any binary searches.
On 19 August 2012 22:53, pankajsingh wrote:
> @carl- got ur point..but complexity is more..suffix array takes
> o(n^2lgn)..considering string comparisons
Thanks.carl and atul.!!.@carl-i got lgn due to string comparison sort while
making the suffix array..:)
--
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
yar i forgot those coding question
and there were 20 question and covering each and every topic of apti
but u shud score 18 out of it becoz simole hote h vo
On Mon, Aug 20, 2012 at 7:37 PM, Arun Kindra wrote:
> Is it for campus recruitment process or Off campus?
> And can u specify the Apti
I still don't understand. There's far quicker suffix array construction
algorithms than O(n^2 log n)? There's O(n) algorithms
On 20 August 2012 23:27, pankajsingh wrote:
> Thanks.carl and atul.!!.@carl-i got lgn due to string comparison sort
> while making the suffix array..:)
>
> --
> You recei
