Re: [algogeeks] variation of LIS problem

2014-03-11 Thread navneet singh gaur
> the >>>>> >> >> >>>>> >> Google >>>>> >> >> >>>>> Groups >>>>> >> >> >>>>> >> "Algorithm Geeks" group. >>>>> >> >> &g

Re: [algogeeks] Re: DISTINCT Permutations ( Not Easy)

2014-03-11 Thread navneet singh gaur
{ swap(a[i], a[j]); permute(a, i+1, n); swap([ai], a[j]); } } } - On Wed, Mar 12, 2014 at 11:59 AM, navneet singh gaur wrote: > void permute(char *a, int i, int n) > { >int j; >if (i == n) > printf("%

Re: [algogeeks] Re: DISTINCT Permutations ( Not Easy)

2014-03-11 Thread navneet singh gaur
gt; aba >>> baa >>> >>> >>> -Thanks, >>> Bujji >>> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To unsubscribe from this group and stop receiving

Re: [algogeeks] Breaking a string problem (Dynamic programming)

2013-10-22 Thread navneet singh gaur
>> >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To unsubscribe from this group and stop receiving emails from it, send an >> email to algogeeks+unsubscr...@googlegroups.com. &

Re: [algogeeks] Amazon interview Question

2013-02-05 Thread navneet singh gaur
2 5 3 1 4 6 1 > > Now you can see the unique number with lowest index is 3(index=1). So , you > have your answer. > > > On Mon, Feb 4, 2013 at 3:45 PM, navneet singh gaur > wrote: >> >> 1. Given a array,find a first unique integer. >> 2. Integers are comi

[algogeeks] Amazon interview Question

2013-02-04 Thread navneet singh gaur
1. Given a array,find a first unique integer. 2. Integers are coming as online stream,have to find a kth unique integer till now. For 1. Even we cannot use sorting for solving this as if we sort it than our first number which is non-repetitive changes. The best I am able to do is nlogn using a

Re: [algogeeks] Algo Question

2013-02-04 Thread navneet singh gaur
;Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to algogeeks+unsubscr...@googlegroups.com. > For more options, visit https://groups.google.com/groups/opt_out. > > -- navneet singh gaur -- You received this me

[algogeeks] K shortest Path and K- disjoint shortest path

2011-11-07 Thread navneet singh gaur
Hi, Does anyone know how to find K-shortest path and K disjoint shortest path... -- navneet singh gaur -- 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 u

Re: [algogeeks] Re: Amazon OS question

2011-10-28 Thread navneet singh gaur
; > $iva > > -- > 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...@goog