@kusuma main concern is how will you create the list which are coming once.
you have to check the current value with all values you pushed into the list and if match occures you have to delete the element from existing list and insert in next list having index greater by one. and if duplication not found you will push into first list. In worst case time complexity of generation of these array would be O(n^2). or if I misinterpreted the solution, correct me. On Sun, Oct 3, 2010 at 11:31 AM, kusuma sanjeev <kushina...@gmail.com>wrote: > One possible solution would be to create an array of pointers to the list.. > array index indicates how many times the element occurs and the list gives > the elements. > > > On Sun, Oct 3, 2010 at 11:22 AM, sharad kumar <aryansmit3...@gmail.com>wrote: > >> it will take same amount of memory na....key value is element and vaule is >> the amount of times element occurs..... >> >> >> On Sun, Oct 3, 2010 at 11:11 AM, mac adobe <macatad...@gmail.com> wrote: >> >>> i think hash map takes lots of memory ... please correct me if i am >>> wrong here .. >>> >>> anyways its a soluton but i would like to have a different solution .. :) >>> >>> >>> --mac >>> >>> >>> On Sun, Oct 3, 2010 at 10:55 AM, sharad kumar >>> <aryansmit3...@gmail.com>wrote: >>> >>>> cant u use a hash map buddy??? >>>> >>>> On Sun, Oct 3, 2010 at 10:35 AM, mac adobe <macatad...@gmail.com>wrote: >>>> >>>>> You are given a very long array of integers . Some number in this >>>>> integer array come 1 time , some 2 times some 3 times . create 3 different >>>>> arrays . >>>>> Array 1 will have numbers with numbers comming only1 time , Array 2 >>>>> will have numbers with numbers comming 2 times, Array 3 will have numbers >>>>> with numbers repearting 3 times , >>>>> >>>>> >>>>> Can you extend the solution to create array_x with elements repeating >>>>> x times ? >>>>> >>>>> thanks >>>>> --mac >>>>> >>>>> -- >>>>> 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<algogeeks%2bunsubscr...@googlegroups.com> >>>>> . >>>>> For more options, visit this group at >>>>> http://groups.google.com/group/algogeeks?hl=en. >>>>> >>>> >>>> >>>> >>>> -- >>>> yezhu malai vaasa venkataramana Govinda Govinda >>>> >>>> -- >>>> 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<algogeeks%2bunsubscr...@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 algoge...@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com> >>> . >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> >> >> -- >> yezhu malai vaasa venkataramana Govinda Govinda >> >> -- >> 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<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > Rgds, > Kusuma S > > -- > 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<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Thanks & Regards, Gaurav Gupta Associate Software Engineer IBM Software Lab |India Email: gauravgu...@in.ibm.com Ph No. : +91-7676-999-350 "Quality is never an accident. It is always result of intelligent effort" - John Ruskin -- 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 at http://groups.google.com/group/algogeeks?hl=en.
