Re: [algogeeks] Re: AMAZON & DIRECT-I !!!!!!

2011-07-25 Thread adityasirohi
http://www.careercup.com/page?pid=amazon-interview-questions http://www.glassdoor.com/Interview/Amazon-com-Interview-Questions-E6036.htm On Mon, Jul 25, 2011 at 10:34 AM, shady wrote: > i would recommend you people to share questions related to each company on > some document like this... it ha

Re: [algogeeks] Reversing a string

2011-05-28 Thread adityasirohi
In java you can do this, take O(n) time. Is that correct? -Adi public class ReverseString { public static void main(String[] args){ String name = "Aditya"; String reverse = ""; for(int i=0;i wrote: > *Given an array of characters. How would you reverse it. ? How would you > reverse it without

Re: [algogeeks] Google Interview Question

2011-05-27 Thread adityasirohi
how about this case: 9, 100 -> 9100 100 9 9100 2, 3, 9, 78 --> 78 9 3 2 9 78 3 2 I guess solution should be:- sort the array of numbers in an ascending order and then check for the first element in the array, if there is any other element greater than it, shift all the elements one right and

Re: [algogeeks] Google Interview Question

2011-05-27 Thread adityasirohi
are you kidding me. Just simple sort wont work. On Fri, May 27, 2011 at 9:31 AM, radha krishnan < radhakrishnance...@gmail.com> wrote: > sort :) > > > On Fri, May 27, 2011 at 6:57 PM, ross wrote: > >> Hi all, >> >> Given an array of elements find the largest possible number that can >> be formed