Re: [algogeeks] Job Openings at Adobe India
Job postings to this mailing list should be marked as spam, and the senders blocked. This is not a India-specific chatroom, this not a place to exchange books and PDFs, this is not a forum for jokes and forwards, and certainly not the list to be posting job offers to. Ignoring the idiot who was peddling Macbook Pros last week was a mistake, since it has encouraged the moron from Adobe to send this mail now. I had mailed the list-owner via the Google-Groups interface last week, but I don't think he/she has done anything about it. Does anyone know the list-owner? IIRC, it was someone from the 2004-2006 batch of CEG. -- rm On Wed, Jan 8, 2014 at 12:16 AM, Gaurav Gupta gauravnit...@gmail.com wrote: Hello Lalit , Please find my attached CV. Present Company : Samsung Research India , bangalore Experience : 1 year 6 months Time Frame To Join : 2 Months Thanks Regards, Gaurav kumar gupta On 7 January 2014 22:49, Lalit Sharma lks.ru...@gmail.com wrote: Hi all, Adobe Hiring drive in Hyderabad, Noida and Bangalore Dates: 18th/25th Jan 2014 Profile: Developer (C++/Java). Colleges Eligible: Premiere Institutes (IITs/NITs/IISc/BITS/IIITs/NSIT/Thapar/DCE/Jadavpur etc.) Experience Reqd : 1 – 5 Yrs experience in a good Product Company. Please share your resumes with me. -- Lalit Sharma | Member of Technical Staff | Adobe Systems ,Noida , India | Contact No : +91-8130-321-181 . -- 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. -- Thanks Regards, Gaurav kumar gupta Software Engineer Samsung Research India,Bangalore Contact No:+91-9538147434 Email id: gauravnit...@gmail.com -- 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. -- 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] Job Openings at Adobe India
We need active moderators who can ban these guys spamming the list. This group deals with algorithm problems, we don't need salesmen and brokers here. On Wed, Jan 8, 2014 at 1:42 PM, RM rmath...@gmail.com wrote: Job postings to this mailing list should be marked as spam, and the senders blocked. This is not a India-specific chatroom, this not a place to exchange books and PDFs, this is not a forum for jokes and forwards, and certainly not the list to be posting job offers to. Ignoring the idiot who was peddling Macbook Pros last week was a mistake, since it has encouraged the moron from Adobe to send this mail now. I had mailed the list-owner via the Google-Groups interface last week, but I don't think he/she has done anything about it. Does anyone know the list-owner? IIRC, it was someone from the 2004-2006 batch of CEG. -- rm On Wed, Jan 8, 2014 at 12:16 AM, Gaurav Gupta gauravnit...@gmail.com wrote: Hello Lalit , Please find my attached CV. Present Company : Samsung Research India , bangalore Experience : 1 year 6 months Time Frame To Join : 2 Months Thanks Regards, Gaurav kumar gupta On 7 January 2014 22:49, Lalit Sharma lks.ru...@gmail.com wrote: Hi all, Adobe Hiring drive in Hyderabad, Noida and Bangalore Dates: 18th/25th Jan 2014 Profile: Developer (C++/Java). Colleges Eligible: Premiere Institutes (IITs/NITs/IISc/BITS/IIITs/NSIT/Thapar/DCE/Jadavpur etc.) Experience Reqd : 1 – 5 Yrs experience in a good Product Company. Please share your resumes with me. -- Lalit Sharma | Member of Technical Staff | Adobe Systems ,Noida , India | Contact No : +91-8130-321-181 . -- 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. -- Thanks Regards, Gaurav kumar gupta Software Engineer Samsung Research India,Bangalore Contact No:+91-9538147434 Email id: gauravnit...@gmail.com -- 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. -- 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. -- 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] DISTINCT Permutations ( Not Easy)
Hi Nishanth Pandey,
Excellent solution! It meets all
requirements in problem!
One thing I am finding hard to understand is your duplicate functions logic.
code is simple. But reason behind it I am finding hard.
I would write it like
bool duplicate(char str[], int start, int end)
{ if(start == end)
return false;
// Without loop
if (str[start] == str[end]) /* I would end up generating same
permutations for example abcacd here swapping a and a would repeat
same permutations. unfortunately this logic is not working well */
return true;
return false;
}
Why are you skipping if you find element you want to swap in between start
and end indexes in duplicate function?
Please let me know you intuition.
-Thanks,
Bujji
On Tue, Jan 7, 2014 at 6:08 AM, Nishant Pandey nishant.bits.me...@gmail.com
wrote:
This will help u i guess :
#include iostream
#include string.h
using namespace std;
void swap(char str[],int m,int n ) {
char temp=str[m];
str[m]=str[n];
str[n]=temp;
}
bool duplicate(char str[], int start, int end)
{ if(start == end)
return false;
else
for(; startend; start++)
if (str[start] == str[end])
return true;
return false;
}
void Permute(char str[], int start, int end)
{
if(start = end){
coutstrendl;
return;
}
for(int i=start;i=end;i++)
{ if(!duplicate(str,start,i))
{
swap(str,start,i);
Permute(str,start+1,end);
swap(str,start,i);
}
}
}
int main()
{
char Str[]=aba;
Permute(Str,0,strlen(Str)-1);
return 0;
}
NIshant Pandey
Cell : 9911258345
Voice Mail : +91 124 451 2130
On Tue, Jan 7, 2014 at 4:44 PM, kumar raja rajkumar.cs...@gmail.comwrote:
This u can do it using the backtracking method. To know how to use
backtracking refer algorithm design manual by steve skiena.
On 7 January 2014 03:35, bujji jajala jajalabu...@gmail.com wrote:
generate all possible DISTINCT permutations of a given string with some
possible repeated characters. Use as minimal memory as possible.
if given string contains n characters in total with m n distinct
characters each occuring n_1, n_2, n_m times where n_1 + n_2 + ...+ n_m
= n
program should generate n! / ( n_1! * n_2! * * n_m! ) strings.
Ex:
aba is given string
Output:
aab
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 emails from it, send
an email to algogeeks+unsubscr...@googlegroups.com.
--
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.
--
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.
--
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.
[algogeeks] Adobe India is Hiring
Hi, *Please drop in your resumes to sanj...@adobe.com sanj...@adobe.com. *or *forward this mail *to your respective college/school/office groups. The hiring events have been scheduled to happen on: - 18th January in Bangalore - 25th January in Noida *Position* *Skill* *Exp Range* *Specifications* *Location* Developer JAVA 1-5 yrs B.Tech/M.Tech/M.C.A from Premiere Institutes Noida Developer C/C++ 1-6 yrs B.Tech/M.Tech/M.C.A from Premiere Institutes Noida Testing JAVA/C Whitebox 1-4 yrs B.Tech with Good CGPA Noida Sr. Developer JAVA 10-14 yrs B.Tech / M.Tech/ M.C.A from Premiere Institutes Bangalore Production Specialist Graphic/Web Design 3+ yrs B.Des or M.Des preferable Noida Regards, Sandeep Jain Computer Scientist, Adobe Systems, India -- 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.
