Tht's wht i said to the interviewer but he kept me telling it's complexity is O(n^2) think different.... wht to say . solution iz in the question he told me.....
On 7/18/11, SAMM <somnath.nit...@gmail.com> wrote: > Tht's wht i said to the interviewer but he kept me telling it's > complexity is O(n^2) think different.... wht to say . solution iz in > the question he told me..... > > On 7/18/11, sunny agrawal <sunny816.i...@gmail.com> wrote: >> we don't need to find min and max values and hence there is a better >> solution >> and i think my solution works !! >> >> On Mon, Jul 18, 2011 at 10:04 PM, Swathi <chukka.swa...@gmail.com> wrote: >> >>> As said by someone already.. inorder to find min and max values it takes >>> O(n^2).. so i think there is no better solution below O(n^2) >>> >>> >>> On Mon, Jul 18, 2011 at 10:01 PM, sunny agrawal >>> <sunny816.i...@gmail.com>wrote: >>> >>>> if i am not getting question wrong..... >>>> read only 3 rows >>>> find min and max of these 3n numbers >>>> as min and max will be only in one lines output the line without min >>>> and >>>> max >>>> >>>> >>>> On Mon, Jul 18, 2011 at 9:55 PM, SkRiPt KiDdIe >>>> <anuragmsi...@gmail.com>wrote: >>>> >>>>> Reading the input will cost n^2 >>>>>> >>>>> >>>>> -- >>>>> 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 this group at >>>>> http://groups.google.com/group/algogeeks?hl=en. >>>>> >>>> >>>> >>>> >>>> -- >>>> Sunny Aggrawal >>>> B-Tech IV year,CSI >>>> Indian Institute Of Technology,Roorkee >>>> >>>> >>>> -- >>>> 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 this group at >>>> http://groups.google.com/group/algogeeks?hl=en. >>>> >>> >>> -- >>> 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 this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> >> >> -- >> Sunny Aggrawal >> B-Tech IV year,CSI >> Indian Institute Of Technology,Roorkee >> >> -- >> 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 this group at >> http://groups.google.com/group/algogeeks?hl=en. >> >> > > > -- > Somnath Singh > -- Somnath Singh -- 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 this group at http://groups.google.com/group/algogeeks?hl=en.