Re: [algogeeks] Re: Amazon Job openings

[Rahul Vatsa]

It's great to see this group active after such a long time, though it was
not for discussing an algo, but I think it's fine if a member in the group
needs some help in his/her professional career and asks for the same here.
Many members in this group are in this industry from more than a decade or
so and are definitely able to help the new guys.
I think I joined this group 12 years back and in those days it used to be
very active. Over time it has become a silent group, let it be a useful
forum in some way.

On Fri, Jul 16, 2021 at 3:46 PM Artemij Art  wrote:

> Hello, guys!
> Have a nice day. Greetings from Russia.
>
> пт, 16 июл. 2021 г., 09:19 Himanshu Singh :
>
>> Hello Guys,
>>
>> Sorry to say pls stop spamming whole group.
>>
>> Thanks.
>>
>>
>> On Fri, Jul 16, 2021, 11:46 AM Yash Khandelwal <
>> khandelwalyash...@gmail.com> wrote:
>>
>>> Done kindly check the mail
>>>
>>> On Fri, Jul 16, 2021, 11:41 AM immanuel kingston <
>>> kingston.imman...@gmail.com> wrote:
>>>
 Please send a note to me on king...@amazon.com

 Thanks,
 Kingston

 On Fri, Jul 16, 2021 at 11:16 AM immanuel kingston <
 kingston.imman...@gmail.com> wrote:

> Hi all,
>
> I am a hiring manager at Amazon. We are hiring for SDE and Applied
> Science roles in my team. Please send a short note about yourself, the 
> role
> you wish to apply for and your updated CV.
>
> Thanks,
> Kingston
>
 --
 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.
 To view this discussion on the web visit
 https://groups.google.com/d/msgid/algogeeks/CACOkDGdqjf%2BCUbBEoZcBQUpOsGwyJ8SMq0gDf89tZYiS0K-H-Q%40mail.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.
>>> To view this discussion on the web visit
>>> https://groups.google.com/d/msgid/algogeeks/CAJKd1Pcup_HeQNq%2B3f%2BCcnT8puZ9zwZytnGhwkPHJzsLDdiR_g%40mail.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.
>> To view this discussion on the web visit
>> https://groups.google.com/d/msgid/algogeeks/CAHwkYYrM7DdSXb1e_Mqis_K-_Y8HUwVJeCKSD0YpLeWiQUA5Vg%40mail.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.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/algogeeks/CABbfMraU624PR_fKEs5RJ%3DwQd1NGw_gmiCBCV_i5beheNB91GA%40mail.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.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/algogeeks/CAK%2BYZjJK64zB0D8-wwWHrbasygLm7yJevzfA9dA8KVbcW1B12A%40mail.gmail.com.

Re: [algogeeks] Re: Amazon Job openings

[Artemij Art]

Hello, guys!
Have a nice day. Greetings from Russia.

пт, 16 июл. 2021 г., 09:19 Himanshu Singh :

> Hello Guys,
>
> Sorry to say pls stop spamming whole group.
>
> Thanks.
>
>
> On Fri, Jul 16, 2021, 11:46 AM Yash Khandelwal <
> khandelwalyash...@gmail.com> wrote:
>
>> Done kindly check the mail
>>
>> On Fri, Jul 16, 2021, 11:41 AM immanuel kingston <
>> kingston.imman...@gmail.com> wrote:
>>
>>> Please send a note to me on king...@amazon.com
>>>
>>> Thanks,
>>> Kingston
>>>
>>> On Fri, Jul 16, 2021 at 11:16 AM immanuel kingston <
>>> kingston.imman...@gmail.com> wrote:
>>>
 Hi all,

 I am a hiring manager at Amazon. We are hiring for SDE and Applied
 Science roles in my team. Please send a short note about yourself, the role
 you wish to apply for and your updated CV.

 Thanks,
 Kingston

>>> --
>>> 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.
>>> To view this discussion on the web visit
>>> https://groups.google.com/d/msgid/algogeeks/CACOkDGdqjf%2BCUbBEoZcBQUpOsGwyJ8SMq0gDf89tZYiS0K-H-Q%40mail.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.
>> To view this discussion on the web visit
>> https://groups.google.com/d/msgid/algogeeks/CAJKd1Pcup_HeQNq%2B3f%2BCcnT8puZ9zwZytnGhwkPHJzsLDdiR_g%40mail.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.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/algogeeks/CAHwkYYrM7DdSXb1e_Mqis_K-_Y8HUwVJeCKSD0YpLeWiQUA5Vg%40mail.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.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/algogeeks/CABbfMraU624PR_fKEs5RJ%3DwQd1NGw_gmiCBCV_i5beheNB91GA%40mail.gmail.com.

Re: [algogeeks] Re: Amazon Job openings

[Himanshu Singh]

Hello Guys,

Sorry to say pls stop spamming whole group.

Thanks.


On Fri, Jul 16, 2021, 11:46 AM Yash Khandelwal 
wrote:

> Done kindly check the mail
>
> On Fri, Jul 16, 2021, 11:41 AM immanuel kingston <
> kingston.imman...@gmail.com> wrote:
>
>> Please send a note to me on king...@amazon.com
>>
>> Thanks,
>> Kingston
>>
>> On Fri, Jul 16, 2021 at 11:16 AM immanuel kingston <
>> kingston.imman...@gmail.com> wrote:
>>
>>> Hi all,
>>>
>>> I am a hiring manager at Amazon. We are hiring for SDE and Applied
>>> Science roles in my team. Please send a short note about yourself, the role
>>> you wish to apply for and your updated CV.
>>>
>>> Thanks,
>>> Kingston
>>>
>> --
>> 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.
>> To view this discussion on the web visit
>> https://groups.google.com/d/msgid/algogeeks/CACOkDGdqjf%2BCUbBEoZcBQUpOsGwyJ8SMq0gDf89tZYiS0K-H-Q%40mail.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.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/algogeeks/CAJKd1Pcup_HeQNq%2B3f%2BCcnT8puZ9zwZytnGhwkPHJzsLDdiR_g%40mail.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.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/algogeeks/CAHwkYYrM7DdSXb1e_Mqis_K-_Y8HUwVJeCKSD0YpLeWiQUA5Vg%40mail.gmail.com.

Re: [algogeeks] Re: Amazon Job openings

[Yash Khandelwal]

Done kindly check the mail

On Fri, Jul 16, 2021, 11:41 AM immanuel kingston <
kingston.imman...@gmail.com> wrote:

> Please send a note to me on king...@amazon.com
>
> Thanks,
> Kingston
>
> On Fri, Jul 16, 2021 at 11:16 AM immanuel kingston <
> kingston.imman...@gmail.com> wrote:
>
>> Hi all,
>>
>> I am a hiring manager at Amazon. We are hiring for SDE and Applied
>> Science roles in my team. Please send a short note about yourself, the role
>> you wish to apply for and your updated CV.
>>
>> Thanks,
>> Kingston
>>
> --
> 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.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/algogeeks/CACOkDGdqjf%2BCUbBEoZcBQUpOsGwyJ8SMq0gDf89tZYiS0K-H-Q%40mail.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.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/algogeeks/CAJKd1Pcup_HeQNq%2B3f%2BCcnT8puZ9zwZytnGhwkPHJzsLDdiR_g%40mail.gmail.com.

Re: [algogeeks] ADOBE SOLUTIONS PARTNER Consulting Services -Increase your Digital Business with Infinate 360

[Mykhailo Shershen]

Hello,


I am available from 8 a.m to 12 p.m

Best regards,
Mykhailo Shershen

T, 16. juuni 2020 16:32 Pavan_DigitalTechnocryne 
kirjutas:

> Hi ,
>
>
>
> I am Mark from Infinate360 Consulting Services. Recently we saw your
> linkedin profile and wanted to introduce our company which helps companies
> in Adobe Solution Patner i.e Adobe analytics Implementation Services. We
> have completed integrating with https://www.thecatalystacademy.org/ as
> our first project.
>
>
>
> About Adobe analytics:
>
> Adobe Analytics gives marketers the ability to understand their business,
> industry, and audience on a deeper level. With real-time understanding of
> behavioural patterns and other consumer insights, Adobe Analytics has the
> ability to vastly improve marketing performance.
>
> A successful Adobe Analytics implementation requires a knowledgeable team
> with the right expertise––a team that not only has deep technical
> expertise, but one that also understands the underlying business
> objectives. Axis41 provides this kind of team. As a long-time Adobe
> partner, our experience allows us to successfully execute as needed,
> whether you’re migrating to Adobe Analytics for the first time, need help
> re-implementing or advancing your current implementation, or assistance
> with ongoing maintenance, reporting, and analysis.
>
> Our Adobe Analytics services cover:
>
> Strategy and Planning
>
> · Clarifying business objectives and requirements via stakeholder
> interviews
>
> · Developing a measurement strategy that defines goals, audiences
> and intent, and KPIs
>
> · Developing a report strategy that yields meaningful, actionable
> insights
>
> Implementation and QA
>
> · Translating business requirements into Adobe Analytics design
> specifications
>
> · Implementing tags with or without a tag management solution
>
> · Validating code, tags, and reports across different environments
>
> Reporting and Analysis
>
> · Creating reports appropriate for the various audiences in your
> organization
>
> · Interpreting the reports and translating data into actionable
> recommendations
>
> Training
>
> · Using a tag management system to deploy new/update tags
>
> · Building reports and using the Adobe Analytics tool
>
> · Interpreting data and finding answers that drive business
> results
>
> Looking forward to hearing from you. Please let us know your feasible time
> to connect.
>
>
>
>
>
> Regards,
>
> Mark Anthony
>
> CEO – Infiante 360
>
> Website will be back by 12 June 2020
>
> Linkedin : https://www.linkedin.com/company/13734744/admin/
>
>
>
>
>
> --
> 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.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/algogeeks/CAOYnF_Tvhk79NqkJ82HYKH8sw_mbj_9s%2B9YB5av6brWBfP%2Bpfw%40mail.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.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/algogeeks/CAFiNNY8FKtiQLrPPN%3D_1rAQjCxj4SAXW4tq%3DyCcfJayJ5RXeHg%40mail.gmail.com.

Re: [algogeeks] ADOBE SOLUTIONS PARTNER Consulting Services -Increase your Digital Business with Infinate 360

[sanjiv yadav]

Hi Mark,
I will be available between 10 am to 4 pm tomorrow. So you can connect me
any time in between.

On Tue, 16 Jun 2020, 19:02 Pavan_DigitalTechnocryne, <
pavan.mtech1...@gmail.com> wrote:

> Hi ,
>
>
>
> I am Mark from Infinate360 Consulting Services. Recently we saw your
> linkedin profile and wanted to introduce our company which helps companies
> in Adobe Solution Patner i.e Adobe analytics Implementation Services. We
> have completed integrating with https://www.thecatalystacademy.org/ as
> our first project.
>
>
>
> About Adobe analytics:
>
> Adobe Analytics gives marketers the ability to understand their business,
> industry, and audience on a deeper level. With real-time understanding of
> behavioural patterns and other consumer insights, Adobe Analytics has the
> ability to vastly improve marketing performance.
>
> A successful Adobe Analytics implementation requires a knowledgeable team
> with the right expertise––a team that not only has deep technical
> expertise, but one that also understands the underlying business
> objectives. Axis41 provides this kind of team. As a long-time Adobe
> partner, our experience allows us to successfully execute as needed,
> whether you’re migrating to Adobe Analytics for the first time, need help
> re-implementing or advancing your current implementation, or assistance
> with ongoing maintenance, reporting, and analysis.
>
> Our Adobe Analytics services cover:
>
> Strategy and Planning
>
> · Clarifying business objectives and requirements via stakeholder
> interviews
>
> · Developing a measurement strategy that defines goals, audiences
> and intent, and KPIs
>
> · Developing a report strategy that yields meaningful, actionable
> insights
>
> Implementation and QA
>
> · Translating business requirements into Adobe Analytics design
> specifications
>
> · Implementing tags with or without a tag management solution
>
> · Validating code, tags, and reports across different environments
>
> Reporting and Analysis
>
> · Creating reports appropriate for the various audiences in your
> organization
>
> · Interpreting the reports and translating data into actionable
> recommendations
>
> Training
>
> · Using a tag management system to deploy new/update tags
>
> · Building reports and using the Adobe Analytics tool
>
> · Interpreting data and finding answers that drive business
> results
>
> Looking forward to hearing from you. Please let us know your feasible time
> to connect.
>
>
>
>
>
> Regards,
>
> Mark Anthony
>
> CEO – Infiante 360
>
> Website will be back by 12 June 2020
>
> Linkedin : https://www.linkedin.com/company/13734744/admin/
>
>
>
>
>
> --
> 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.
> To view this discussion on the web visit
> https://groups.google.com/d/msgid/algogeeks/CAOYnF_Tvhk79NqkJ82HYKH8sw_mbj_9s%2B9YB5av6brWBfP%2Bpfw%40mail.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.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/algogeeks/CALiFd1D1bf-sJcMiDz%2BwVomfEXWQniBgQukFnGs3wgR-WKbn0Q%40mail.gmail.com.

Re: [algogeeks] ADOBE SOLUTIONS PARTNER Consulting Services -Increase your Digital Business with Infinate 360

[Yash Khandelwal]

Rspected Sir ,
This is Yash Khandelwal here.
I received a mail from your side in which you mention that you visit my
LinkedIn profile.  It's a great pleasure for me.

You are required some information  to connect with me here are the same I
provided to you:

Email id: khandelwalyash...@gmail.com
Contact no: 8949180990

You are free to contact me at any time.
Hope for a valuable response.

Thanks and regards
Yash Khandelwal



On Jun 16, 2020 7:03 PM, "Pavan_DigitalTechnocryne" <
pavan.mtech1...@gmail.com> wrote:

Hi ,



I am Mark from Infinate360 Consulting Services. Recently we saw your
linkedin profile and wanted to introduce our company which helps companies
in Adobe Solution Patner i.e Adobe analytics Implementation Services. We
have completed integrating with https://www.thecatalystacademy.org/ as our
first project.



About Adobe analytics:

Adobe Analytics gives marketers the ability to understand their business,
industry, and audience on a deeper level. With real-time understanding of
behavioural patterns and other consumer insights, Adobe Analytics has the
ability to vastly improve marketing performance.

A successful Adobe Analytics implementation requires a knowledgeable team
with the right expertise––a team that not only has deep technical
expertise, but one that also understands the underlying business
objectives. Axis41 provides this kind of team. As a long-time Adobe
partner, our experience allows us to successfully execute as needed,
whether you’re migrating to Adobe Analytics for the first time, need help
re-implementing or advancing your current implementation, or assistance
with ongoing maintenance, reporting, and analysis.

Our Adobe Analytics services cover:

Strategy and Planning

· Clarifying business objectives and requirements via stakeholder
interviews

· Developing a measurement strategy that defines goals, audiences
and intent, and KPIs

· Developing a report strategy that yields meaningful, actionable
insights

Implementation and QA

· Translating business requirements into Adobe Analytics design
specifications

· Implementing tags with or without a tag management solution

· Validating code, tags, and reports across different environments

Reporting and Analysis

· Creating reports appropriate for the various audiences in your
organization

· Interpreting the reports and translating data into actionable
recommendations

Training

· Using a tag management system to deploy new/update tags

· Building reports and using the Adobe Analytics tool

· Interpreting data and finding answers that drive business results

Looking forward to hearing from you. Please let us know your feasible time
to connect.





Regards,

Mark Anthony

CEO – Infiante 360

Website will be back by 12 June 2020

Linkedin : https://www.linkedin.com/company/13734744/admin/





-- 
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.
To view this discussion on the web visit https://groups.google.com/d/
msgid/algogeeks/CAOYnF_Tvhk79NqkJ82HYKH8sw_mbj_9s%
2B9YB5av6brWBfP%2Bpfw%40mail.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.
To view this discussion on the web visit 
https://groups.google.com/d/msgid/algogeeks/CAJKd1PfF57ozfJ3qQ-_PmyFdRU0ODcMwKBqJoqzdwmQnEpW5LQ%40mail.gmail.com.

Re: [algogeeks] CAN ANYBODY HELP ME ?!! WİTH THİS ALGORİTHM

[mehmet ozturk]

thank you :)

Rahul Rai , 6 Kas 2018 Sal, 14:16 tarihinde şunu
yazdı:

> Let the glass be numbered 0 1 2 3... (2n - 1).
> And the glass numbered 0 1 2 3...(n - 1)  are filled.
> Pick every alternating ith filled glass starting from 1 indexed glass and
> swap it with the (n - 1 - i)th unfilled glass.
>
> Index 1 will swap with 2n - 2 indexed glass.
> Index 3 will swap with 2n - 4 indexed glass.
> .
> .
> .
> So on.
>
> Since the first glass is filled and there are 2n glasses(last glass being
> indexed by 2n - 1) so the second glass (2n - 2 indexed glass) from the end
> must be filled after processing.
>
> On Tue, Nov 6, 2018, 16:24 mehmet ozturk 
>> There are 2n glasses standing next to each other in a row, the first n of
>> them are filled with
>> a soda drink, while the remaining n glasses are empty. Make the glasses
>> alternate in a filledempty-
>> filled-empty pattern in the minimum no of glass moves.
>>
>> --
>> 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] CAN ANYBODY HELP ME ?!! WİTH THİS ALGORİTHM

[Rahul Rai]

Let the glass be numbered 0 1 2 3... (2n - 1).
And the glass numbered 0 1 2 3...(n - 1)  are filled.
Pick every alternating ith filled glass starting from 1 indexed glass and
swap it with the (n - 1 - i)th unfilled glass.

Index 1 will swap with 2n - 2 indexed glass.
Index 3 will swap with 2n - 4 indexed glass.
.
.
.
So on.

Since the first glass is filled and there are 2n glasses(last glass being
indexed by 2n - 1) so the second glass (2n - 2 indexed glass) from the end
must be filled after processing.

On Tue, Nov 6, 2018, 16:24 mehmet ozturk  There are 2n glasses standing next to each other in a row, the first n of
> them are filled with
> a soda drink, while the remaining n glasses are empty. Make the glasses
> alternate in a filledempty-
> filled-empty pattern in the minimum no of glass moves.
>
> --
> 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 in Hyderabad/Bangalore

[andrikshumit]

Вы кто?


Отправлено со смартфона Samsung Galaxy.
 Исходное сообщение От: Михаил Троицкий  
Дата: 12.10.18  21:22  (GMT+03:00) Кому: algogeeks@googlegroups.com Тема: Re: 
[algogeeks] Job Openings in Hyderabad/Bangalore 
we have job in Siberiacome to motherland comrad
пт, 12 окт. 2018 г., 16:34 kumar raja :
Folks,  I am looking for job switch in Hyderabad/Bangalore, if any one has 
references/pointers regarding openings please let me know.
-- RegardsKumar Raja





-- 

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] Job Openings in Hyderabad/Bangalore

[Михаил Троицкий]

we have job in Siberia
come to motherland comrad

пт, 12 окт. 2018 г., 16:34 kumar raja :

> Folks,
>   I am looking for job switch in Hyderabad/Bangalore, if any one has
> references/pointers regarding openings please let me know.
>
> --
> Regards
> Kumar Raja
>
>
> --
> 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] Need help

[Saurabh Paliwal]

Hi,
An approach could be to guess the answer `A` and check if in `A` time, all
the tasks can be completed.
For checking, just iterate through the k people, the number of tasks
completed would be `A`/k[i] (integer division) for everyone.
If sigma(`A`/k[i]) >= N, `A` works. Now do a binary search to find the
minimum `A` which works. The upper bound could be N*min(k[i]) giving all
tasks to be solved by the person which takes the least amount of time.

Time complexity will be k*log(N*min(k[i])

On Sun, Apr 22, 2018 at 1:58 PM, pawan yadav 
wrote:

> Hi All,
>
> Has anybody solved the following problem?
>
> https://www.careercup.com/question?id=5196860946907136
>
> -Pawan
>
> --
> 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.
>



-- 
 -Saurabh Paliwal

   B-Tech. Comp. Science and Engg.

   IIT ROORKEE

-- 
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] GREGOVIA in SPOJ

[bujji jajala]

hi Mehdi,
 Why should we consider from left to right only or right to
left only ? Explanation you gave does not look like proof that it gives
optimal solution. We should be able to prove that any other matching
strategy is not better than greedy approach mentioned. The example I gave
is to show that choosing greedily arbitrarily does not give optimal
solution because some other better solution exists.

-Thanks
Bujji

On Sat, Nov 18, 2017 at 1:17 AM, MeHdi KaZemI 
wrote:

>
> The Greedy observation is something like this: the leftmost person needs
> to satisfy his/her requirement from someone on his right, (i.e. if he wants
> to sell he has to sell to someone on his right, if he needs to buy he has
> to buy from someone on his right)
>
> Try to traverse the street from left to right, and only care about match
> for negative numbers, for example in the example you posted -1 -1 2 -1 1,
> when we traverse from [0] cell to the [1] cell we know 1 bottle of wine has
> to pass from [1] to [0] to satisfy the first person, *so 1 unit of work
> here*, then we see it's not satisfied from [1], so we keep in mind and
> continue,
> we traverse from [1] to [2], then we know 2 bottles has to pass from [2]
> to [1] to satisfy [0] and [1], *so 2 units of work here,*
> then we traverse from [2] to [3] we know no bottle has to pass from [3] to
> [2] to satisfy previous people because sum of the numbers we have seen so
> far is zero, then they have been able to satisfy each others needs. and so
> on
>
>
>
>
> On Thu, Nov 16, 2017 at 10:33 PM, bujji jajala 
> wrote:
>
>> Hi,
>> I am trying  to solve this problem in spoj website.  you might be
>> aware of this website.
>>
>> http://www.spoj.com/problems/GERGOVIA
>>
>>
>> Gergovia consists of one street, and every inhabitant of the city is a
>> wine salesman. Everyone buys wine from other inhabitants of the city. Every
>> day each inhabitant decides how much wine he wants to buy or sell.
>> Interestingly, demand and supply is always the same, so that each
>> inhabitant gets what he wants.
>>
>> There is one problem, however: Transporting wine from one house to
>> another results in work. Since all wines are equally good, the inhabitants
>> of Gergovia don't care which persons they are doing trade with, they are
>> only interested in selling or buying a specific amount of wine.
>>
>> In this problem you are asked to reconstruct the trading during one day
>> in Gergovia. For simplicity we will assume that the houses are built along
>> a straight line with equal distance between adjacent houses. Transporting
>> one bottle of wine from one house to an adjacent house results in one unit
>> of work.
>>
>>
>> Input
>>
>> The input consists of several test cases.
>>
>> Each test case starts with the number of inhabitants N (2 ≤ N ≤ 10).
>>
>> The following line contains n integers ai (-1000 ≤ ai ≤ 1000).
>>
>> If ai ≥ 0, it means that the inhabitant living in the ith house wants to
>> buy ai bottles of wine. If ai < 0, he wants to sell -aibottles of wine.
>>
>> You may assume that the numbers ai sum up to 0.
>>
>> The last test case is followed by a line containing 0.
>> Output
>>
>> For each test case print the minimum amount of work units needed so that
>> every inhabitant has his demand fulfilled.
>>
>>
>> I tried  but failed. I came across solutions which say we need to
>> greedily choose houses which satisfy our requirement from either left end
>> or right end. But I do not find good reasoning or proof for this approach.
>> There are few comments asking for explanation. But they do not have any
>> response.
>>
>> Suppose houses have wine requirement like this -1,-1,2,-1,1. In this case
>> if House with 2 wine bottles requirement chooses greedily, we get cost to
>> be 2 plus cost to transfer wine bottle from left edge to right edge. (2+4
>> =6). But we can see if we choosing greedily from one end gives cost  2+1+1
>> = 4. Why greedy approach from one end succeeds while choosing arbitrarily
>> fails.
>>
>>
>> Any hints or proofs is greatly appreciated.
>>
>>
>> --
>> -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.
>>
>
>
>
> --
>MeHdi KaZemI
>
> --
> 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] GREGOVIA in SPOJ

[MeHdi KaZemI]

The Greedy observation is something like this: the leftmost person needs to
satisfy his/her requirement from someone on his right, (i.e. if he wants to
sell he has to sell to someone on his right, if he needs to buy he has to
buy from someone on his right)

Try to traverse the street from left to right, and only care about match
for negative numbers, for example in the example you posted -1 -1 2 -1 1,
when we traverse from [0] cell to the [1] cell we know 1 bottle of wine has
to pass from [1] to [0] to satisfy the first person, *so 1 unit of work
here*, then we see it's not satisfied from [1], so we keep in mind and
continue,
we traverse from [1] to [2], then we know 2 bottles has to pass from [2] to
[1] to satisfy [0] and [1], *so 2 units of work here,*
then we traverse from [2] to [3] we know no bottle has to pass from [3] to
[2] to satisfy previous people because sum of the numbers we have seen so
far is zero, then they have been able to satisfy each others needs. and so
on




On Thu, Nov 16, 2017 at 10:33 PM, bujji jajala 
wrote:

> Hi,
> I am trying  to solve this problem in spoj website.  you might be
> aware of this website.
>
> http://www.spoj.com/problems/GERGOVIA
>
>
> Gergovia consists of one street, and every inhabitant of the city is a
> wine salesman. Everyone buys wine from other inhabitants of the city. Every
> day each inhabitant decides how much wine he wants to buy or sell.
> Interestingly, demand and supply is always the same, so that each
> inhabitant gets what he wants.
>
> There is one problem, however: Transporting wine from one house to another
> results in work. Since all wines are equally good, the inhabitants of
> Gergovia don't care which persons they are doing trade with, they are only
> interested in selling or buying a specific amount of wine.
>
> In this problem you are asked to reconstruct the trading during one day in
> Gergovia. For simplicity we will assume that the houses are built along a
> straight line with equal distance between adjacent houses. Transporting one
> bottle of wine from one house to an adjacent house results in one unit of
> work.
>
>
> Input
>
> The input consists of several test cases.
>
> Each test case starts with the number of inhabitants N (2 ≤ N ≤ 10).
>
> The following line contains n integers ai (-1000 ≤ ai ≤ 1000).
>
> If ai ≥ 0, it means that the inhabitant living in the ith house wants to
> buy ai bottles of wine. If ai < 0, he wants to sell -aibottles of wine.
>
> You may assume that the numbers ai sum up to 0.
>
> The last test case is followed by a line containing 0.
> Output
>
> For each test case print the minimum amount of work units needed so that
> every inhabitant has his demand fulfilled.
>
>
> I tried  but failed. I came across solutions which say we need to greedily
> choose houses which satisfy our requirement from either left end or right
> end. But I do not find good reasoning or proof for this approach. There are
> few comments asking for explanation. But they do not have any response.
>
> Suppose houses have wine requirement like this -1,-1,2,-1,1. In this case
> if House with 2 wine bottles requirement chooses greedily, we get cost to
> be 2 plus cost to transfer wine bottle from left edge to right edge. (2+4
> =6). But we can see if we choosing greedily from one end gives cost  2+1+1
> = 4. Why greedy approach from one end succeeds while choosing arbitrarily
> fails.
>
>
> Any hints or proofs is greatly appreciated.
>
>
> --
> -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.
>



-- 
   MeHdi KaZemI

-- 
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] Re: MICROSOFT:Given a BST and a number. Find two node in a BST whose sum is equal to given number in O(n) time and O(1) space.

[Ganesh P Kumar]

The O(1) space constraint is impossible, for any traversal will take
Omega(n) stack space in the worst case.

On Sep 5, 2017 10:38 PM, "deepikaanand"  wrote:

> using iterators:
>
>
> __author__ = 'deepika'
>
> """
> This code will return iterator for inorder traversal of a BST
> """
> class TreeNode(object):
>  def __init__(self, x):
>  self.val = x
>  self.left = None
>  self.right = None
>
>  def __repr__(self):
>  return str(self.val)
>
> class InorderIterator:
>
> def __init__(self, root):
> self.root = root
> self.stack = []
> self.appendLeftTree()
>
> def appendLeftTree(self, start=None):
> temp = self.root if start is None else start
> while temp:
> self.stack.append(temp)
> temp = temp.left
>
>
> def next(self):
> if self.stack:
> next_item = self.stack.pop()
> if next_item.right:
> self.appendLeftTree(next_item.right)
> return next_item.val
> return None
>
> class ReverseInOrderIterator:
>
> def __init__(self, root):
> self.root = root
> self.stack = []
> self.appendRightTree()
>
> def appendRightTree(self, start=None):
> temp = self.root if start is None else start
> while temp:
> self.stack.append(temp)
> temp = temp.right
>
>
> def next(self):
> if self.stack:
> next_item = self.stack.pop()
> if next_item.left:
> self.appendRightTree(next_item.left)
> return next_item.val
> return None
>
> class Solution:
>
> def binarySearchBST(self, root, key):
> left_itr = InorderIterator(root)
> right_itr = ReverseInOrderIterator(root)
> left_val = left_itr.next()
> right_val = right_itr.next()
> while True:
> if left_val >= right_val:
> break
> if left_val + right_val == key:
> print " Found: ", left_val, " ", right_val
> if left_val + right_val < key:
> left_val = left_itr.next()
> else:
> right_val = right_itr.next()
>
> root=TreeNode(10)
> root.left=TreeNode(5)
> root.right=TreeNode(11)
> root.left.left=TreeNode(1)
> root.left.right=TreeNode(8)
> root.left.right.left=TreeNode(7)
> root.right.right=TreeNode(14)
> itr = InorderIterator(root)
> result = []
> for i in range(7):
> result.append(itr.next())
> print result
>
> result = []
> itr = ReverseInOrderIterator(root)
> for i in range(7):
> result.append(itr.next())
> print result
>
> s=Solution()
> s.binarySearchBST(root, 18)
>
>
> On Sunday, September 2, 2012 at 1:02:57 PM UTC-7, Navin Kumar wrote:
>>
>>
>> --
> 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] Openings at Amazon - SDE IIs

[payel roy]

why you team is hiring?

On 9 May 2017 at 16:00, immanuel kingston 
wrote:

> My team is hiring Software Development Engineers!
>
>
> More about the team
>
> "Come join the platform team that develops components and services used to
> support repeat delivery programs like Subscribe & Save for customers and
> Recurring Delivery for businesses.
>
> Our systems enable Amazon to launch high-profile, customer-facing programs
> that span Amazon categories, technologies, and countries."
>
>
> Please feel to send me your resumes at kingston.imman...@gmail.com
>
> Thanks,
> Kingston
>
> --
> 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] Experience hiring in siemens with 5-8 years in C\C++

[Rahul]

How much is the maximum CTC which can be offered by Simens?

On Monday, October 24, 2016, Himanshu Singh 
wrote:

> Hello All,
>
> Openings at Siemens Bangalore with following skill set.
> 1. 5-8 years of experience.
> 2. c, c++ and Embedded experience.
> 3. Linux, RTOS.
> 4. RS485, CAN, BANet, I2C, SPI, Industrial Ethernet.
> 5. Linux system programming and scripting.
>
> If interested send your resume...
>
>
>
> *Regards,*
> *Himanshu Singh | Senior Software Engineer*
> *Mobile: *+91 7259897890
> *Siemens *
>
>
>
>
> --
> 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
> 
> .
>


-- 
Sent from Gmail Mobile

-- 
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] Designing Interview questions

[Uday Kumar Bachu]

You can review below blogs i came across:

https://github.com/shashank88/system_design

https://github.com/shashank88/system_design/blob/master/README.md





On Sun, Jul 10, 2016 at 4:52 PM, pawan yadav 
wrote:

> Hi All,
>
> Can anyone please let me know where can I read/understand about questions
> like "Design a Car Service center", I see this type of questions in many
> interview sets.
>
> What do interviewer expect in this type of questions?
>
> It would be great help.
>
> -Pawan
>
> --
> 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.
>



-- 
Uday Kumar Bachu

-- 
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] Re: 25march

[Tarun Sharma]

Check here
http://www.writeulearn.com/defective-ball-puzzle/

On Mon, Mar 28, 2011 at 5:54 PM, Subhransu 
wrote:

> Worst Case scenario you will get in 3 steps
>
> 9 balls
>
> Compare 1st:123| 456| 789
> if (first > second)
> //The ball is in 1st
> Second compare :
> else (second > third)
> take the heavy one now you have 3 balls
>
> Third compare :
> lets send is heaver then you have 3 balls (4, 5 , 6)
> Compare 4 to 5
> if both equals then heaver is 6th one or out of 4 & 5 one is heaver
>
>
> *Subhransu Panigrahi *
> *Mobile:* *+91-9840931538 <%2B91-9840931538>*
> *Email:* subhransu.panigr...@gmail.com
>
>
>
>
>
>> On Mar 25, 2:46 am, Lavesh Rawat  wrote:
>> > *Weighing Problem Solution*
>> > *
>> > *There are 9 similar balls. Eight of them weigh the same and the ninth
>> is a
>> > bit heavier.
>> > How would you identify the heavier ball if you could use a two-pan
>> balance
>> > scale only twice?
>> >
>> > Update Your Answers at : Click
>> > Here<
>> http://dailybrainteaser.blogspot.com/2011/03/25march.html?lavesh=lavesh>
>> >
>> > Solution:
>> > Will be updated after 1 day
>> >
>> > Soln
>> >
>> > --
>> > Posted By lavesh to brain teaser
>> > solutions<
>> http://solution-dailybrainteaser.blogspot.com/2011/03/25march.html>at
>> > 3/25/2011 12:01:00 AM
>> >
>> > --
>> >
>> > "Never explain yourself. Your friends don’t need it
>> and
>> > your enemies won’t believe it" .
>>
>> --
>> 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.
>



-- 
Regards
Tarun Sharma

-- 
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] Minimal number of swaps

[ranganath g]

Thanks!

-- 
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] Minimal number of swaps

[tec]

It's essentially the same as kumar's algorithm.
a[n - 1] records the total number of 1's, ie. K;
a[a[n-1]-1] = a[K-1] records the number of 1's in the first K elements.
the difference K-a[K-1] is the number of 0's in the first K elements, to be
swapped for remaining 1's.

2016-04-19 16:54 GMT+08:00 ranganath g :

> Hey Sachin,
>
> What is the correctness of your code? I mean how do you say that this is
> give the right answer
>
> --
> 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] Minimal number of swaps

[ranganath g]

Hey Sachin,

What is the correctness of your code? I mean how do you say that this is
give the right answer

-- 
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] Minimal number of swaps

[Shachindra A C]

1 - keep a running total of the sum in an array (or reuse the same array)
2 -  a[n - 1] (ie, the length of the array) - a[a[n - 1] - 1] is the answer

0 1 0 1 1 1 0
0 1 1 2 3 4 4

ans  = 4 - a [ 4 - 1 ] = 2


1 0 1 0 1
1 1 2 2 3

ans  = 3 - a [ 3 - 1 ] = 1

Same Os as the prev solution mentioned, except that the second pass isnt
required.




On Tue, Mar 29, 2016 at 12:29 PM, Régis Bacra 
wrote:

> Clever. Thanks!
>
> Le mardi 29 mars 2016 20:23:22 UTC+2, kumar raja a écrit :
>>
>> Adding time and space complexities.
>>
>> Time complexity: O(n)
>> Space complexity: O(1)
>>
>>
>> On 29 March 2016 at 23:44, kumar raja  wrote:
>>
>>> I think it is straight forward. Correct me if i am wrong or if there is
>>> better solution.
>>>
>>> 1) Do one pass over the list of elements and count the number of 1's.
>>> let us say it is K
>>> 2)  count = 0
>>>   from index 0 to K-1 do
>>>  if array[index] != 1
>>> count ++
>>>  end
>>>   end
>>>
>>> The variable "count"  indicates the minimum number of steps required to
>>> obtain a sorted list.
>>>
>>>
>>> On 29 March 2016 at 19:30, Régis Bacra  wrote:
>>>
 This puzzle comes from a contribution on codingame.com (link to the
 puzzle ). Any
 idea to solve it efficiently?

 Given a list of 1 and 0, you must regroup all the 1 at the begin of the
 list in a minimum number of steps. A step is the interchange of two
 elements located at different positions.
 The expected result is the minimum number of steps required to obtain a
 sorted list.

 Examples:
 1 0 1 0 1 -> 1
 0 1 0 1 1 1 0 -> 2

 --
 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+...@googlegroups.com.

>>>
>>>
>>>
>>> --
>>> Regards
>>> Kumar Raja
>>>
>>>
>>>
>>
>>
>> --
>> Regards
>> Kumar Raja
>>
>>
>> --
> 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.
>



-- 
Regards,
Shachindra A C

-- 
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] Minimal number of swaps

[Régis Bacra]

Clever. Thanks!

Le mardi 29 mars 2016 20:23:22 UTC+2, kumar raja a écrit :
>
> Adding time and space complexities.
>
> Time complexity: O(n)
> Space complexity: O(1)
>
>
> On 29 March 2016 at 23:44, kumar raja  
> wrote:
>
>> I think it is straight forward. Correct me if i am wrong or if there is 
>> better solution.
>>
>> 1) Do one pass over the list of elements and count the number of 1's. let 
>> us say it is K
>> 2)  count = 0
>>   from index 0 to K-1 do
>>  if array[index] != 1
>> count ++
>>  end
>>   end
>>
>> The variable "count"  indicates the minimum number of steps required to 
>> obtain a sorted list.
>>
>>
>> On 29 March 2016 at 19:30, Régis Bacra > > wrote:
>>
>>> This puzzle comes from a contribution on codingame.com (link to the 
>>> puzzle ). Any 
>>> idea to solve it efficiently?
>>>
>>> Given a list of 1 and 0, you must regroup all the 1 at the begin of the 
>>> list in a minimum number of steps. A step is the interchange of two 
>>> elements located at different positions.
>>> The expected result is the minimum number of steps required to obtain a 
>>> sorted list.
>>>
>>> Examples:
>>> 1 0 1 0 1 -> 1
>>> 0 1 0 1 1 1 0 -> 2
>>>
>>> -- 
>>> 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+...@googlegroups.com .
>>>
>>
>>
>>
>> -- 
>> Regards
>> Kumar Raja
>>
>>
>>
>
>
> -- 
> Regards
> Kumar Raja
>
>
>

-- 
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] Minimal number of swaps

[kumar raja]

Adding time and space complexities.

Time complexity: O(n)
Space complexity: O(1)


On 29 March 2016 at 23:44, kumar raja  wrote:

> I think it is straight forward. Correct me if i am wrong or if there is
> better solution.
>
> 1) Do one pass over the list of elements and count the number of 1's. let
> us say it is K
> 2)  count = 0
>   from index 0 to K-1 do
>  if array[index] != 1
> count ++
>  end
>   end
>
> The variable "count"  indicates the minimum number of steps required to
> obtain a sorted list.
>
>
> On 29 March 2016 at 19:30, Régis Bacra 
> wrote:
>
>> This puzzle comes from a contribution on codingame.com (link to the
>> puzzle ). Any
>> idea to solve it efficiently?
>>
>> Given a list of 1 and 0, you must regroup all the 1 at the begin of the
>> list in a minimum number of steps. A step is the interchange of two
>> elements located at different positions.
>> The expected result is the minimum number of steps required to obtain a
>> sorted list.
>>
>> Examples:
>> 1 0 1 0 1 -> 1
>> 0 1 0 1 1 1 0 -> 2
>>
>> --
>> 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.
>>
>
>
>
> --
> Regards
> Kumar Raja
>
>
>


-- 
Regards
Kumar Raja

-- 
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] Minimal number of swaps

[kumar raja]

I think it is straight forward. Correct me if i am wrong or if there is
better solution.

1) Do one pass over the list of elements and count the number of 1's. let
us say it is K
2)  count = 0
  from index 0 to K-1 do
 if array[index] != 1
count ++
 end
  end

The variable "count"  indicates the minimum number of steps required to
obtain a sorted list.


On 29 March 2016 at 19:30, Régis Bacra  wrote:

> This puzzle comes from a contribution on codingame.com (link to the puzzle
> ). Any idea to
> solve it efficiently?
>
> Given a list of 1 and 0, you must regroup all the 1 at the begin of the
> list in a minimum number of steps. A step is the interchange of two
> elements located at different positions.
> The expected result is the minimum number of steps required to obtain a
> sorted list.
>
> Examples:
> 1 0 1 0 1 -> 1
> 0 1 0 1 1 1 0 -> 2
>
> --
> 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.
>



-- 
Regards
Kumar Raja

-- 
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] Find all the subarrays in a given array with sum=k

[Saurabh Agrawal]

Hi,

This question was asked in Amazon interview few days back.
Please explain to me the part after building the SUM array.

With Regards,

Saurabh Agrawal

On Sun, Feb 21, 2016 at 9:08 PM, Saurabh Paliwal <
saurabh.paliwa...@gmail.com> wrote:

> Hi,
> I can think of an approach that is neither recursion nor dynamic
> programming. ( I would like to know, how to solve it using dp, as you say,
> though)
>
> 1. Take an auxiliary array SUM which stores the sum of all entries from
> beginning to that index.
> 2. Now, you have to find all the pairs(i,j | j > i, SUM[j] - SUM[i] == k)
> 3. Start from right, use a C++ STL map or Java TreeMap to store (number
> minus k) and its ocurence count and add the occurence count to the answer.
> I will explain for the given example.
> arr = [1,3,1,7,-4,-11,3,4,8]
> SUM = [0,1,4,5,12,8,-3,0,4,12] (We always start from second index in
> the SUM array storing 0 for the first index)
> map M;
> answer = 0;
>
> iterating from right,
> 12 -> answer = answer + M[12] (=0), M[ 12 - 12 ] = 1
> 4 -> answer = answer + M[4] (=0), M [ 4 - 12] = 1
> 0 -> answer = 0 + M[0] , M [-12] = 1
> notice, how the answer will now be 1. Why, you ask, because I found a pair
> of indices which was required.
> -3 -> answer = 1 + M[-3], M [-15] = 1
> 8 -> answer = 1 + M[8], M [-4] = 1
> 12 -> answer = 1 + M[12], M[0] = 2
> because M[0] was 1 before.
> 5 -> answer = 1 + M[5], M[-7] = 1
> 4 -> answer = 1 + M[4], M[-8] = 2
> 1 -> answer = 1 + M[1], M[-11] = 1
> 0 -> answer = 1 + M[0], M[-12] = 2
> hence,
> answer = 3.
> Insertion in map takes logarithmic time. Overall complexity will be
> O(nlog(n))
>
> NOTE:
> If you have to output indices, rather than the number, you can use a
> map in which case the vector will store all the indices,
> where the number came, and its size will tell the count.
> I hope that makes sense. Feel free to ask if you didn't get something.
>
>
> On Sun, Feb 21, 2016 at 3:18 PM, Shubh Aggarwal <
> shubh.aggarwal...@gmail.com> wrote:
>
>> Given an array of n elements(both +ve -ve allowed)
>> Find all the subarrays with a given sum k!
>> I know the solution using dynamic programming. It has to be done by
>> recursion (as asked by the interviewer)
>>
>> For ex
>>
>> arr = 1 3 1 7 -4 -11 3 4 8
>>
>> k = 12
>>
>> answer = {1 3 1 7},  {4 8}, {1 3 1 7 -4 -11 3 4 8}
>>
>> You have to print {from index,  to last index} so for above example {0,
>> 3}; {0,8}; {7,8} is the answer
>>
>> --
>> 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.
>>
>
>
>
> --
>  -Saurabh Paliwal
>
>B-Tech. Comp. Science and Engg.
>
>IIT ROORKEE
>
> --
> 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] Find all the subarrays in a given array with sum=k

[Saurabh Paliwal]

Hi,
I can think of an approach that is neither recursion nor dynamic
programming. ( I would like to know, how to solve it using dp, as you say,
though)

1. Take an auxiliary array SUM which stores the sum of all entries from
beginning to that index.
2. Now, you have to find all the pairs(i,j | j > i, SUM[j] - SUM[i] == k)
3. Start from right, use a C++ STL map or Java TreeMap to store (number
minus k) and its ocurence count and add the occurence count to the answer.
I will explain for the given example.
arr = [1,3,1,7,-4,-11,3,4,8]
SUM = [0,1,4,5,12,8,-3,0,4,12] (We always start from second index in
the SUM array storing 0 for the first index)
map M;
answer = 0;

iterating from right,
12 -> answer = answer + M[12] (=0), M[ 12 - 12 ] = 1
4 -> answer = answer + M[4] (=0), M [ 4 - 12] = 1
0 -> answer = 0 + M[0] , M [-12] = 1
notice, how the answer will now be 1. Why, you ask, because I found a pair
of indices which was required.
-3 -> answer = 1 + M[-3], M [-15] = 1
8 -> answer = 1 + M[8], M [-4] = 1
12 -> answer = 1 + M[12], M[0] = 2
because M[0] was 1 before.
5 -> answer = 1 + M[5], M[-7] = 1
4 -> answer = 1 + M[4], M[-8] = 2
1 -> answer = 1 + M[1], M[-11] = 1
0 -> answer = 1 + M[0], M[-12] = 2
hence,
answer = 3.
Insertion in map takes logarithmic time. Overall complexity will be
O(nlog(n))

NOTE:
If you have to output indices, rather than the number, you can use a
map in which case the vector will store all the indices,
where the number came, and its size will tell the count.
I hope that makes sense. Feel free to ask if you didn't get something.


On Sun, Feb 21, 2016 at 3:18 PM, Shubh Aggarwal  wrote:

> Given an array of n elements(both +ve -ve allowed)
> Find all the subarrays with a given sum k!
> I know the solution using dynamic programming. It has to be done by
> recursion (as asked by the interviewer)
>
> For ex
>
> arr = 1 3 1 7 -4 -11 3 4 8
>
> k = 12
>
> answer = {1 3 1 7},  {4 8}, {1 3 1 7 -4 -11 3 4 8}
>
> You have to print {from index,  to last index} so for above example {0,
> 3}; {0,8}; {7,8} is the answer
>
> --
> 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.
>



-- 
 -Saurabh Paliwal

   B-Tech. Comp. Science and Engg.

   IIT ROORKEE

-- 
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] Openings in Mentor Graphics,Noida Location

[Pradeep Dubey]

Hi Ashish,

Can you forward my profile.

Thanks,
Pradeep

On Tue, Nov 17, 2015 at 10:04 AM, Ashish kumar Jain 
wrote:

> Anybody interested to join Mentor Graphics Noida having 1-10 years of
> experience in C/C++/DS/Algo can forward his/her resume to me.
>
> Please understand that the opening needs to be closed urgently.So,Hurry up.
>
> Note: Please ignore if inappropriate for this forum.
>
>
> --
> Regards,
> Ashish
>
> --
> 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.
>



-- 
Regards,
Pradeep

-- 
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.


Pradeep_Dubey.doc
Description: MS-Word document

Re: [algogeeks] Openings in Mentor Graphics,Noida Location

[Shachindra A C]

gj admin. Here's a question :
http://careercup.com/question?id=5720992639877120

On Mon, Nov 16, 2015 at 8:38 PM, saurabh singh  wrote:

> Banned for spamming.
> Again a request to the members to post algorithm related queries. Stuck in
> some programming problem? Post it here. Not understanding some algorithm?
> Post it here. Found an interesting problem? Post it.
>
> On Tue, Nov 17, 2015 at 10:04 AM Ashish kumar Jain 
> wrote:
>
>> Anybody interested to join Mentor Graphics Noida having 1-10 years of
>> experience in C/C++/DS/Algo can forward his/her resume to me.
>>
>> Please understand that the opening needs to be closed urgently.So,Hurry
>> up.
>>
>> Note: Please ignore if inappropriate for this forum.
>>
>>
>> --
>> Regards,
>> Ashish
>>
>> --
>> 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.
>



-- 
Regards,
Shachindra A C

-- 
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] Openings in Mentor Graphics,Noida Location

[Saurabh Agrawal]

Hi,

PFA.

With Regards,

Saurabh Agrawal

On Tue, Nov 17, 2015 at 10:04 AM, Ashish kumar Jain 
wrote:

> Anybody interested to join Mentor Graphics Noida having 1-10 years of
> experience in C/C++/DS/Algo can forward his/her resume to me.
>
> Please understand that the opening needs to be closed urgently.So,Hurry up.
>
> Note: Please ignore if inappropriate for this forum.
>
>
> --
> Regards,
> Ashish
>
> --
> 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.


Resume.docx
Description: MS-Word 2007 document

Re: [algogeeks] Re: Find max sum of elements in an array ( with twist)

[Saurabh Paliwal]

you don't need to have arrays to store everything. A more memory efficient
way is to store 2 values at each iteration whether to take this number or
not. Below is a python code doing just that.

def main():
numbers = map(int, raw_input().split())
maxTakingThis = 0
maxNotTakingThis = 0
for number in numbers:
maxTakingPrevious = maxTakingThis
maxNotTakingPrevious = maxNotTakingThis
maxTakingThis = number +
max(maxTakingPrevious,maxNotTakingPrevious)
maxNotTakingThis = maxTakingPrevious
print max(maxTakingThis,maxNotTakingThis)
return 0
if(__name__=="__main__"):
main()

On Tue, Jan 12, 2016 at 9:51 PM, yomama  wrote:
>
> Here's a solution in javascript
> var data = [10 , 20 , 30, -10 , -50 , 40 , -50, -1, -3];
> function max(array) {
> var i = array[0];
> array.forEach(function(val) {
> if(val > i)
> i = val;
> });
> return i;
> }
> function maxSum(i, data, canSkip) {
>var len = data.length  - i;
>if( len === 1) {
>if(canSkip && data[i] < 0) {
>return 0;
>} else {
>return data[i];
>}
>} else if(len <1) {
>   return 0;
>}
>var skippedI =  maxSum(i + 1, data, false);
>var notSkippedISkippedJ =  maxSum(i + 1, data, true) + data[i];
>var notSkippedINotSkippedJ =  maxSum(i + 2, data, true) + data[i] +
(data[i+1] || 0);
>if(canSkip) {
> return max([skippedI, notSkippedISkippedJ,
notSkippedINotSkippedJ]);
>} else {
> return max([notSkippedISkippedJ, notSkippedINotSkippedJ]);
>}
> }
>
> console.log(maxSum(0, data, true));
>
> On Tuesday, March 24, 2015 at 6:47:46 AM UTC-7, atul007 wrote:
>>
>> Given a array with +ve and -ve integer , find the maximum sum such that
you are not allowed to skip 2 contiguous elements ( i.e you have to select
atleast one of them to move forward).
>>
>> eg :-
>>
>> 10 , 20 , 30, -10 , -50 , 40 , -50, -1, -3
>>
>> Output : 10+20+30-10+40-1 = 89
>>
>>
> --
> 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.




-- 
 -Saurabh Paliwal

   B-Tech. Comp. Science and Engg.

   IIT ROORKEE

-- 
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] Find max sum of elements in an array ( with twist)

[Lego Haryanto]

Let function f(idx, can_skip) be the maximum possible value when we're
observing array element at idx, and can_skip tells the function whether it
can skip the element it is currently observing.

The recurrence relation for f(idx, can_skip) is:
  0 if idx == length of input arr,
  arr[idx] + f(idx+1, true) if can_skip == false,
  max(arr[idx] + f(idx+1, true), f(idx+1, false)) if can_skip == true

The solution of the whole thing shall be: f(0, true).


On Wed, Mar 25, 2015 at 2:58 PM, Coder Ad  wrote:

> Hi,
> I think that you should convert the elements of array to positive
> integers, calculate the max element and add this to all elements, after you
> should use DP.
>
> Thanks.
> Adolfo
>
>
> 2015-03-24 13:14 GMT-05:00 Madhav Mohan :
>
>> Algo
>>
>> 1.  Initialise MaxSum=0 ,I=0,n=no_of_elements
>>
>> 2. if ( n==0)
>> return 0
>>
>> 3. if  (n==1)
>> return A[0]
>>
>>  4. While(I<=n-2)
>> do
>>
>> // (-ve and +ve) or (-ve and -ve)
>>  if !(A[I]>=0 && A[I+1]>=0) {
>>
>>  res=findMax(A[I],A[I+1],) //returns -1 in case both are
>> equal and -ve, +1 for all others
>>
>> //maxindex returns index which is greater among the two nos
>>  if res>0 && Maxindex==I{
>> MaxSum+=A[MaxIndex]
>> I=I+1
>>  else if res>0 and Maxindex=I+1{
>>I+=2
>>MaxSum+=A[MaxIndex]
>>  }
>>  else if res==-1 (Both are -ve and equal){
>>   MaxSum+=A[MaxIndex]
>>   I+=2
>> }
>>  else{
>>   /*both are +ve*/
>>   MaxSum+=A[I]+A[I+1]
>>   I=I+2
>>  }
>>
>> endwhile
>>
>> 4. if I==n-1{
>> // if n is odd... //the execution will stop at n-1 , so we have one more
>> comparison with the last number...
>>
>> if MaxSum+A[I]>MaxSum
>> MaxSum=MaxSum+A[I]
>> }
>>
>> 5. Return  (MaxSum)
>>
>>
>> I verified it extensively for test cases including your example array,
>> found it to output 89...
>>
>> Waiting humbly for your opinion :-)
>>
>> Thanks
>> Madhav
>>
>> Thanks and Regards,
>> Madhav Mohan
>> Software Engineer
>> Mphasis LTD,Bangalore
>>
>>
>>
>>
>>
>> On Tue, Mar 24, 2015 at 7:17 PM, atul anand 
>> wrote:
>>
>>> Given a array with +ve and -ve integer , find the maximum sum such that
>>> you are not allowed to skip 2 contiguous elements ( i.e you have to select
>>> atleast one of them to move forward).
>>>
>>> eg :-
>>>
>>> 10 , 20 , 30, -10 , -50 , 40 , -50, -1, -3
>>>
>>> Output : 10+20+30-10+40-1 = 89
>>>
>>>
>>> --
>>> 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.

Re: [algogeeks] Openings in Mentor Graphics,Noida Location

[saurabh singh]

Banned for spamming.
Again a request to the members to post algorithm related queries. Stuck in
some programming problem? Post it here. Not understanding some algorithm?
Post it here. Found an interesting problem? Post it.

On Tue, Nov 17, 2015 at 10:04 AM Ashish kumar Jain 
wrote:

> Anybody interested to join Mentor Graphics Noida having 1-10 years of
> experience in C/C++/DS/Algo can forward his/her resume to me.
>
> Please understand that the opening needs to be closed urgently.So,Hurry up.
>
> Note: Please ignore if inappropriate for this forum.
>
>
> --
> Regards,
> Ashish
>
> --
> 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] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

[saurabh singh]

Banned for spamming.
Again a request to the members to post algorithm related queries. Stuck in
some programming problem? Post it here. Not understanding some algorithm?
Post it here. Found an interesting problem? Post it

On Mon, Nov 16, 2015 at 8:56 AM shashi kant  wrote:

> HI, thanks for letting me know ...
>
> *Shashi Kant *
> *"Think positive and find fuel in failure"*
>
> *Senior Member technical Staff*
> *Oracle India Pvt Ltd*
> http://thinkndoawesome.blogspot.com/
>
> On Mon, Nov 16, 2015 at 4:31 AM, Shachindra A C 
> wrote:
>
>> You're not supposed to post job ads over here. Please help keeping the
>> group clean.
>>
>> On Wed, Nov 11, 2015 at 7:55 PM, shashi kant 
>> wrote:
>>
>>> hi,
>>>
>>> *Note:* if an inappropriate mail ..please do ignore
>>>
>>> Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr ..mail
>>> your resume to me
>>>
>>>
>>>
>>> Regards,
>>> *Shashi Kant *
>>> *"Think positive and find fuel in failure"*
>>>
>>> *Senior Member technical Staff*
>>> *Oracle India Pvt Ltd*
>>> http://thinkndoawesome.blogspot.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.
>>>
>>
>>
>>
>> --
>> Regards,
>> Shachindra A C
>>
>> --
>> 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] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

[ashu agarwal]

Hi Shashi,

Please find the attached resume.
Please consider my resume for this job opening.

Thanks,
Ashu

On Thu, Nov 12, 2015 at 9:25 AM, shashi kant  wrote:

> hi,
>
> *Note:* if an inappropriate mail ..please do ignore
>
> Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr ..mail your
> resume to me
>
>
>
> Regards,
> *Shashi Kant *
> *"Think positive and find fuel in failure"*
>
> *Senior Member technical Staff*
> *Oracle India Pvt Ltd*
> http://thinkndoawesome.blogspot.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.
>



-- 
Thanks and Regards:
Ashu Agarwal
Aricent Group

-- 
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.


Ashu Agarwal.doc
Description: MS-Word document

Re: [algogeeks] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

[Shachindra A C]

You're not supposed to post job ads over here. Please help keeping the
group clean.

On Wed, Nov 11, 2015 at 7:55 PM, shashi kant  wrote:

> hi,
>
> *Note:* if an inappropriate mail ..please do ignore
>
> Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr ..mail your
> resume to me
>
>
>
> Regards,
> *Shashi Kant *
> *"Think positive and find fuel in failure"*
>
> *Senior Member technical Staff*
> *Oracle India Pvt Ltd*
> http://thinkndoawesome.blogspot.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.
>



-- 
Regards,
Shachindra A C

-- 
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] Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr

[shashi kant]

HI, thanks for letting me know ...

*Shashi Kant *
*"Think positive and find fuel in failure"*

*Senior Member technical Staff*
*Oracle India Pvt Ltd*
http://thinkndoawesome.blogspot.com/

On Mon, Nov 16, 2015 at 4:31 AM, Shachindra A C 
wrote:

> You're not supposed to post job ads over here. Please help keeping the
> group clean.
>
> On Wed, Nov 11, 2015 at 7:55 PM, shashi kant 
> wrote:
>
>> hi,
>>
>> *Note:* if an inappropriate mail ..please do ignore
>>
>> Opening in Oracle IDC: Having experience in C/C++ 1.5 to 3 yr ..mail your
>> resume to me
>>
>>
>>
>> Regards,
>> *Shashi Kant *
>> *"Think positive and find fuel in failure"*
>>
>> *Senior Member technical Staff*
>> *Oracle India Pvt Ltd*
>> http://thinkndoawesome.blogspot.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.
>>
>
>
>
> --
> Regards,
> Shachindra A C
>
> --
> 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] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

[Shachindra A C]

Well, you need to ban a whole lot more people.

On Mon, Nov 2, 2015 at 10:16 AM, saurabh singh  wrote:

> FYI, have banned this user and several others who mistook this group for a
> recruitment platform. Can we revive the legacy of this group again?
>
>
> On Mon, Nov 2, 2015 at 11:36 PM Shaik Asif 
> wrote:
>
>> Hi Partner,
>>
>> This is Shaik from Deegit Inc. Partner find the below requirement for
>> your consultants. If there are available. Please get back to me ASAP on
>> sh...@deegit.com
>>
>> *WE ARE LOOKING FOR 10+ YEAR'S RESUME'S*
>>
>> *Position: Lead - Java Developer *
>>
>> Location: Atlanta, GA 30301
>>
>> Duration: Long Term
>>
>>
>>
>> *Required skills: *
>>
>> · Experience in Unemployment Insurance
>>
>> · Core java, Spring MVC, SQL Transactions Annotations
>>
>> · experience with systems consulting, development and systems
>> engineering in software projects technical design and development of Java
>> based systems
>>
>> · Experience developing systems within the framework and
>> governance of a well-defined Systems Engineering Life Cycle (SELC)
>>
>> · Experience in the role of systems consultant on projects of
>> high complexity that typically have multiple concurrent and related
>> activities
>>
>> · Delivery role handling complex Java projects
>>
>> · demonstrated technical experience with:
>>
>> · Java, JSP/Servlets, XML,
>>
>> · SOAP, Struts/Spring/Hibernate
>>
>> · Knowledge of Design Patterns, UML and Web Services.
>>
>> · Knowledge of Weblogic.
>>
>> · Understanding of SQL queries, Stored procedure, DB Design etc.
>>
>> · Knowledge of Junit Framework and Testing Techniques,
>> Code-Coverage using java based tools like Eclipse
>>
>> Best Regards,
>>
>> ___
>>
>>
>>
>> Shaik | Deegit Inc |
>>
>> 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |
>>
>> Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987
>>
>> sh...@deegit.com | www.deegit.com |
>>
>>
>>
>> “GSA Approved - GS-35F-0405V”
>>
>> "Certified Minority Business Enterprise (MBE)"
>>
>> "Winner - Deloitte Technology Fast 500 for 2008"
>>
>> "Winner - Inc. 5000 fastest growing firm for 2008"
>>
>> "Winner - Inc. 5000 fastest growing firm for 2009"
>>
>>
>>
>> "Right Person for the Right Job in the Right Time"
>>
>>
>>
>> The information transmitted is intended only for the person or entity to
>> which it is addressed and may contain confidential and/or privileged
>> material. Any review, retransmission, dissemination or other use of, or
>> taking of any action in reliance upon, this information by persons or
>> entities other than the intended recipient is prohibited. If you received
>> this in error, please contact the sender and delete the material from any
>> computer.
>>
>> --
>> 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.
>



-- 
Regards,
Shachindra A C

-- 
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] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

[Deshank Baranwal]

I guess we need new admins who can actively moderate the group.


On Mon, Nov 2, 2015 at 6:30 PM, Shachindra A C 
wrote:

> Well, you need to ban a whole lot more people.
>
> On Mon, Nov 2, 2015 at 10:16 AM, saurabh singh 
> wrote:
>
>> FYI, have banned this user and several others who mistook this group for
>> a recruitment platform. Can we revive the legacy of this group again?
>>
>>
>> On Mon, Nov 2, 2015 at 11:36 PM Shaik Asif 
>> wrote:
>>
>>> Hi Partner,
>>>
>>> This is Shaik from Deegit Inc. Partner find the below requirement for
>>> your consultants. If there are available. Please get back to me ASAP on
>>> sh...@deegit.com
>>>
>>> *WE ARE LOOKING FOR 10+ YEAR'S RESUME'S*
>>>
>>> *Position: Lead - Java Developer *
>>>
>>> Location: Atlanta, GA 30301
>>>
>>> Duration: Long Term
>>>
>>>
>>>
>>> *Required skills: *
>>>
>>> · Experience in Unemployment Insurance
>>>
>>> · Core java, Spring MVC, SQL Transactions Annotations
>>>
>>> · experience with systems consulting, development and systems
>>> engineering in software projects technical design and development of Java
>>> based systems
>>>
>>> · Experience developing systems within the framework and
>>> governance of a well-defined Systems Engineering Life Cycle (SELC)
>>>
>>> · Experience in the role of systems consultant on projects of
>>> high complexity that typically have multiple concurrent and related
>>> activities
>>>
>>> · Delivery role handling complex Java projects
>>>
>>> · demonstrated technical experience with:
>>>
>>> · Java, JSP/Servlets, XML,
>>>
>>> · SOAP, Struts/Spring/Hibernate
>>>
>>> · Knowledge of Design Patterns, UML and Web Services.
>>>
>>> · Knowledge of Weblogic.
>>>
>>> · Understanding of SQL queries, Stored procedure, DB Design
>>> etc.
>>>
>>> · Knowledge of Junit Framework and Testing Techniques,
>>> Code-Coverage using java based tools like Eclipse
>>>
>>> Best Regards,
>>>
>>> ___
>>>
>>>
>>>
>>> Shaik | Deegit Inc |
>>>
>>> 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |
>>>
>>> Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987
>>>
>>> sh...@deegit.com | www.deegit.com |
>>>
>>>
>>>
>>> “GSA Approved - GS-35F-0405V”
>>>
>>> "Certified Minority Business Enterprise (MBE)"
>>>
>>> "Winner - Deloitte Technology Fast 500 for 2008"
>>>
>>> "Winner - Inc. 5000 fastest growing firm for 2008"
>>>
>>> "Winner - Inc. 5000 fastest growing firm for 2009"
>>>
>>>
>>>
>>> "Right Person for the Right Job in the Right Time"
>>>
>>>
>>>
>>> The information transmitted is intended only for the person or entity to
>>> which it is addressed and may contain confidential and/or privileged
>>> material. Any review, retransmission, dissemination or other use of, or
>>> taking of any action in reliance upon, this information by persons or
>>> entities other than the intended recipient is prohibited. If you received
>>> this in error, please contact the sender and delete the material from any
>>> computer.
>>>
>>> --
>>> 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.
>>
>
>
>
> --
> Regards,
> Shachindra A C
>
> --
> 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] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

[saurabh singh]

Yes, I would like that. I am sure about other admins, but I am guilty of
ignoring mails on the group. I am finding it hard to manage things between
job, other interests and google groups that I own/moderate. People who want
to volunteer to moderate this group, please reply (unicast to me,
*avoid reply all).*
Obviously also post stuff proactively so that the discussions can resume. :)

On Tue, Nov 3, 2015 at 12:02 AM Deshank Baranwal  wrote:

> I guess we need new admins who can actively moderate the group.
>
>
> On Mon, Nov 2, 2015 at 6:30 PM, Shachindra A C 
> wrote:
>
>> Well, you need to ban a whole lot more people.
>>
>> On Mon, Nov 2, 2015 at 10:16 AM, saurabh singh 
>> wrote:
>>
>>> FYI, have banned this user and several others who mistook this group for
>>> a recruitment platform. Can we revive the legacy of this group again?
>>>
>>>
>>> On Mon, Nov 2, 2015 at 11:36 PM Shaik Asif 
>>> wrote:
>>>
 Hi Partner,

 This is Shaik from Deegit Inc. Partner find the below requirement for
 your consultants. If there are available. Please get back to me ASAP on
 sh...@deegit.com

 *WE ARE LOOKING FOR 10+ YEAR'S RESUME'S*

 *Position: Lead - Java Developer *

 Location: Atlanta, GA 30301

 Duration: Long Term



 *Required skills: *

 · Experience in Unemployment Insurance

 · Core java, Spring MVC, SQL Transactions Annotations

 · experience with systems consulting, development and systems
 engineering in software projects technical design and development of Java
 based systems

 · Experience developing systems within the framework and
 governance of a well-defined Systems Engineering Life Cycle (SELC)

 · Experience in the role of systems consultant on projects of
 high complexity that typically have multiple concurrent and related
 activities

 · Delivery role handling complex Java projects

 · demonstrated technical experience with:

 · Java, JSP/Servlets, XML,

 · SOAP, Struts/Spring/Hibernate

 · Knowledge of Design Patterns, UML and Web Services.

 · Knowledge of Weblogic.

 · Understanding of SQL queries, Stored procedure, DB Design
 etc.

 · Knowledge of Junit Framework and Testing Techniques,
 Code-Coverage using java based tools like Eclipse

 Best Regards,

 ___



 Shaik | Deegit Inc |

 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |

 Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987

 sh...@deegit.com | www.deegit.com |



 “GSA Approved - GS-35F-0405V”

 "Certified Minority Business Enterprise (MBE)"

 "Winner - Deloitte Technology Fast 500 for 2008"

 "Winner - Inc. 5000 fastest growing firm for 2008"

 "Winner - Inc. 5000 fastest growing firm for 2009"



 "Right Person for the Right Job in the Right Time"



 The information transmitted is intended only for the person or entity
 to which it is addressed and may contain confidential and/or privileged
 material. Any review, retransmission, dissemination or other use of, or
 taking of any action in reliance upon, this information by persons or
 entities other than the intended recipient is prohibited. If you received
 this in error, please contact the sender and delete the material from any
 computer.

 --
 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.
>>>
>>
>>
>>
>> --
>> Regards,
>> Shachindra A C
>>
>> --
>> 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 

Re: [algogeeks] Urgent Need Hadoop Architect in Bellevue, WA for 6 months

[CHIRANJEEV KUMAR]

I'm interested for the position.

Thanks,
Chiranjeev
+917838025430


On Wed, Oct 7, 2015 at 9:41 PM, Shaik Asif  wrote:

> Hi,
>
>
>
> This is Shaik from Deegit Inc. Please find the below requirement for your
> review. If you are comfortable with the requirement please get back to me
> ASAP.
>
>
>
> *Position: Hadoop Architect *
>
> Location: Bellevue, WA
>
> Duration:  6 Months
>
>
>
> • Serve as a technical Hadoop resource to define, estimate, and create
> solutions based on requirements.
>
> • Lead Hadoop architecture and development team across all sub-streams.
> Define design and standards on the project.
>
> • Create architecture and technical design documents and data model in
> Hadoop  that will be implemented by the Hadoop development team.
>
> • Perform in-depth system analysis and data profiling on Hadoop platform.
>
> • Create source to target mapping for Developers to create HDFS objects
> and integration elements.
>
> • Develop proofs-of-concept and prototypes to help illustrate approaches
> to technology and business problems
>
>
>
>   Best Regards,
>
>
>
> Shaik Asif | Sr. Technical Recruiter
>
> *Deegit™ Inc* | Technology Consulting
>
> 1900 E Golf Rd., Suite 925, Schaumburg, IL 60173
>
> *Phone* (847) 440 2436 Ext. 358
>
> *Email **sh...@deegit.com *
>
> *www.deegit.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] Re: Openings in Flipkart BLR

[Shachindra A C]

Sadly, this has become no more than a job portal without any discussions on
algorithms at all...

~Sac

On Sun, Oct 4, 2015 at 10:18 PM, taruna arora  wrote:

> Dear Sir,
>
> I am Taruna Arora working as Software Engineer with Indian Oil Corporation
> Limited (PSU), Hire Date : 29th July, 2013.
>
> I came across your post today and wish to apply for the post of SDE1.
> Sir,I know its pretty late but I am enclosing my resume for further
> reference.
>
> Looking towards for opportunity from your side!!!
>
>
> Regards & Thanks
> Taruna Arora
>
> On Tuesday, 1 September 2015 21:38:43 UTC+5:30, Sachin Chitale wrote:
>
>> Hi folks,
>>
>> There are following open position in  flipkart if someone is interested
>> do send your resume.
>>
>> 1. SDE2/SDET 2/UI2 (2+ yrs)
>> 2. APM/PM/EM
>> 3. Engineering Directors
>> 4. Architect
>> 5. Data Scientist
>>
>> Regards,
>> Sachin
>>
> --
> 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.
>



-- 
Regards,
Shachindra A C

-- 
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] Urgent Need Test Lead - Performance Engineer / Architect - Middleware in Atlan,GA for 6 months

[Shachindra A C]

please stop spamming in this group.

On Fri, Sep 11, 2015 at 8:17 AM, Shaik Asif 
wrote:

> Hi,
>
>
>
> This is Shaik from Deegit Inc. Please find the below requirement for your
> review. If you are comfortable with the requirement please get back to me
> ASAP.
>
>
>
> *Position: Test Lead - Performance Engineer / Architect - Middleware *
>
> Location: Atlanta, GA
>
> Duration: 6 months
>
>
>
> *Job Description:*
>
> · Demonstrate Teamwork & collaboration skills to work across
> organizations and lead cross-functional teams
>
> · Experience with all phases of the Software Development
> Lifecycle, including system analysis, design, coding, testing, debugging
> and documentation
>
> · Problem solving skills to develop quick yet sound solutions to
> resolve complex issues
>
> · Experience with WebSphere and/or Web logic Application Server
> and its related components
>
> · Experience in installation, configuration, tuning ,
> troubleshooting, and administration of Web Logic and/or Web logic Server
>
> · Experience with Solaris/AIX/RHEL Operating Systems
>
> · Experience on TCP/IP, OSI, Routing, Firewall, DNS and other
> Network related concepts.
>
> · Experience with IBM Data power appliance administration.
>
> · Experience with Oracle Webserver and/or IBM HTTP Server. This
> includes  installation, configuration, tuning ,  and troubleshooting
>
> · Supporting Coherence and IBM Extreme Scale caching solutions
>
> · Experience in supporting Java and J2EE applications deployed in
> multi-site environment.
>
> · Experience in designing GSS and Load Balancer configurations to
> support redundancy and failover for applications.
>
> · Experience installing, configuring, and tuning TIBCO BW, BE,
> Active Spaces components
>
> · Experience with caching technologies like Oracle Coherence and
> IBM WebSphere / TIBCO Extreme Scale.
>
> · Experience installing and configuring IBM WebSphere Message
> Broker
>
> · Experience with scripting skills in Unix Shell, Perl, Python,
> Jython
>
> · Experience on other middle ware products like Jboss,Tomcat
>
> · Experience working with Load balancing solutions like CSS,
> Netscalers and F-5
>
> · Experience working with monitoring tools like Wily Introscope,
> HP Sitescope, Dynatrace etc.
>
> · Good time management, documentation and communication skills.
> Must be able to interact with vendors.
>
> · Enthusiasm and eagerness to learn and embrace new technologies
>
> · Strong  debugging skills to address issues ranging from
> Hardware, OS, Middleware, and Network
>
> · Proven expertise in designing and building high performance,
> scalable middleware and server side components and frameworks
>
> · Extensive experience in object oriented design and development
> techniques
>
> · Strong trouble shooting and problem solving skills
>
> · Good understanding of algorithms, data structures and
> performance optimization techniques
>
> · Proven track record of building scalable and reliable services
> on Cloud
>
>
>
> *Skills Required*
>
> · Core Java, C/C++, Javascript, JSON, XML
>
> · Jquery, Spring, Struts, Hibernate, iBatis, Node.js
>
> · Web Services - REST, Web Security
>
> · WebSphere, MQs, TIBCO BW, Active Spaces
>
> · mySQL, Memcache/Redis, Cassandra/Hbase, MongoDB/CouchDB
>
> · Map Reduce, Hadoop, Hive, Mah out,
>
> · Fast Data Processing Storm
>
> · Rules Engine Drools
>
>
> Best Regards,
>
> ___
>
>
>
> Shaik | Deegit Inc |
>
> 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |
>
> Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987
>
> sh...@deegit.com | www.deegit.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.
>



-- 
Regards,
Shachindra A C

-- 
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] Urgent Need ITIL Service Management Operations Business/Process Analyst in Manhattan, NY for 6+ months

[Shashwat Anand]

Can we please get rid of this spammer ?

On Thu, Sep 10, 2015 at 1:53 AM, Shachindra A C 
wrote:

> ^^ +1
>
> On Wed, Sep 9, 2015 at 12:54 PM, Rahul Vatsa 
> wrote:
>
>> Please block this guy.
>>
>> On Thu, Sep 10, 2015 at 1:08 AM, Shaik Asif 
>> wrote:
>>
>>> Hi Partner,
>>>
>>>
>>>
>>> This is Shaik from Deegit Inc. Please find the below requirement for
>>> your review. If you are comfortable with the requirement please get back to
>>> me ASAP on sh...@deegit.com
>>>
>>>
>>>
>>> *Position: ITIL Service Management Operations Business/Process Analyst*
>>>
>>> Location: Manhattan, NY   10001
>>>
>>> Duration: 6+ Months
>>>
>>>
>>>
>>> ITIL v3 Foundations or higher certification required
>>>
>>> · Experience with BMC Remedy required
>>>
>>> · Experience with ServiceNow beneficial
>>>
>>> · Able to understand and document complex IT processes
>>>
>>> · Experience performing IT assessments and preparing gap
>>> analysis documents and recommendations
>>>
>>> · Experience working as an analyst in support of IT technical
>>> operations (e.g. - service desk, desktop support, server and application
>>> management)
>>>
>>> · Very strong communication: verbal and written required. Able
>>> to facilitate workshops and meetings: drive agendas, document findings and
>>> next steps
>>>
>>>
>>> Best Regards,
>>>
>>> ___
>>>
>>>
>>>
>>> Shaik | Deegit Inc |
>>>
>>> 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |
>>>
>>> Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987
>>>
>>> sh...@deegit.com | www.deegit.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.
>>
>
>
>
> --
> Regards,
> Shachindra A C
>
> --
> 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] Urgent Need Test Lead - Performance Architect in Atlanta, GA for 6 months

[Shachindra A C]

Admin, please kick out people who post ads here.


On Tue, Sep 8, 2015 at 7:10 PM, Rahul  wrote:

> people aren't discussing algorithms either , like they used to in 2011
>
> On 9/9/15, Shachindra A C  wrote:
> > Hi all,
> >
> > Can we please limit this group to discussion on algorithms and not post
> > jobs over here? This is becoming a nuisance with all job ads posted.
> >
> >
> > On Tue, Sep 8, 2015 at 7:11 AM, Shaik Asif 
> > wrote:
> >
> >> Hi Partner,
> >>
> >>
> >>
> >> This is Shaik from Deegit Inc. Please find the below requirement for
> your
> >> review. If you are comfortable with the requirement please get back to
> me
> >> ASAP on sh...@deegit.com
> >>
> >>
> >>
> >> *Position: Test Lead - Performance Architect*
> >>
> >> Location: Atlanta, GA
> >>
> >> Duration: 6 Months
> >>
> >>
> >>
> >> · Performance Engineering of large transaction processing
> systems
> >>
> >> · Performance Modeling & Optimization of Solution Architectures
> >>
> >> · End tend systems performance analysis and performance tuning,
> >> in one or more of the following technologies : J2EE (Weblogic,
> Websphere,
> >> JBOSS), .NET, Oracle , SAP
> >>
> >> · Code Optimization and Platform Tuning in any of the above
> >> technologies
> >>
> >> · Proficiency in Performance Testing, profiling and monitoring
> >> tools (Certification in one or more of the following toolsets is
> >> desirable)
> >>
> >> · HP LoadRunner
> >>
> >> · HP Performance Center
> >>
> >> · HP BAC, Diagnostics
> >>
> >> · HP Sitescope
> >>
> >> · CA Wily Introscope and CEM (APM)
> >>
> >> · SAR, vmstat, iostat, netstat, perfmon
> >>
> >> · CA Hyperformix
> >>
> >> · CA LISA (formerly called ITKLISA)
> >>
> >> · Building Performance Engineering Strategies for clients
> >>
> >> · Performance Testing (load, stress, volume, availability,
> etc.),
> >> Regression, manual and automated testing of web based and client-server
> >> systems
> >>
> >> · End-to-end phases of performance testing, including
> >>
> >> · Performance Requirements Definition
> >>
> >> · Test Planning & Scheduling
> >>
> >> · Test Environment Planning
> >>
> >> · Defining performance metrics tbe captured across system and
> >> application tiers, using profiling & monitoring tools
> >>
> >> · Building performance test scripts
> >>
> >> · Performance test execution
> >>
> >> · End tend bottleneck analysis
> >>
> >> · Defining performance tuning measures end-to-end, across all
> >> tiers of applications being performance tested
> >>
> >> · Analysis of test data tidentify impact on release
> >>
> >> · Root cause analysis / diagnosis of performance issues that
> >> occur on production systems
> >>
> >> · Defect Tracking and documentation
> >>
> >> · Capacity Planning
> >>
> >> Best Regards,
> >>
> >> ___
> >>
> >>
> >>
> >> Shaik | Deegit Inc |
> >>
> >> 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |
> >>
> >> Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987
> >>
> >> sh...@deegit.com | www.deegit.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.
> >>
> >
> >
> >
> > --
> > Regards,
> > Shachindra A C
> >
> > --
> > 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.
> >
>
>
> --
>
>
>
>
>
> Regards
>
> Rahul Rai
>
> --
> 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.
>



-- 
Regards,
Shachindra A C

-- 
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] Urgent Need ITIL Service Management Operations Business/Process Analyst in Manhattan, NY for 6+ months

[Shachindra A C]

^^ +1

On Wed, Sep 9, 2015 at 12:54 PM, Rahul Vatsa  wrote:

> Please block this guy.
>
> On Thu, Sep 10, 2015 at 1:08 AM, Shaik Asif 
> wrote:
>
>> Hi Partner,
>>
>>
>>
>> This is Shaik from Deegit Inc. Please find the below requirement for your
>> review. If you are comfortable with the requirement please get back to me
>> ASAP on sh...@deegit.com
>>
>>
>>
>> *Position: ITIL Service Management Operations Business/Process Analyst*
>>
>> Location: Manhattan, NY   10001
>>
>> Duration: 6+ Months
>>
>>
>>
>> ITIL v3 Foundations or higher certification required
>>
>> · Experience with BMC Remedy required
>>
>> · Experience with ServiceNow beneficial
>>
>> · Able to understand and document complex IT processes
>>
>> · Experience performing IT assessments and preparing gap
>> analysis documents and recommendations
>>
>> · Experience working as an analyst in support of IT technical
>> operations (e.g. - service desk, desktop support, server and application
>> management)
>>
>> · Very strong communication: verbal and written required. Able
>> to facilitate workshops and meetings: drive agendas, document findings and
>> next steps
>>
>>
>> Best Regards,
>>
>> ___
>>
>>
>>
>> Shaik | Deegit Inc |
>>
>> 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |
>>
>> Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987
>>
>> sh...@deegit.com | www.deegit.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.
>



-- 
Regards,
Shachindra A C

-- 
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] Urgent Need ITIL Service Management Operations Business/Process Analyst in Manhattan, NY for 6+ months

[Rahul Vatsa]

Please block this guy.

On Thu, Sep 10, 2015 at 1:08 AM, Shaik Asif 
wrote:

> Hi Partner,
>
>
>
> This is Shaik from Deegit Inc. Please find the below requirement for your
> review. If you are comfortable with the requirement please get back to me
> ASAP on sh...@deegit.com
>
>
>
> *Position: ITIL Service Management Operations Business/Process Analyst*
>
> Location: Manhattan, NY   10001
>
> Duration: 6+ Months
>
>
>
> ITIL v3 Foundations or higher certification required
>
> · Experience with BMC Remedy required
>
> · Experience with ServiceNow beneficial
>
> · Able to understand and document complex IT processes
>
> · Experience performing IT assessments and preparing gap analysis
> documents and recommendations
>
> · Experience working as an analyst in support of IT technical
> operations (e.g. - service desk, desktop support, server and application
> management)
>
> · Very strong communication: verbal and written required. Able to
> facilitate workshops and meetings: drive agendas, document findings and
> next steps
>
>
> Best Regards,
>
> ___
>
>
>
> Shaik | Deegit Inc |
>
> 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |
>
> Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987
>
> sh...@deegit.com | www.deegit.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] Urgent Need Test Lead - Performance Architect in Atlanta, GA for 6 months

[Shachindra A C]

Hi all,

Can we please limit this group to discussion on algorithms and not post
jobs over here? This is becoming a nuisance with all job ads posted.


On Tue, Sep 8, 2015 at 7:11 AM, Shaik Asif  wrote:

> Hi Partner,
>
>
>
> This is Shaik from Deegit Inc. Please find the below requirement for your
> review. If you are comfortable with the requirement please get back to me
> ASAP on sh...@deegit.com
>
>
>
> *Position: Test Lead - Performance Architect*
>
> Location: Atlanta, GA
>
> Duration: 6 Months
>
>
>
> · Performance Engineering of large transaction processing systems
>
> · Performance Modeling & Optimization of Solution Architectures
>
> · End tend systems performance analysis and performance tuning,
> in one or more of the following technologies : J2EE (Weblogic, Websphere,
> JBOSS), .NET, Oracle , SAP
>
> · Code Optimization and Platform Tuning in any of the above
> technologies
>
> · Proficiency in Performance Testing, profiling and monitoring
> tools (Certification in one or more of the following toolsets is desirable)
>
> · HP LoadRunner
>
> · HP Performance Center
>
> · HP BAC, Diagnostics
>
> · HP Sitescope
>
> · CA Wily Introscope and CEM (APM)
>
> · SAR, vmstat, iostat, netstat, perfmon
>
> · CA Hyperformix
>
> · CA LISA (formerly called ITKLISA)
>
> · Building Performance Engineering Strategies for clients
>
> · Performance Testing (load, stress, volume, availability, etc.),
> Regression, manual and automated testing of web based and client-server
> systems
>
> · End-to-end phases of performance testing, including
>
> · Performance Requirements Definition
>
> · Test Planning & Scheduling
>
> · Test Environment Planning
>
> · Defining performance metrics tbe captured across system and
> application tiers, using profiling & monitoring tools
>
> · Building performance test scripts
>
> · Performance test execution
>
> · End tend bottleneck analysis
>
> · Defining performance tuning measures end-to-end, across all
> tiers of applications being performance tested
>
> · Analysis of test data tidentify impact on release
>
> · Root cause analysis / diagnosis of performance issues that
> occur on production systems
>
> · Defect Tracking and documentation
>
> · Capacity Planning
>
> Best Regards,
>
> ___
>
>
>
> Shaik | Deegit Inc |
>
> 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |
>
> Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987
>
> sh...@deegit.com | www.deegit.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.
>



-- 
Regards,
Shachindra A C

-- 
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] Urgent Need Test Lead - Performance Architect in Atlanta, GA for 6 months

[Rahul]

people aren't discussing algorithms either , like they used to in 2011

On 9/9/15, Shachindra A C  wrote:
> Hi all,
>
> Can we please limit this group to discussion on algorithms and not post
> jobs over here? This is becoming a nuisance with all job ads posted.
>
>
> On Tue, Sep 8, 2015 at 7:11 AM, Shaik Asif 
> wrote:
>
>> Hi Partner,
>>
>>
>>
>> This is Shaik from Deegit Inc. Please find the below requirement for your
>> review. If you are comfortable with the requirement please get back to me
>> ASAP on sh...@deegit.com
>>
>>
>>
>> *Position: Test Lead - Performance Architect*
>>
>> Location: Atlanta, GA
>>
>> Duration: 6 Months
>>
>>
>>
>> · Performance Engineering of large transaction processing systems
>>
>> · Performance Modeling & Optimization of Solution Architectures
>>
>> · End tend systems performance analysis and performance tuning,
>> in one or more of the following technologies : J2EE (Weblogic, Websphere,
>> JBOSS), .NET, Oracle , SAP
>>
>> · Code Optimization and Platform Tuning in any of the above
>> technologies
>>
>> · Proficiency in Performance Testing, profiling and monitoring
>> tools (Certification in one or more of the following toolsets is
>> desirable)
>>
>> · HP LoadRunner
>>
>> · HP Performance Center
>>
>> · HP BAC, Diagnostics
>>
>> · HP Sitescope
>>
>> · CA Wily Introscope and CEM (APM)
>>
>> · SAR, vmstat, iostat, netstat, perfmon
>>
>> · CA Hyperformix
>>
>> · CA LISA (formerly called ITKLISA)
>>
>> · Building Performance Engineering Strategies for clients
>>
>> · Performance Testing (load, stress, volume, availability, etc.),
>> Regression, manual and automated testing of web based and client-server
>> systems
>>
>> · End-to-end phases of performance testing, including
>>
>> · Performance Requirements Definition
>>
>> · Test Planning & Scheduling
>>
>> · Test Environment Planning
>>
>> · Defining performance metrics tbe captured across system and
>> application tiers, using profiling & monitoring tools
>>
>> · Building performance test scripts
>>
>> · Performance test execution
>>
>> · End tend bottleneck analysis
>>
>> · Defining performance tuning measures end-to-end, across all
>> tiers of applications being performance tested
>>
>> · Analysis of test data tidentify impact on release
>>
>> · Root cause analysis / diagnosis of performance issues that
>> occur on production systems
>>
>> · Defect Tracking and documentation
>>
>> · Capacity Planning
>>
>> Best Regards,
>>
>> ___
>>
>>
>>
>> Shaik | Deegit Inc |
>>
>> 1900 East Golf Rd., Suite 925 | Schaumburg, IL 60173 |
>>
>> Ph: 847.440.2436 ext - 358 | Fax: 847.330.1987
>>
>> sh...@deegit.com | www.deegit.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.
>>
>
>
>
> --
> Regards,
> Shachindra A C
>
> --
> 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.
>


-- 





Regards

Rahul Rai

-- 
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] Openings in Flipkart BLR

[arun tiwari]

On Tue, Sep 1, 2015 at 9:37 PM, Sachin Chitale 
wrote:

> Hi folks,
>
> There are following open position in  flipkart if someone is interested do
> send your resume.
>
> 1. SDE2/SDET 2/UI2 (2+ yrs)
> 2. APM/PM/EM
> 3. Engineering Directors
> 4. Architect
> 5. Data Scientist
>
> Regards,
> Sachin
>
> --
> 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.


Arun_Latest_Resume.doc
Description: MS-Word document

Re: [algogeeks] Acces violation problem

[shravan kumar C]

Hi Puneet,

First of all you have to do the type convertion for the below

struct bst *start=malloc(sizeof(struct bst));
as
struct bst *start= (struct bst *)malloc(sizeof(struct bst));

Reason behind is malloc will return void pointer.

Try to run after making this change at all the places where you are
calling malloc.

Regards,
Shravan

On Fri, Sep 4, 2015 at 9:47 AM, Puneet Gautam  wrote:
> HI, I am running the following peice of code on Dev-cpp compiler
>
> #include
> #include
> #include
> struct bst
> {
>int info;
>struct bst *leftnode;
>struct bst *rightnode;
> };
> void insert(struct bst *node,int val1)
> {
>  struct bst *newnode=malloc(sizeof(struct bst));
>  struct bst *temp=malloc(sizeof(struct bst));
>  newnode->info=val1;
>  temp=node;
>  while(temp)
>  {printf("\n Inside while loop");
>   if(val1<=temp->info)
>   if(temp->leftnode!=NULL)
>   {temp=temp->leftnode;
>printf("\n IN if of left");
>}
>   else
>   break;
>   else
>   if((temp->rightnode)!=NULL)
>   {   temp=temp->rightnode;
>printf("\n IN if of right");
>}
>   else
>   break;
>  }
>  if(!temp)
>  {free(temp);
>   return;
>  }
>   else if(val1<=temp->info)
>   {temp->leftnode=newnode;
>printf("\n Inserted to the left");
>   }
>   else
>{   temp->rightnode=newnode;
> printf("\n Inserted to the right");
>}
>   newnode->leftnode=NULL;
>   newnode->rightnode=NULL;
>   free(temp);
> }
> int main()
> {
> struct bst *start=malloc(sizeof(struct bst));
>// struct bst *newnode=malloc(sizeof(struct bst));
> start->info=10;
> start->leftnode=NULL;
> start->rightnode=NULL;
> printf("Data is :%d",start->info);
> getchar();
> insert(start,20);
>insert(start,5);
> getchar();
> free(start);
> return 0;
> }
>
> The compiler reports Access violation at the highlighted lines i.e.
> insert(start,5);
> But at the run of insert(start,20); , there is no problem as such.
> Please help !!
>
> Regards
> Puneet
>
> --
> 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,
Shravan Kumar Chiluveri

-- 
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] Openings in Flipkart BLR

[Amit Tiwari]

Hi,
What are the minimum qualifications for APM position?

Amit Tiwari
On Sep 1, 2015 9:38 PM, "Sachin Chitale"  wrote:

> Hi folks,
>
> There are following open position in  flipkart if someone is interested do
> send your resume.
>
> 1. SDE2/SDET 2/UI2 (2+ yrs)
> 2. APM/PM/EM
> 3. Engineering Directors
> 4. Architect
> 5. Data Scientist
>
> Regards,
> Sachin
>
> --
> 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] Acces violation problem

[pardeep rathee]

Do you really need to allocate memory here in this line ?
struct bst *temp=malloc(sizeof(struct bst));

there is memory leak here.
temp=node

And the problem statement is when you free(temp). Since temp is still
pointing to the tree parent node where you insert last value.

On Fri, Sep 4, 2015, 9:47 AM Puneet Gautam  wrote:

> HI, I am running the following peice of code on Dev-cpp compiler
>
> #include
> #include
> #include
> struct bst
> {
>int info;
>struct bst *leftnode;
>struct bst *rightnode;
> };
> void insert(struct bst *node,int val1)
> {
>  struct bst *newnode=malloc(sizeof(struct bst));
>  struct bst *temp=malloc(sizeof(struct bst));
>  newnode->info=val1;
>  temp=node;
>  while(temp)
>  {printf("\n Inside while loop");
> *  if(val1<=temp->info)*
>   if(temp->leftnode!=NULL)
>   {temp=temp->leftnode;
>printf("\n IN if of left");
>}
>   else
>   break;
>   else
>   if((temp->rightnode)!=NULL)
>   {   temp=temp->rightnode;
>printf("\n IN if of right");
>}
>   else
>   break;
>  }
>  if(!temp)
>  {free(temp);
>   return;
>  }
>   else if(val1<=temp->info)
>   {temp->leftnode=newnode;
>printf("\n Inserted to the left");
>   }
>   else
>{   temp->rightnode=newnode;
> printf("\n Inserted to the right");
>}
>   newnode->leftnode=NULL;
>   newnode->rightnode=NULL;
>   free(temp);
> }
> int main()
> {
> struct bst *start=malloc(sizeof(struct bst));
>// struct bst *newnode=malloc(sizeof(struct bst));
> start->info=10;
> start->leftnode=NULL;
> start->rightnode=NULL;
> printf("Data is :%d",start->info);
> getchar();
> insert(start,20);
>   * insert(start,5);*
> getchar();
> free(start);
> return 0;
> }
>
> The compiler reports *Access violation* at the highlighted lines i.e.
> *insert(start,5);*
> But at the run of insert(start,20); , there is no problem as such.
> Please help !!
>
> Regards
> Puneet
>
> --
> 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] 25 persons seated in a round table puzzle

[tec]

Another approach:

On the state [image: F=\{H_f,P_f\}], where each person holds exactly
one of [image:
H=\{25,25,24,24,\cdots,14,14,13\}], and keep passing on the rest 25
cards [image:
P=\{1,1,2,2,\cdots,12,12,13\}] to the left. Denote this as final state. In
this state, in every 25 rounds, the one holding 13 will get the other 13
once, thus having equal number on both cards.

On some state [image: S_i=\{H_i, P_i\} \ne F], there must be some [image: x
\in H_i], [image: y \in P_i] that [image: xy]. Suppose person [image: i]
holds card x, and card y is passed on to the [image: k_{th}] person(0k25)
to the right of person i.

Consider the next k-1 rounds: a) person i swaps card x for larger one to
hold; b) card x is hold by some one, no longer passing on; c) neither a nor
b happens, then person i holds card x and gets card y in [image: k_{th}]
round, thus passing on card x in the next round.

In all cases, someone swaps his holding card for larger one, and state [image:
\{H_i,P_i\}] changes with [image: \sum H_i] strictly increasing. Thus we
show that in any state other than final state F, state change must happen
within next 24 rounds.

On the other hand, the total increase in all rounds cannot exceed

[image: ((25+25+24+24+\ldots+14+14+13)-(1+1+2+2+\ldots+12+12+13)) = 312].

So there are no more than 312 state changes, each happening in at most 24
rounds after the previous change, ending with final state F, after which in
every 25 rounds one of the person gets 2 cards with number 13.

*tl;dr. After at most 312*24 rounds, the final state F is reached, when
each person holds one of [image: \{25,25,24,24,\cdots,14,14,13\}]. Then
with at most 25 extra rounds, one person get 2 cards with number 13.**
​

2015-08-19 19:43 GMT+08:00 tec technic@gmail.com:

 Consider each person holding 1 card (the larger) and passing 1 card around
 (the smaller, passing to his left).
 There are 25 cards on hold and 25 cards passing around at a time.
 When a person get a number smaller than his card on hold, he keeps the new
 card and passes on the original hold card (denoting this as a swap). In
 this case, the number on the card he holds strictly increases.
 Since the sum of the numbers on all 25 cards holding by someone cannot
 larger than 2*(25+24+...+14)+13 = 481, the number of swaps is finite in all
 possible scenario.

 Now prove by contradiction:
 Suppose at any point of time, no person will have same number on both his
 cards. then the passing on can continue infinitely.
 There must be a time point t, that no swaps occur after this point.
 Now we examine consequent 25 turns after t, the card hoding by each
 person, and the set of cards passing around, do not change in this period.
 Denoting the card hoding by i'th person as hi, and the card passing on
 from i'th person to the left at time t is pi.
 For each person i, he receives and passes on cards pi, pi+1, ..., p25, p1,
 ..., pi-1 in those turns, without swaping the card he holds.
 So hi = pj for all i,j in 1..25, i!=j. And the equality can not holds due
 to the assumption.
 ie. min{h1,h2,...,h25}  max{p1,p2,...p25}.
 But no such partition for set {1,1,2,2,...,25,25} exists. (the only
 partition that meets min{h1,h2,...,h25}  max{p1,p2,...p25} is
 {1,1,2,2,...,12,12,13} and {13,14,14,...,25,25})
 That contradicts our assumption, thus proved the original claim.



 2015-07-22 14:20 GMT+08:00 bujji jajala jajalabu...@gmail.com:

 25 persons are seated in a round table. There are two sets of cards, each
 set having 25 cards  numbered 1,2,3,, 25. Each one of them is given two
 cards from these set of cards.

 Each one will pass on card having smaller number to the one on his left.
 This happens synchronously.( All persons transfer cards at same instant ).
 Prove that at some point of time,
 some person will have same number on both his cards.

 -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.

Re: [algogeeks] 25 persons seated in a round table puzzle

[tec]

Consider each person holding 1 card (the larger) and passing 1 card around
(the smaller, passing to his left).
There are 25 cards on hold and 25 cards passing around at a time.
When a person get a number smaller than his card on hold, he keeps the new
card and passes on the original hold card (denoting this as a swap). In
this case, the number on the card he holds strictly increases.
Since the sum of the numbers on all 25 cards holding by someone cannot
larger than 2*(25+24+...+14)+13 = 481, the number of swaps is finite in all
possible scenario.

Now prove by contradiction:
Suppose at any point of time, no person will have same number on both his
cards. then the passing on can continue infinitely.
There must be a time point t, that no swaps occur after this point.
Now we examine consequent 25 turns after t, the card hoding by each person,
and the set of cards passing around, do not change in this period.
Denoting the card hoding by i'th person as hi, and the card passing on from
i'th person to the left at time t is pi.
For each person i, he receives and passes on cards pi, pi+1, ..., p25, p1,
..., pi-1 in those turns, without swaping the card he holds.
So hi = pj for all i,j in 1..25, i!=j. And the equality can not holds due
to the assumption.
ie. min{h1,h2,...,h25}  max{p1,p2,...p25}.
But no such partition for set {1,1,2,2,...,25,25} exists. (the only
partition that meets min{h1,h2,...,h25}  max{p1,p2,...p25} is
{1,1,2,2,...,12,12,13} and {13,14,14,...,25,25})
That contradicts our assumption, thus proved the original claim.



2015-07-22 14:20 GMT+08:00 bujji jajala jajalabu...@gmail.com:

 25 persons are seated in a round table. There are two sets of cards, each
 set having 25 cards  numbered 1,2,3,, 25. Each one of them is given two
 cards from these set of cards.

 Each one will pass on card having smaller number to the one on his left.
 This happens synchronously.( All persons transfer cards at same instant ).
 Prove that at some point of time,
 some person will have same number on both his cards.

 -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.

Re: [algogeeks] Re: how to convert JSONObject object to java object ??

[Ankit Agarwal]

You can use Object Mapper, provided by com.fasterxml.jackson.core.

There is a readValue which can convert string type object to any class
object which you want.

Check this maven repo
http://mvnrepository.com/artifact/com.fasterxml.jackson.core/jackson-core/2.6.0-rc2
for
the jar


Thanks  Regards

On Fri, Jun 19, 2015 at 2:43 AM, Nand Kumar Singh nandkuma...@gmail.com
wrote:

 Rest Url : 
 http://localhost:8080//rest/hotel?{location:28.666045,77.185059,longitube:null,latitude:null,pincode:null,childrens:0,adults:1,dateCheckIn:143468460,dateCheckOut:143472420,searchedString:Sarai
 Rohilla Railway Station, Railway Officers Colony, New Delhi,
 India,marker:1,city:Delhi,rooms:0}


 On Friday, 19 June 2015 02:24:27 UTC+5:30, Nand Kumar Singh wrote:

 How am i trying till now .

 @RequestMapping(value = /rest/hotel, method = RequestMethod.GET)
 @Produces(application/json)
 @Consumes(application/json)
 public @ResponseBody ListHotelBO search(JSONObject inputJsonObj) throws 
 ParseException, IOException {

 Gson gson = new Gson();
 GsonBuilder builder = new GsonBuilder();
 Search vc = gson.fromJson(inputJsonObj.toString(), Search.class);
   *}*


 *but its not working any idea ?*

  --
 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.




-- 

*Ankit Agarwal*
*Software Engineer*
*Seller **Platform*
*Flipkart Internet Pvt. Ltd.*
*Ph. No. +91-8095470278*

-- 
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] Opening @ Microsoft Hyd

[Abhijeet Srivastva]

Hi Vikrant
Find my attached resume.

Regards,
Abhijeet Srivastava
09871147025

On Thu, Jun 11, 2015 at 3:36 PM, ~*~VICKY~*~ venkat.jun...@gmail.com
wrote:

 Yes, please forward me your resume .

 On Thu, Jun 11, 2015 at 3:20 PM, Abhijeet Srivastva 
 nwaab.abhij...@gmail.com wrote:

 Hi Venkat,
 I have total 7 years of work experience in core development and currently
 working in one of the top Product development company.
 Please let me know how can i apply for the position.

 Regards,
 Abhijeet Srivastava
 0987114705

 On Sat, Jun 6, 2015 at 12:40 PM, ~*~VICKY~*~ venkat.jun...@gmail.com
 wrote:

 Hi,

 Only to folks in Bangalore

 My team is expanding and is looking for strong devs with deep
 understanding of basics and problem solving skills. The openings are in
 Hyderabad for which will be doing a walk-in interview in Bangalore over
 third week of this month.  If you think you can take up the challenge
 of redesigning and optimizing the cloud computing world, send me your
 resumes (preferably one page resume) to give a shot at this great
 opportunity.

 PS : No freshers please, Minimum experience of 2 years preferably.
 --
 Cheers,

   Vicky

 --
 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.




 --
 Cheers,

   Vicky

 --
 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.


Abhijeet__Srivastva.doc
Description: MS-Word document

Re: [algogeeks] Opening @ Microsoft Hyd

[Abhijeet Srivastva]

Hi Venkat,
I have total 7 years of work experience in core development and currently
working in one of the top Product development company.
Please let me know how can i apply for the position.

Regards,
Abhijeet Srivastava
0987114705

On Sat, Jun 6, 2015 at 12:40 PM, ~*~VICKY~*~ venkat.jun...@gmail.com
wrote:

 Hi,

 Only to folks in Bangalore

 My team is expanding and is looking for strong devs with deep
 understanding of basics and problem solving skills. The openings are in
 Hyderabad for which will be doing a walk-in interview in Bangalore over
 third week of this month.  If you think you can take up the challenge of
 redesigning and optimizing the cloud computing world, send me your resumes
 (preferably one page resume) to give a shot at this great opportunity.

 PS : No freshers please, Minimum experience of 2 years preferably.
 --
 Cheers,

   Vicky

 --
 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] Opening @ Microsoft Hyd

[~*~VICKY~*~]

Yes, please forward me your resume .

On Thu, Jun 11, 2015 at 3:20 PM, Abhijeet Srivastva 
nwaab.abhij...@gmail.com wrote:

 Hi Venkat,
 I have total 7 years of work experience in core development and currently
 working in one of the top Product development company.
 Please let me know how can i apply for the position.

 Regards,
 Abhijeet Srivastava
 0987114705

 On Sat, Jun 6, 2015 at 12:40 PM, ~*~VICKY~*~ venkat.jun...@gmail.com
 wrote:

 Hi,

 Only to folks in Bangalore

 My team is expanding and is looking for strong devs with deep
 understanding of basics and problem solving skills. The openings are in
 Hyderabad for which will be doing a walk-in interview in Bangalore over
 third week of this month.  If you think you can take up the challenge of
 redesigning and optimizing the cloud computing world, send me your resumes
 (preferably one page resume) to give a shot at this great opportunity.

 PS : No freshers please, Minimum experience of 2 years preferably.
 --
 Cheers,

   Vicky

 --
 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.




-- 
Cheers,

  Vicky

-- 
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] Find max sum of elements in an array ( with twist)

[Coder Ad]

Hi,
I think that you should convert the elements of array to positive integers,
calculate the max element and add this to all elements, after you should
use DP.

Thanks.
Adolfo


2015-03-24 13:14 GMT-05:00 Madhav Mohan madhav...@gmail.com:

 Algo

 1.  Initialise MaxSum=0 ,I=0,n=no_of_elements

 2. if ( n==0)
 return 0

 3. if  (n==1)
 return A[0]

  4. While(I=n-2)
 do

 // (-ve and +ve) or (-ve and -ve)
  if !(A[I]=0  A[I+1]=0) {

  res=findMax(A[I],A[I+1],maxindex) //returns -1 in case both are
 equal and -ve, +1 for all others

 //maxindex returns index which is greater among the two nos
  if res0  Maxindex==I{
 MaxSum+=A[MaxIndex]
 I=I+1
  else if res0 and Maxindex=I+1{
I+=2
MaxSum+=A[MaxIndex]
  }
  else if res==-1 (Both are -ve and equal){
   MaxSum+=A[MaxIndex]
   I+=2
 }
  else{
   /*both are +ve*/
   MaxSum+=A[I]+A[I+1]
   I=I+2
  }

 endwhile

 4. if I==n-1{
 // if n is odd... //the execution will stop at n-1 , so we have one more
 comparison with the last number...

 if MaxSum+A[I]MaxSum
 MaxSum=MaxSum+A[I]
 }

 5. Return  (MaxSum)


 I verified it extensively for test cases including your example array,
 found it to output 89...

 Waiting humbly for your opinion :-)

 Thanks
 Madhav

 Thanks and Regards,
 Madhav Mohan
 Software Engineer
 Mphasis LTD,Bangalore





 On Tue, Mar 24, 2015 at 7:17 PM, atul anand atul.87fri...@gmail.com
 wrote:

 Given a array with +ve and -ve integer , find the maximum sum such that
 you are not allowed to skip 2 contiguous elements ( i.e you have to select
 atleast one of them to move forward).

 eg :-

 10 , 20 , 30, -10 , -50 , 40 , -50, -1, -3

 Output : 10+20+30-10+40-1 = 89


  --
 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] Find max sum of elements in an array ( with twist)

[Madhav Mohan]

Algo

1.  Initialise MaxSum=0 ,I=0,n=no_of_elements

2. if ( n==0)
return 0

3. if  (n==1)
return A[0]

 4. While(I=n-2)
do

// (-ve and +ve) or (-ve and -ve)
 if !(A[I]=0  A[I+1]=0) {

 res=findMax(A[I],A[I+1],maxindex) //returns -1 in case both are
equal and -ve, +1 for all others

//maxindex returns index which is greater among the two nos
 if res0  Maxindex==I{
MaxSum+=A[MaxIndex]
I=I+1
 else if res0 and Maxindex=I+1{
   I+=2
   MaxSum+=A[MaxIndex]
 }
 else if res==-1 (Both are -ve and equal){
  MaxSum+=A[MaxIndex]
  I+=2
}
 else{
  /*both are +ve*/
  MaxSum+=A[I]+A[I+1]
  I=I+2
 }

endwhile

4. if I==n-1{
// if n is odd... //the execution will stop at n-1 , so we have one more
comparison with the last number...

if MaxSum+A[I]MaxSum
MaxSum=MaxSum+A[I]
}

5. Return  (MaxSum)


I verified it extensively for test cases including your example array,
found it to output 89...

Waiting humbly for your opinion :-)

Thanks
Madhav

Thanks and Regards,
Madhav Mohan
Software Engineer
Mphasis LTD,Bangalore





On Tue, Mar 24, 2015 at 7:17 PM, atul anand atul.87fri...@gmail.com wrote:

 Given a array with +ve and -ve integer , find the maximum sum such that
 you are not allowed to skip 2 contiguous elements ( i.e you have to select
 atleast one of them to move forward).

 eg :-

 10 , 20 , 30, -10 , -50 , 40 , -50, -1, -3

 Output : 10+20+30-10+40-1 = 89


  --
 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] Distributed System problem

[Abioy Sun]

i think the main point to solve this problem is just seprating 'addressing'
and 'hotness'.

'addressing' i used is quite simple, that is 'hash'.
in this case, to balance 'hotness', i'll cut resources into small pieces,
so that resources could be well-distributed and so as 'hotness'.

further more, in some other cases with meta data for addressing the
resources, i'll also use 'replication' to handle different 'hotness'
requirement.


2014-12-14 16:34 GMT+08:00 atul anand atul.87fri...@gmail.com:

 It is a system design problem .

 Suppose a http request  is sent to server . Now Server maintains cache for
 fast retrieval . if link is present int the cache then it just takes a data
 from cache and return it to user but if not , then user will fetch that
 http address and then store it in its cache and return same to the user .

 Problem is that there are many server and many global cache as expected in
 distributed system. Now when request is received by a server then how can
 we maintain global cache such that server can know which cache to query
 instead of querying each global cache as it will be inefficient.

 one approach can be.. maintain 26 global cache . Now when request is
 received by server it check the web link say , www.*a*bc.com ... here
 server will query cache-1 . Similarly cache-2 will take care of links with
 starts from b...www.*b*bc.com and so on

 above method will avoid duplicity in caches but will not be very efficient
 as a cache may have higher query rate than others...


 any other approach ??

 --
 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] Openings in Snapdeal

[CHIRANJEEV KUMAR]

May I send resume of my friends ?

On Thu, Feb 19, 2015 at 11:17 AM, Romil Goyal vamosro...@gmail.com wrote:

 Hi everyone,

 Snapdeal is having a lot of open positions for developers both at senior
 and junior level.

 Send your resumes to me at vamosro...@gmail.com
 Java people are highly preferred but not mandatory.

 --
 Romil

 --
 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] Distributed System problem

[Piyush Grover]

Lets assume there are n global caches and since the load is to be
distributed uniformly among the servers and duplicity needs to be avoided,
you need to write a hashfunction f which takes url as an input and returns
an integer value. You can store that url on the cache x where
x = value % n
each time you need to compute the hashvalue and based on that you need to
query on the particular cache x, if it's available bingo
else store that url to cache x.

Hope it helps.



On Sun, Dec 14, 2014 at 2:29 PM, atul anand atul.87fri...@gmail.com wrote:

 approach i have mentioned have flaws .  so what other approaches we can
 try to solve this ?

 On Sun, Dec 14, 2014 at 2:23 PM, SOMU somnath.nit...@gmail.com wrote:

 Then the Domain name is altered from abc to bbc .. That indirectly means
 that the nameserver will change.

 So in that case the Cache will point to the New NameServer ..

 Thanks,
 Somnath Singh

 On Sun, Dec 14, 2014 at 2:04 PM, atul anand atul.87fri...@gmail.com
 wrote:

 It is a system design problem .

 Suppose a http request  is sent to server . Now Server maintains cache
 for fast retrieval . if link is present int the cache then it just takes a
 data from cache and return it to user but if not , then user will fetch
 that http address and then store it in its cache and return same to the
 user .

 Problem is that there are many server and many global cache as expected
 in distributed system. Now when request is received by a server then how
 can we maintain global cache such that server can know which cache to query
 instead of querying each global cache as it will be inefficient.

 one approach can be.. maintain 26 global cache . Now when request is
 received by server it check the web link say , www.*a*bc.com ... here
 server will query cache-1 . Similarly cache-2 will take care of links with
 starts from b...www.*b*bc.com and so on

 above method will avoid duplicity in caches but will not be very
 efficient as a cache may have higher query rate than others...


 any other approach ??

 --
 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.




-- 
Piyush Grover

*Be a traveler, not a tourist*

-- 
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] Better data structure/Algorithm to handle the following porblem

[atul anand]

B+ tree is used by database... i guess same can be used here.
On 28 Dec 2014 16:13, kumar raja rajkumar.cs...@gmail.com wrote:

 which is like a table in database, and produces results for user queries.

 Data is: in txt file.

 ID, FIRSTNAME, LASTNAME, AGE, SALARY, TITLE
 1, venkatesh, kumar, 21, 3, reporter
 2, kiran, kannan, 45, 9000, chairman
 3, pradeep, mishra, 35, 15000, manager
 4, suman, raj, 35, 12000, manager

 user query will be like
 select firstName, lastName where age25 orderby salary dsc

 dsc - for descending
 you have to produce appropriate records.

 --
 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] Yo! Help me make a Music Video

[saurabh singh]

Nope. Forwarding this mail to a group with over 1 k members is definitely 
begging. It's shameless begging as it can get. No,Didn't bother to open the 
link. Also banning you from the group. 

-Original Message-
From: Shrey Choudhary choudharyshre...@gmail.com
Sent: ‎12/‎28/‎2014 4:52 PM
To: a.mat...@accenture.com a.mat...@accenture.com; Aadhaar Sharma 
aadhaar.r.sha...@gmail.com; Aakanksha Raghav aakanksha.rag...@gmail.com; 
abhijitcomplete . abhijitcompl...@gmail.com; Abhilash Rajpoot 
abhilashrajpoot.n...@gmail.com; Abhinav kapur abhinav.nit...@gmail.com; 
abhinay.mo...@tctinfotech.com abhinay.mo...@tctinfotech.com; 
admin.off...@oberoigroup.com admin.off...@oberoigroup.com; Airtel 
Presence airtelprese...@airtel.in; Akash Bajaj aks...@gmail.com; Akhil 
Saraf saraf.akhi...@gmail.com; algogeeks@googlegroups.com 
algogeeks@googlegroups.com; ami.ta...@gmail.com ami.ta...@gmail.com; 
Amit Goel amitgoel@gmail.com; Amit Kumar Singh 
amit.si...@99acres.com; Anjali Gupta anjaligupta@gmail.com; ankit 
malik ankitmal...@gmail.com; ankit verma a_verm...@yahoo.co.in; Ankit 
Yadav ankityadav27...@gmail.com; antriksh.c...@nic.in 
antriksh.c...@nic.in; Anurag Dak anurag...@gmail.com; Anurag Kundu 
anurag13ku...@gmail.com; anushree bhatt 1594anush...@gmail.com; aparna 
roy tnahps...@gmail.com; arjun singh arjun107...@gmail.com; Arpan 
Saxena arpan.sax...@naukri.com; arushi paliwal 
paliwalarush...@gmail.com; atam prakash atam...@gmail.com; Bhumika 
Sachdeva swtmit...@gmail.com; cyberbyte.literat...@gmail.com 
cyberbyte.literat...@gmail.com; danish.shab...@accenture.com 
danish.shab...@accenture.com; deep...@proteaminc.com 
deep...@proteaminc.com; Deepali Garg nikki.deep...@gmail.com; 
dhruv_mech...@yahoo.co.in dhruv_mech...@yahoo.co.in; ekta dwivedy 
ektadwiv...@gmail.com; fansofn...@gmail.com fansofn...@gmail.com; Gaurav 
Goel gaurav16g...@gmail.com; Gaurav Sharma gaurav07101...@gmail.com; 
Gaurav Walia gauravwalia2...@gmail.com; gnee...@amazon.com 
gnee...@amazon.com; Helios NITK helios12.n...@gmail.com; 
helios.nitk2...@gmail.com helios.nitk2...@gmail.com; Himsa Narzari 
himsa.narz...@gmail.com; i...@chillomrecordsindia.com 
i...@chillomrecordsindia.com; infotechnit...@googlegroups.com 
infotechnit...@googlegroups.com; intern...@tctinfotech.com 
intern...@tctinfotech.com; invest...@naukri.com invest...@naukri.com; 
Jasmine Gambhir gambhir.jasm...@gmail.com; Jitender Kumar 
jkjitenderkum...@gmail.com; jitenderchha...@gmail.com 
jitenderchha...@gmail.com; kamal khandelwal kkhandel...@gmail.com; 
Kanika Bansal kanikaban...@drishti-soft.com; Kashish Mittal 
kashishmitta...@gmail.com; khurana.prach...@yahoo.in 
khurana.prach...@yahoo.in; kriti.j...@99acres.com kriti.j...@99acres.com; 
Kunal Kapoor kunal.kap...@exlservice.com; Kunsana Tab 
kunalkapoo...@yahoo.com; larry.guill...@rackspace.com 
larry.guill...@rackspace.com; LOKESH GUPTA lokeshgupt...@gmail.com; 
Madhuresh Srivastava madhures...@gmail.com; Mamta Kayest 
mamta1987...@gmail.com; Manish Dhall manishdhal...@gmail.com; 
manishkam...@rediffmail.com manishkam...@rediffmail.com
Subject: [algogeeks] Yo! Help me make a Music Video

Waddup guys,

Hope everything is fine at your end. So this is a personal mail, I'm sending 
out. I've recently started my IndieGogo Crowdfunding Campaign for a hip hop 
music video. I'm now taking my passion for rapping to another level. It's just 
that I'm little short of funds. I need around 1000 to 1400 $ to come out with a 
good concept music video and hire promoters to do the same. 


The details of  the campaign can be found at this link. 
https://www.indiegogo.com/projects/indian-hiphop-single-music-video/x/9462122


If you all believe in me, donate a dollar or two; that's mere ~Rs 120. People 
smoke this much amount in one day. 




PS: If you think am begging for money, then please you don't have to pay 
anything. Don't even open the link and you can happily remove me from your 
circle. Because am a friend asking for help from friends . Nothing else.






Regards
Shrey Choudhary

Mobile: +919953029023



The future belongs to those who believe in the beauty of their dreams - 
Eleanor Roosevelt

-- 
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] Need a Proper ebook of Javascript

[VINOD CHOUDHARY]

You can find some interesting books from here.
http://jsbooks.revolunet.com/

On Tue, Dec 9, 2014 at 10:01 PM, shivank goyal goyalshiva...@gmail.com
wrote:

 *Ebook *

 *Javascript : The Good Parts : *

 Download link:
 https://www.acmi.net.au/media/12347/javascript_the_good_parts.pdf


 *Other Good Links*

- *http://alistapart.com/article/getoutbindingsituations
http://alistapart.com/article/getoutbindingsituations*
- *http://www.toptal.com/javascript/interview-questions
http://www.toptal.com/javascript/interview-questions*


 On Tue, Oct 28, 2014 at 9:29 PM, SAMMM somnath.nit...@gmail.com wrote:

 Hello All,

 Can anyone forward a ebook from where frequently asked
 Javascript and JQuery Questions are asked ? And from where we can get the
 real problem which are faced in Javascript and JQuery in Projects??

 Pls If anyone know any reference of ebook plz send me ...


 Thanks,
 Somnath Singh

 --
 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,
 Shivank

 --
 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.




-- 
*VINOD KUMAR CHOUDHARY*
*Bachelor of Technology*
*Motilal Nehru National Institute of Technology*
*Allahabad[211004],UP.*

-- 
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] Digest for algogeeks@googlegroups.com - 3 updates in 1 topic

[Vikas Rastogi]

another one could be some sort of hashing logic modulo n. Get request,
create hash , compute modulo n. check assign cache and return. This will
make sure of even distribution but with additional cost of hash computation.

Regards,
Vikash
8121873513

On Sun, Dec 14, 2014 at 5:07 PM, algogeeks@googlegroups.com wrote:

 algogeeks@googlegroups.com
 https://groups.google.com/forum/?utm_source=digestutm_medium=email#!forum/algogeeks/topics
   Google
 Groups
 https://groups.google.com/forum/?utm_source=digestutm_medium=email/#!overview
 https://groups.google.com/forum/?utm_source=digestutm_medium=email/#!overview
   Topic digest
  View all topics
 https://groups.google.com/forum/?utm_source=digestutm_medium=email#!forum/algogeeks/topics

-  Distributed System problem #14a489759ff4211e_group_thread_0 - 3
Updates

   Distributed System problem
 http://groups.google.com/group/algogeeks/t/a74720cc5f28f8b?utm_source=digestutm_medium=email
   atul anand atul.87fri...@gmail.com: Dec 14 02:04PM +0530

 It is a system design problem .

 Suppose a http request is sent to server . Now Server maintains cache for
 fast retrieval . if link is present int the cache then it just takes a data
 from cache and return it to user but if not , then user will fetch that
 http address and then store it in its cache and return same to the user .

 Problem is that there are many server and many global cache as expected in
 distributed system. Now when request is received by a server then how can
 we maintain global cache such that server can know which cache to query
 instead of querying each global cache as it will be inefficient.

 one approach can be.. maintain 26 global cache . Now when request is
 received by server it check the web link say , www.*a*bc.com ... here
 server will query cache-1 . Similarly cache-2 will take care of links with
 starts from b...www.*b*bc.com and so on

 above method will avoid duplicity in caches but will not be very efficient
 as a cache may have higher query rate than others...


 any other approach ??
   SOMU somnath.nit...@gmail.com: Dec 14 02:23PM +0530

 Then the Domain name is altered from abc to bbc .. That indirectly means
 that the nameserver will change.

 So in that case the Cache will point to the New NameServer ..

 Thanks,
 Somnath Singh

   atul anand atul.87fri...@gmail.com: Dec 14 02:29PM +0530

 approach i have mentioned have flaws . so what other approaches we can try
 to solve this ?

   Back to top #14a489759ff4211e_digest_top
You received this digest because you're subscribed to updates for this
 group. You can change your settings on the group membership page
 https://groups.google.com/forum/?utm_source=digestutm_medium=email#!forum/algogeeks/join
 .
 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] Distributed System problem

[SOMU]

Then the Domain name is altered from abc to bbc .. That indirectly means
that the nameserver will change.

So in that case the Cache will point to the New NameServer ..

Thanks,
Somnath Singh

On Sun, Dec 14, 2014 at 2:04 PM, atul anand atul.87fri...@gmail.com wrote:

 It is a system design problem .

 Suppose a http request  is sent to server . Now Server maintains cache for
 fast retrieval . if link is present int the cache then it just takes a data
 from cache and return it to user but if not , then user will fetch that
 http address and then store it in its cache and return same to the user .

 Problem is that there are many server and many global cache as expected in
 distributed system. Now when request is received by a server then how can
 we maintain global cache such that server can know which cache to query
 instead of querying each global cache as it will be inefficient.

 one approach can be.. maintain 26 global cache . Now when request is
 received by server it check the web link say , www.*a*bc.com ... here
 server will query cache-1 . Similarly cache-2 will take care of links with
 starts from b...www.*b*bc.com and so on

 above method will avoid duplicity in caches but will not be very efficient
 as a cache may have higher query rate than others...


 any other approach ??

 --
 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] Distributed System problem

[atul anand]

approach i have mentioned have flaws .  so what other approaches we can try
to solve this ?

On Sun, Dec 14, 2014 at 2:23 PM, SOMU somnath.nit...@gmail.com wrote:

 Then the Domain name is altered from abc to bbc .. That indirectly means
 that the nameserver will change.

 So in that case the Cache will point to the New NameServer ..

 Thanks,
 Somnath Singh

 On Sun, Dec 14, 2014 at 2:04 PM, atul anand atul.87fri...@gmail.com
 wrote:

 It is a system design problem .

 Suppose a http request  is sent to server . Now Server maintains cache
 for fast retrieval . if link is present int the cache then it just takes a
 data from cache and return it to user but if not , then user will fetch
 that http address and then store it in its cache and return same to the
 user .

 Problem is that there are many server and many global cache as expected
 in distributed system. Now when request is received by a server then how
 can we maintain global cache such that server can know which cache to query
 instead of querying each global cache as it will be inefficient.

 one approach can be.. maintain 26 global cache . Now when request is
 received by server it check the web link say , www.*a*bc.com ... here
 server will query cache-1 . Similarly cache-2 will take care of links with
 starts from b...www.*b*bc.com and so on

 above method will avoid duplicity in caches but will not be very
 efficient as a cache may have higher query rate than others...


 any other approach ??

 --
 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] Largest Rectangle

[kumar raja]

If anyone have answer to this question, please share it. I need the
solution for this prolem.

On 2 August 2011 at 19:42, payel roy smithpa...@gmail.com wrote:

 Given a Binary Matrix of 0's and 1's. Print the largest Sub-matrix with
 all boundary elements 0.
 Explain your whole algorithm with an example.

 --
 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 unsubscribe from this group and stop receiving emails from it, send an email 
to algogeeks+unsubscr...@googlegroups.com.

Re: [algogeeks] Most Optimal Palindrome?

[prasanna]

Hi,

just compare the 0th position of the string with length-1 position of the
string, 2nd position of the string with length-2 postion of the string and
so.on

eg: 12132, in first comparison itself, will fail.

Thanks
Prasanna M

On Mon, Oct 13, 2014 at 4:47 AM, Carl Barton odysseus.ulys...@gmail.com
wrote:

 You don't need to reverse anything. You reverse half the number and then
 compare positions, why not just compare things straight away? Also note
 that your solution is not n/2. Should the length be n it would be at least
 n operations. n/2 to reverse half the string and then n/2 comparisons.
 However, your method is depedent on the number of digits in a number and a
 number n does not have n digits in it, it will be approximately log n. See
 here for more information
 http://math.stackexchange.com/questions/231742/proof-how-many-digits-does-a-number-have-lfloor-log-10-n-rfloor-1


 On 12 October 2014 21:06, Rishav Mishra rishav.mish...@gmail.com wrote:

 Hi everyone,

 I was recently asked a question to find the most optimal solution to
 finding if a given number 'n' is a palindrome or not.

 I suggested reversing the first half of the number and comparing it with
 the second half, giving complexity O (n/2).

 He still seemed unsatisfied and wanted me to further optimize it. Any
 clues on how to optimize this simple question further!?


  --
 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.




-- 
Thanks
Prasanna M

-- 
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] Need a Proper ebook of Javascript

[shivank goyal]

*Ebook *

*Javascript : The Good Parts : *

Download link:
https://www.acmi.net.au/media/12347/javascript_the_good_parts.pdf


*Other Good Links*

   - *http://alistapart.com/article/getoutbindingsituations
   http://alistapart.com/article/getoutbindingsituations*
   - *http://www.toptal.com/javascript/interview-questions
   http://www.toptal.com/javascript/interview-questions*


On Tue, Oct 28, 2014 at 9:29 PM, SAMMM somnath.nit...@gmail.com wrote:

 Hello All,

 Can anyone forward a ebook from where frequently asked
 Javascript and JQuery Questions are asked ? And from where we can get the
 real problem which are faced in Javascript and JQuery in Projects??

 Pls If anyone know any reference of ebook plz send me ...


 Thanks,
 Somnath Singh

 --
 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,
Shivank

-- 
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] SDE-1 openings in Amazon

[sourabh jain]

Location?

Thank You
Have a Nice Day :)

Regards
Sourabh Kumar Jain
Computer Science Corporation(CSC)
Hyderabad, Telangana.
MOB.-+91916049
  +919993878717

On 2 December 2014 at 15:44, Bhanu Kishore bhanukishor...@gmail.com wrote:

 Hi,
   We have 4 SDE-1 openings in our team at Amazon Hyderabad. If any of you
 are interested, you can forward your resume to bhanukishor...@gmail.com

 --
 Thank  Regards,

 Bhanu Kishore Diddi.
 Software Development Engineer,
 Amazon India Development Center(Hyderabad).
 Mobile :- 9704253365
 Email:- kisho...@amazon.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] SDE-1 openings in Amazon

[Aman (neshu) Agarwal]

Hi,

We also have some openings in Hyderabad For SDE-1 and SDE-2 position for
Amazon.

Interested people can forward CV on neshuagarwal1...@gmail.com.

Regards,
Aman

On Tue, Dec 2, 2014 at 4:07 PM, sourabh jain sourabhjain...@gmail.com
wrote:

 Location?

 Thank You
 Have a Nice Day :)

 Regards
 Sourabh Kumar Jain
 Computer Science Corporation(CSC)
 Hyderabad, Telangana.
 MOB.-+91916049
   +919993878717

 On 2 December 2014 at 15:44, Bhanu Kishore bhanukishor...@gmail.com
 wrote:

 Hi,
   We have 4 SDE-1 openings in our team at Amazon Hyderabad. If any of you
 are interested, you can forward your resume to bhanukishor...@gmail.com

 --
 Thank  Regards,

 Bhanu Kishore Diddi.
 Software Development Engineer,
 Amazon India Development Center(Hyderabad).
 Mobile :- 9704253365
 Email:- kisho...@amazon.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.




-- 
Aman A.
Amazon.com | Software Development Engineer | TAM - Technology

एकम् सत्, विप्राः बहुधा वदन्ति

-- 
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] Technology for Graphical User Interface on Linux

[rahul]

ncurses.

On Friday, October 17, 2014, Mayur mayurhem...@gmail.com wrote:
 Not the right forum..
 But you can try Qt if licensing isn't a concern.
 Or GTK+.

 On Mon, Oct 6, 2014 at 8:03 PM, sagar sindwani sindwani.sa...@gmail.com
wrote:

 Hi all,
 I am looking for a good tool or language to create graphical user
interface in linux environment. Java can be used to achieve the purpose,
Can you please let me know any other technology for such purpose.


 Thanks
 Sagar

 --
 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] Technology for Graphical User Interface on Linux

[Mayur]

Not the right forum..
But you can try Qt if licensing isn't a concern.
Or GTK+.


On Mon, Oct 6, 2014 at 8:03 PM, sagar sindwani sindwani.sa...@gmail.com
wrote:

 Hi all,

 I am looking for a good tool or language to create graphical user
 interface in linux environment. Java can be used to achieve the purpose,
 Can you please let me know any other technology for such purpose.


 Thanks
 Sagar

 --
 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] Openings in Adobe India !!!

[Shashwat Anand]

People seems to confuse algogeeks with job board.
No idea, how can we get rid of these spam.

On Tue, Oct 14, 2014 at 2:25 PM, Ashish Mehta mehta.ashis...@gmail.com
wrote:

 There are multiple openings in Adobe India for Developer position. Send me
 your resume ASAP.

 Here is the list of urgent openings.


-

·   31639_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=fYIUCfXMqBAaj0T8JrUMKA

·31497_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=U5lgab7ocxgSbz0CjInfyw

·26279_ Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=hgTkxxHjX-jEcKNXOpxJBw

·30965_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=H7s2s7lpI3YK*RhWvOrU*Q

·31344_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=z6oIOM05vEdN6aZ76w1NXg

·30759_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=iYfB3oGLK*cP-GdYbRYqRA

·32543_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=DQ-WKuGH8byLQ9Z5p8vWWQ

·27526_Security Czar
https://workspaces.acrobat.com/?d=2lXPky*D8qGxQbm9KDHdIw

·30262_Member of Technical Staff / Computer Scientist - MAC
Developer https://workspaces.acrobat.com/?d=8MDJ3-8PpjXLwSN8sZe2lQ

·30976 Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=AzpXN7cZ1Zh9l1usUsUMEQ


 Conditions for freshers:

- Candidate should be from a premier college i.e. IIT/IIIT/NIT/BITS or
equivalent.
- In case of any college from where Adobe does not hire developers. I
would recommend that you have something concrete in your resume so that I
can talk to HR with confidence. :)
Do mention this in the mail.

 Regards,
 Ashish

 --
 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] Openings in Adobe India !!!

[Shachindra A C]

+1 for Shashwat. Kindly refrain from posting jobs here. There would be
other groups for that.

On Tue, Oct 14, 2014 at 2:01 AM, Shashwat Anand m...@shashwat.me wrote:

 People seems to confuse algogeeks with job board.
 No idea, how can we get rid of these spam.

 On Tue, Oct 14, 2014 at 2:25 PM, Ashish Mehta mehta.ashis...@gmail.com
 wrote:

 There are multiple openings in Adobe India for Developer position. Send
 me your resume ASAP.

 Here is the list of urgent openings.


-

·   31639_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=fYIUCfXMqBAaj0T8JrUMKA

·31497_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=U5lgab7ocxgSbz0CjInfyw

·26279_ Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=hgTkxxHjX-jEcKNXOpxJBw

·30965_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=H7s2s7lpI3YK*RhWvOrU*Q

·31344_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=z6oIOM05vEdN6aZ76w1NXg

·30759_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=iYfB3oGLK*cP-GdYbRYqRA

·32543_Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=DQ-WKuGH8byLQ9Z5p8vWWQ

·27526_Security Czar
https://workspaces.acrobat.com/?d=2lXPky*D8qGxQbm9KDHdIw

·30262_Member of Technical Staff / Computer Scientist - MAC
Developer https://workspaces.acrobat.com/?d=8MDJ3-8PpjXLwSN8sZe2lQ

·30976 Member of Technical Staff / Computer Scientist
https://workspaces.acrobat.com/?d=AzpXN7cZ1Zh9l1usUsUMEQ


 Conditions for freshers:

- Candidate should be from a premier college i.e. IIT/IIIT/NIT/BITS
or equivalent.
- In case of any college from where Adobe does not hire developers. I
would recommend that you have something concrete in your resume so that I
can talk to HR with confidence. :)
Do mention this in the mail.

 Regards,
 Ashish

 --
 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.




-- 
Regards,
Shachindra A C

-- 
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] Most Optimal Palindrome?

[Carl Barton]

You don't need to reverse anything. You reverse half the number and then
compare positions, why not just compare things straight away? Also note
that your solution is not n/2. Should the length be n it would be at least
n operations. n/2 to reverse half the string and then n/2 comparisons.
However, your method is depedent on the number of digits in a number and a
number n does not have n digits in it, it will be approximately log n. See
here for more information
http://math.stackexchange.com/questions/231742/proof-how-many-digits-does-a-number-have-lfloor-log-10-n-rfloor-1


On 12 October 2014 21:06, Rishav Mishra rishav.mish...@gmail.com wrote:

 Hi everyone,

 I was recently asked a question to find the most optimal solution to
 finding if a given number 'n' is a palindrome or not.

 I suggested reversing the first half of the number and comparing it with
 the second half, giving complexity O (n/2).

 He still seemed unsatisfied and wanted me to further optimize it. Any
 clues on how to optimize this simple question further!?


  --
 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] Re: Comparing string of unequal length

[Prateek Khandelwal]

I think this question can be done in O((m-n)*n) where m is the length of
larger string and n is the length of smaller string

Prateek Khandelwal
Software Engineer in Directi
+91-7042393719

On Tue, Oct 7, 2014 at 6:06 PM, vikas vikas.rastogi2...@gmail.com wrote:

 question unclear ?What is to be minimize ?
 in given example:
 ca*d*bch
 abc

 what is role of d ?


 On Monday, 6 October 2014 22:52:10 UTC+5:30, Rishav wrote:

 Hi everyone,

 I was asked this question recently in an interview: Given two strings of
 unequal length, you have to pad the smaller string (either at the beginning
 or the end or both, no insertions allowed) with any character you want. The
 idea is to minimize the index-wise non-similar elements in both the strings.

 Example:
 abc
 cadbch

 The character we want should be:

 **abc*, such that the difference is just one(b and c are same for both
 strings in this position). I only found a solution with O(mn) complexity.
 Anybody can suggest any optimizations?

  --
 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] Re: Comparing string of unequal length

[Prateek Khandelwal]

Just think in this manner that put 0 star in front, then 1 star in front
and so on and while doing this just compare both the strings. If you are
not able to understand just tell me I will mail my code to you.

Prateek Khandelwal
Software Engineer in Directi
+91-7042393719

On Tue, Oct 7, 2014 at 11:23 PM, Prateek Khandelwal pratv...@gmail.com
wrote:

 I think this question can be done in O((m-n)*n) where m is the length of
 larger string and n is the length of smaller string

 Prateek Khandelwal
 Software Engineer in Directi
 +91-7042393719

 On Tue, Oct 7, 2014 at 6:06 PM, vikas vikas.rastogi2...@gmail.com wrote:

 question unclear ?What is to be minimize ?
 in given example:
 ca*d*bch
 abc

 what is role of d ?


 On Monday, 6 October 2014 22:52:10 UTC+5:30, Rishav wrote:

 Hi everyone,

 I was asked this question recently in an interview: Given two strings of
 unequal length, you have to pad the smaller string (either at the beginning
 or the end or both, no insertions allowed) with any character you want. The
 idea is to minimize the index-wise non-similar elements in both the strings.

 Example:
 abc
 cadbch

 The character we want should be:

 **abc*, such that the difference is just one(b and c are same for both
 strings in this position). I only found a solution with O(mn) complexity.
 Anybody can suggest any optimizations?

  --
 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] Re: Comparing string of unequal length

[Rishav Mishra]

Hi Vikas and Prateek,

Vikas, the 'd' is arbitrary. The question is simply to return the padded
string such that the number of similar characters in the padded smaller
string (which is now equal in length to the bigger string) and the bigger
string is the minimum.

Prateek, I can understand the solution you mentioned- be great if you can
send your code.

However, I understand that the smaller string has to be moved (m-n) times
and each time there are n comparisons. If anybody has any ideas for
additional optimizations (even with lets say additional space complexity),
it would be awesome to hear!

On Tue, Oct 7, 2014 at 11:29 PM, Prateek Khandelwal pratv...@gmail.com
wrote:

 Just think in this manner that put 0 star in front, then 1 star in front
 and so on and while doing this just compare both the strings. If you are
 not able to understand just tell me I will mail my code to you.

 Prateek Khandelwal
 Software Engineer in Directi
 +91-7042393719

 On Tue, Oct 7, 2014 at 11:23 PM, Prateek Khandelwal pratv...@gmail.com
 wrote:

 I think this question can be done in O((m-n)*n) where m is the length of
 larger string and n is the length of smaller string

 Prateek Khandelwal
 Software Engineer in Directi
 +91-7042393719

 On Tue, Oct 7, 2014 at 6:06 PM, vikas vikas.rastogi2...@gmail.com
 wrote:

 question unclear ?What is to be minimize ?
 in given example:
 ca*d*bch
 abc

 what is role of d ?


 On Monday, 6 October 2014 22:52:10 UTC+5:30, Rishav wrote:

 Hi everyone,

 I was asked this question recently in an interview: Given two strings
 of unequal length, you have to pad the smaller string (either at the
 beginning or the end or both, no insertions allowed) with any character you
 want. The idea is to minimize the index-wise non-similar elements in both
 the strings.

 Example:
 abc
 cadbch

 The character we want should be:

 **abc*, such that the difference is just one(b and c are same for both
 strings in this position). I only found a solution with O(mn) complexity.
 Anybody can suggest any optimizations?

  --
 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] C++ initialization list

[Deepak Garg]

Hi

In example 1, member z will have a garbage value (i.e. 0 in your case )

Thanks
Deepak
On Sep 28, 2014 11:29 AM, sagar sindwani sindwani.sa...@gmail.com wrote:

 I am working on How compilers handle initialization list. I came across a
 case where I am not sure what should be the compiler behaviour.

 *Example 1:-*

 #include iostream

 class A
 {
 public:
 int x,y,z;
 };

 int main()
 {
 A a1[2] =
 {
 { 1,2 },
 { 3,4 }
 };

 std::cout  a1[0].z is   a1[0].z  std::endl;

 return 0;
 }

 In above case a1[0].z is ? g++ shows it as 0 ( zero ). It is exactly 0 or
 garbage value, I am not sure on that.

 I tried lot of books and some documents , no where I found what C++ says
 for initialization of class objects.

 You can find handling of below case in almost every book.

 *Example 2:- *

 int arr[6] = {0};

 In Example 2,  compilers will auto-fill all members with 0. It is
 mentioned in books. But when it comes to User-defined datatypes nothing is
 mentioned.


 Please share your thoughts on this. If you find any document related to
 this, please share it as well.

 Thanks
 Sagar

 --
 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] C++ initialization list

[Rahul Vatsa]

http://stackoverflow.com/questions/3127454/how-do-c-class-members-get-initialized-if-i-dont-do-it-explicitly

On Sun, Sep 28, 2014 at 12:22 PM, Deepak Garg deepakgarg...@gmail.com
wrote:

 Hi

 In example 1, member z will have a garbage value (i.e. 0 in your case )

 Thanks
 Deepak
 On Sep 28, 2014 11:29 AM, sagar sindwani sindwani.sa...@gmail.com
 wrote:

 I am working on How compilers handle initialization list. I came across a
 case where I am not sure what should be the compiler behaviour.

 *Example 1:-*

 #include iostream

 class A
 {
 public:
 int x,y,z;
 };

 int main()
 {
 A a1[2] =
 {
 { 1,2 },
 { 3,4 }
 };

 std::cout  a1[0].z is   a1[0].z  std::endl;

 return 0;
 }

 In above case a1[0].z is ? g++ shows it as 0 ( zero ). It is exactly 0 or
 garbage value, I am not sure on that.

 I tried lot of books and some documents , no where I found what C++ says
 for initialization of class objects.

 You can find handling of below case in almost every book.

 *Example 2:- *

 int arr[6] = {0};

 In Example 2,  compilers will auto-fill all members with 0. It is
 mentioned in books. But when it comes to User-defined datatypes nothing is
 mentioned.


 Please share your thoughts on this. If you find any document related to
 this, please share it as well.

 Thanks
 Sagar

 --
 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] C++ initialization list

[sagar sindwani]

Thanks Deepak and Rahul for the reply.

Do you guys have any standard document or any standard book which defines
this?  I totally agree with these answers but I don't have any formal
written text.

In my example 1, the object is on stack and this lead to a1[0].z to be
un-initialized. But as the specified in example 2, Why every element of arr
is initialized, it is also on the stack ? Any source to answer this
question ?

Thanks
Sagar



On Sun, Sep 28, 2014 at 2:26 PM, Rahul Vatsa vatsa.ra...@gmail.com wrote:


 http://stackoverflow.com/questions/3127454/how-do-c-class-members-get-initialized-if-i-dont-do-it-explicitly

 On Sun, Sep 28, 2014 at 12:22 PM, Deepak Garg deepakgarg...@gmail.com
 wrote:

 Hi

 In example 1, member z will have a garbage value (i.e. 0 in your case )

 Thanks
 Deepak
 On Sep 28, 2014 11:29 AM, sagar sindwani sindwani.sa...@gmail.com
 wrote:

 I am working on How compilers handle initialization list. I came across
 a case where I am not sure what should be the compiler behaviour.

 *Example 1:-*

 #include iostream

 class A
 {
 public:
 int x,y,z;
 };

 int main()
 {
 A a1[2] =
 {
 { 1,2 },
 { 3,4 }
 };

 std::cout  a1[0].z is   a1[0].z  std::endl;

 return 0;
 }

 In above case a1[0].z is ? g++ shows it as 0 ( zero ). It is exactly 0
 or garbage value, I am not sure on that.

 I tried lot of books and some documents , no where I found what C++ says
 for initialization of class objects.

 You can find handling of below case in almost every book.

 *Example 2:- *

 int arr[6] = {0};

 In Example 2,  compilers will auto-fill all members with 0. It is
 mentioned in books. But when it comes to User-defined datatypes nothing is
 mentioned.


 Please share your thoughts on this. If you find any document related to
 this, please share it as well.

 Thanks
 Sagar

 --
 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.

Re: [algogeeks] C++ initialization list

[Deepak Garg]

Hi sagar

Actually its the compiler which is doing things for you.
GCC or G++ have some features that allows you to initialize array. For
example in your case 2 when you specify a single element gcc intializes the
whole array with 0. You can do this also:
Int arr [6]={[3]=0, [4]=5} p.s. gcc allows u to do this type of
initialisation.
You can refer gcc doc online for more info.
 On Sep 28, 2014 3:59 PM, sagar sindwani sindwani.sa...@gmail.com wrote:

 Thanks Deepak and Rahul for the reply.

 Do you guys have any standard document or any standard book which defines
 this?  I totally agree with these answers but I don't have any formal
 written text.

 In my example 1, the object is on stack and this lead to a1[0].z to be
 un-initialized. But as the specified in example 2, Why every element of arr
 is initialized, it is also on the stack ? Any source to answer this
 question ?

 Thanks
 Sagar



 On Sun, Sep 28, 2014 at 2:26 PM, Rahul Vatsa vatsa.ra...@gmail.com
 wrote:


 http://stackoverflow.com/questions/3127454/how-do-c-class-members-get-initialized-if-i-dont-do-it-explicitly

 On Sun, Sep 28, 2014 at 12:22 PM, Deepak Garg deepakgarg...@gmail.com
 wrote:

 Hi

 In example 1, member z will have a garbage value (i.e. 0 in your case )

 Thanks
 Deepak
 On Sep 28, 2014 11:29 AM, sagar sindwani sindwani.sa...@gmail.com
 wrote:

 I am working on How compilers handle initialization list. I came across
 a case where I am not sure what should be the compiler behaviour.

 *Example 1:-*

 #include iostream

 class A
 {
 public:
 int x,y,z;
 };

 int main()
 {
 A a1[2] =
 {
 { 1,2 },
 { 3,4 }
 };

 std::cout  a1[0].z is   a1[0].z  std::endl;

 return 0;
 }

 In above case a1[0].z is ? g++ shows it as 0 ( zero ). It is exactly 0
 or garbage value, I am not sure on that.

 I tried lot of books and some documents , no where I found what C++
 says for initialization of class objects.

 You can find handling of below case in almost every book.

 *Example 2:- *

 int arr[6] = {0};

 In Example 2,  compilers will auto-fill all members with 0. It is
 mentioned in books. But when it comes to User-defined datatypes nothing is
 mentioned.


 Please share your thoughts on this. If you find any document related to
 this, please share it as well.

 Thanks
 Sagar

 --
 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.


-- 
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] C++ initialization list

[saurabh singh]

Here you go
http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2012/n3337.pdf
The c++ standard itself. Refer to section 8.5.4 page no. 213.
Looks like even this int a[10] = {2} is not guaranteed to initialize all
the elements of the array. Sure gcc provides this but then it becomes a
compiler specific thing. The language doesn't advocates it.

Saurabh Singh
B.Tech (Computer Science)
MNNIT
blog:geekinessthecoolway.blogspot.com

On Sun, Sep 28, 2014 at 3:47 PM, sagar sindwani sindwani.sa...@gmail.com
wrote:

 Thanks Deepak and Rahul for the reply.

 Do you guys have any standard document or any standard book which defines
 this?  I totally agree with these answers but I don't have any formal
 written text.

 In my example 1, the object is on stack and this lead to a1[0].z to be
 un-initialized. But as the specified in example 2, Why every element of arr
 is initialized, it is also on the stack ? Any source to answer this
 question ?

 Thanks
 Sagar



 On Sun, Sep 28, 2014 at 2:26 PM, Rahul Vatsa vatsa.ra...@gmail.com
 wrote:


 http://stackoverflow.com/questions/3127454/how-do-c-class-members-get-initialized-if-i-dont-do-it-explicitly

 On Sun, Sep 28, 2014 at 12:22 PM, Deepak Garg deepakgarg...@gmail.com
 wrote:

 Hi

 In example 1, member z will have a garbage value (i.e. 0 in your case )

 Thanks
 Deepak
 On Sep 28, 2014 11:29 AM, sagar sindwani sindwani.sa...@gmail.com
 wrote:

 I am working on How compilers handle initialization list. I came across
 a case where I am not sure what should be the compiler behaviour.

 *Example 1:-*

 #include iostream

 class A
 {
 public:
 int x,y,z;
 };

 int main()
 {
 A a1[2] =
 {
 { 1,2 },
 { 3,4 }
 };

 std::cout  a1[0].z is   a1[0].z  std::endl;

 return 0;
 }

 In above case a1[0].z is ? g++ shows it as 0 ( zero ). It is exactly 0
 or garbage value, I am not sure on that.

 I tried lot of books and some documents , no where I found what C++
 says for initialization of class objects.

 You can find handling of below case in almost every book.

 *Example 2:- *

 int arr[6] = {0};

 In Example 2,  compilers will auto-fill all members with 0. It is
 mentioned in books. But when it comes to User-defined datatypes nothing is
 mentioned.


 Please share your thoughts on this. If you find any document related to
 this, please share it as well.

 Thanks
 Sagar

 --
 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.


-- 
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] C++ initialization list

[sagar sindwani]

Hi Saurabh

Thanks for the document. Please refer to start of page 214, Section 8.5.4
,point 3, Below is example from that

struct S2 {
int m1;
double m2, m3;
};
S2 s21 = { 1, 2, 3.0 };   // OK
S2 s22 { 1.0, 2, 3 };  error: narrowing
S2 s23 { }; // OK: default to 0,0,0


I tried the above case with valgrind, even valgrind had not shown any
un-initialized read.

Document also says it is incomplete and incorrect.

Thanks
Sagar










On Sun, Sep 28, 2014 at 4:41 PM, saurabh singh saurab...@gmail.com wrote:

 Here you go
 http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2012/n3337.pdf
 The c++ standard itself. Refer to section 8.5.4 page no. 213.
 Looks like even this int a[10] = {2} is not guaranteed to initialize all
 the elements of the array. Sure gcc provides this but then it becomes a
 compiler specific thing. The language doesn't advocates it.

 Saurabh Singh
 B.Tech (Computer Science)
 MNNIT
 blog:geekinessthecoolway.blogspot.com

 On Sun, Sep 28, 2014 at 3:47 PM, sagar sindwani sindwani.sa...@gmail.com
 wrote:

 Thanks Deepak and Rahul for the reply.

 Do you guys have any standard document or any standard book which defines
 this?  I totally agree with these answers but I don't have any formal
 written text.

 In my example 1, the object is on stack and this lead to a1[0].z to be
 un-initialized. But as the specified in example 2, Why every element of arr
 is initialized, it is also on the stack ? Any source to answer this
 question ?

 Thanks
 Sagar



 On Sun, Sep 28, 2014 at 2:26 PM, Rahul Vatsa vatsa.ra...@gmail.com
 wrote:


 http://stackoverflow.com/questions/3127454/how-do-c-class-members-get-initialized-if-i-dont-do-it-explicitly

 On Sun, Sep 28, 2014 at 12:22 PM, Deepak Garg deepakgarg...@gmail.com
 wrote:

 Hi

 In example 1, member z will have a garbage value (i.e. 0 in your case )

 Thanks
 Deepak
 On Sep 28, 2014 11:29 AM, sagar sindwani sindwani.sa...@gmail.com
 wrote:

 I am working on How compilers handle initialization list. I came
 across a case where I am not sure what should be the compiler behaviour.

 *Example 1:-*

 #include iostream

 class A
 {
 public:
 int x,y,z;
 };

 int main()
 {
 A a1[2] =
 {
 { 1,2 },
 { 3,4 }
 };

 std::cout  a1[0].z is   a1[0].z  std::endl;

 return 0;
 }

 In above case a1[0].z is ? g++ shows it as 0 ( zero ). It is exactly 0
 or garbage value, I am not sure on that.

 I tried lot of books and some documents , no where I found what C++
 says for initialization of class objects.

 You can find handling of below case in almost every book.

 *Example 2:- *

 int arr[6] = {0};

 In Example 2,  compilers will auto-fill all members with 0. It is
 mentioned in books. But when it comes to User-defined datatypes nothing is
 mentioned.


 Please share your thoughts on this. If you find any document related
 to this, please share it as well.

 Thanks
 Sagar

 --
 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.


  --
 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] Regarding approach to solve

[Victor Manuel Grijalva Altamirano]

This problem need about theory game try to read about Max-Min
algorithm, or use a backtrack style.

2014-09-28 10:07 GMT-05:00 Ravi Ranjan ravi.cool2...@gmail.com:

 Yesterday I appeared for ACM USA Regionals, there I got the problem

 https://icpc-qual-14.kattis.com/problems/flipfive

 Can anyone help how to solve this kind of problem.
 Any links for similar problems ?

  --
 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.




-- 
Victor Manuel Grijalva Altamirano
Universidad Tecnologica de La Mixteca

-- 
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] Re: I am developing a new algorithm constructing Suffix Array and I want some knowledge on genome

[Carl Barton]

Almost certainly yes, but that website also gives the links to the files
used in the benchmark. So you can just check yourself.


On 8 August 2014 10:23, wtx...@gmail.com wtx...@gmail.com wrote:

 Here is Google Suffix array testing result website.

 https://sites.google.com/site/yuta256/sais

 I want to know if the testing corpus contains DNA bio information?

 It has a file named chr22.dna. Is it chromosome 22 DNA?

 Weng

 On Thursday, August 7, 2014 6:26:19 PM UTC-7, wtx...@gmail.com wrote:

 I am developing a new algorithm constructing Suffix Array that is not
 based on KA, AS-IS or Skew algorithms. Its performance depends on Max(LCPs)
 (the largest of longest common prefix) of the suffix array.  It will
 work perfectly for 8-bit character string without any code change. It needs
 some refine to deal with genome code.

 I want to know some special knowledge about genome DNA testing code. I
 know nothing about DNA sequence and biology.

 1. Which are the best books about genome DNA sequence processing
 suitable for me who is developing a new algorithm constructing suffix array
 and want the algorithm better workable for DNA analyses.
 2. I want to know if there is any algorithm constructing Suffix Array
 whose performance depends on Max(LCPs)?
 3. Genome DNA testing file contains only 4 characters: A,C,G and T. Is
 it right? I found another char U in RNA. Does the file still contain 4
 characters?
 4. If the number of chars in a file is limited to 4, and all repeatable
 patterns are known, I can specially design some technical refinement to
 improve my algorithm performance. I want know, in addition to 1 char, 2
 chars, 3 chars and 4 chars repentance, 5 chars or
 more repeatable sequence are common? And if common, the largest common
 chars repentance contains how many different chars?
 1 char repentance: ...
 2 char repentance: ACACACACACACACA...

 Thank you.

 Weng

  --
 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] Re: I am developing a new algorithm constructing Suffix Array and I want some knowledge on genome

[Carl Barton]

It's just a plain text file, use whatever text editor you like


On 8 August 2014 10:42, wtx...@gmail.com wtx...@gmail.com wrote:

 *I downloaded the file chr22.dna. I don't know what software should be
 used to browse the contents and view its data pattern. This file is really
 what I need to view its data pattern.* *Please help tell me what **software
 should be used to browse the contents.*
 *Weng*
  *Can't Open .DNA Files ?*You need to clean your Windows Registry and
 repair the Broken Windows File Associations. RegCure  is the tool that
 automates this tedious task... *[image: Warning]There is a 97% chance
 your computer has registry problems.*

 If you can't open/run .DNA files chances are you are experiencing Registry
 problems. To prevent further corruption of registry error pile ups that
 slow down your PC, it is *highly recommended* that this errors should be
 fixed immediately.

 Not repairing this kind of errors can lead to system crashes, blue
 screens, and hardware failure.. Don't waste any more time, use the
 RegCure  http://www.filedocs.net/download_RegCure.php tool and your
 computer will be humming in less than 2 minutes.  (This version includes
 all the latest security fixes and updates.)
 [image: Free Download Now!] http://www.filedocs.net/download_RegCure.php
 File size: 4.9MB, Download time: 1min (Cable/DSL)


- [image: 12] *E*asily Open/Repair .DNA files!


 On Thursday, August 7, 2014 6:26:19 PM UTC-7, wtx...@gmail.com wrote:

 I am developing a new algorithm constructing Suffix Array that is not
 based on KA, AS-IS or Skew algorithms. Its performance depends on Max(LCPs)
 (the largest of longest common prefix) of the suffix array.  It will
 work perfectly for 8-bit character string without any code change. It needs
 some refine to deal with genome code.

 I want to know some special knowledge about genome DNA testing code. I
 know nothing about DNA sequence and biology.

 1. Which are the best books about genome DNA sequence processing
 suitable for me who is developing a new algorithm constructing suffix array
 and want the algorithm better workable for DNA analyses.
 2. I want to know if there is any algorithm constructing Suffix Array
 whose performance depends on Max(LCPs)?
 3. Genome DNA testing file contains only 4 characters: A,C,G and T. Is
 it right? I found another char U in RNA. Does the file still contain 4
 characters?
 4. If the number of chars in a file is limited to 4, and all repeatable
 patterns are known, I can specially design some technical refinement to
 improve my algorithm performance. I want know, in addition to 1 char, 2
 chars, 3 chars and 4 chars repentance, 5 chars or
 more repeatable sequence are common? And if common, the largest common
 chars repentance contains how many different chars?
 1 char repentance: ...
 2 char repentance: ACACACACACACACA...

 Thank you.

 Weng

  --
 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] Amazon Hiring SDE-Is, SDE-IIs, SDM and QAE-1

[Abhijeet Srivastva]

Hi Immanuel,
Please find attached resume and process it for mentioned opening.

Regarding,
Abhijeet Srivastva
09871147025


On Sun, Jul 27, 2014 at 8:27 PM, immanuel kingston 
kingston.imman...@gmail.com wrote:

 There are openings in my team for SDE-Is, SDE-IIs, SDM and QAE-1.
 Please send me resumes if you or your friends are interested in any of
 these roles.

 Thanks,
 Kingston

 --
 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.


Abhijeet__Srivastva.doc
Description: MS-Word document

Re: [algogeeks] What is the algorithm for this problem

[abha awasthi]

abha



On Tue, Jul 1, 2014 at 9:45 PM, vikas vikas.rastogi2...@gmail.com wrote:

 One of my friend posted this question to me and I am unable to get
 anywhere. Could you guys please help

 A game of cards has 5 colors and 5 values. Thus a total of 25 cards are
 possible. Player 1 will choose n cards and tell you exactly , what all
 cards he has. Then he will spread cards in front of you with face downwards
 in random fashion.
 So you know the card values but not the ordering. Player 1 will provide
 you 2 types of hints , he can tell you what all cards have some color or he
 can tell you what all cards have some value. you need to tell the ordering
 of cards with the help of these hints.
 challenge is to find out minimum number of hints to be provided by player
 1 so that you are able to make it for all cards.

 e.g. say player chosen n=5 cards
 and tells you the values

 B1 Y1 W1 G1 R1

 he can either tell you that what all cards are 1 (in this case all cards)
 or can tell you different color like leftmost is color 'B and next after
 'Y' and so on. So minimun hints in this case is 4


 another example
 if n=4
 G4 R3 R4 B3

 Here he can tell you the card 1st and 3rd are of  values 4 and cards 2 and
 3 are of color 'R'. This will be sufficient to infer the card values. so
 answer is 2


 I am not interested in code , please suggest plain simple algorithms, if
 possible with arguments that why it is correct ?

  --
 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.




-- 
Abha Awasthi

-- 
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] What is the algorithm for this problem

[abha awasthi]

jewjewjewe



On Tue, Jul 1, 2014 at 10:29 PM, abha awasthi abha412...@gmail.com wrote:

 abha



 On Tue, Jul 1, 2014 at 9:45 PM, vikas vikas.rastogi2...@gmail.com wrote:

 One of my friend posted this question to me and I am unable to get
 anywhere. Could you guys please help

 A game of cards has 5 colors and 5 values. Thus a total of 25 cards are
 possible. Player 1 will choose n cards and tell you exactly , what all
 cards he has. Then he will spread cards in front of you with face downwards
 in random fashion.
 So you know the card values but not the ordering. Player 1 will provide
 you 2 types of hints , he can tell you what all cards have some color or he
 can tell you what all cards have some value. you need to tell the ordering
 of cards with the help of these hints.
 challenge is to find out minimum number of hints to be provided by player
 1 so that you are able to make it for all cards.

 e.g. say player chosen n=5 cards
 and tells you the values

 B1 Y1 W1 G1 R1

 he can either tell you that what all cards are 1 (in this case all cards)
 or can tell you different color like leftmost is color 'B and next after
 'Y' and so on. So minimun hints in this case is 4


 another example
 if n=4
 G4 R3 R4 B3

 Here he can tell you the card 1st and 3rd are of  values 4 and cards 2
 and 3 are of color 'R'. This will be sufficient to infer the card values.
 so answer is 2


 I am not interested in code , please suggest plain simple algorithms, if
 possible with arguments that why it is correct ?

  --
 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.




 --
 Abha Awasthi




-- 
Abha Awasthi

-- 
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] Design Questions/Answers with UML

[Gaurav Gupta]

Hi,
I am also looking for same ..please let me know in case you found some good
source or good website to get examples of design problesm.


Thanks  Regards,
Gaurav kumar gupta
Senior Software Engineer
Samsung Research India,Bangalore
Contact No:+91-9538147434
Email id: gauravnit...@gmail.com


On 28 April 2014 17:33, bujji jajala jajalabu...@gmail.com wrote:

 Hi,
   Can you please where can I get get design questions like air traffic
 controller, Lift,  parking system, Logging module  with answers, UML
 diagrams, possible solutions?

 Any online resources or even a good book to buy?


 -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.

Re: [algogeeks] DP problems

[kumar raja]

Got it. Any idea on how to solve the problem 2(e) ?


On 6 June 2014 00:52, Saurabh Paliwal saurabh.paliwa...@gmail.com wrote:

 T[i][j] = 0 (i  0 || j =n || i = j || s[i] != s[j])

 T[i][j] = 1 + T[i-1][j+1]




 On Fri, Jun 6, 2014 at 12:19 AM, kumar raja rajkumar.cs...@gmail.com
 wrote:

 If i get u correctly, this is the recurrence relation ( i feel this makes
 many people to understand the solution rather than looking at the code)


 T[i..j] indicates the length of longest even length palin string ( not
 exactly palin but i think u know what i am saying) with i as begin and j as
 ending point.

 T[i,j] = 0 if i=j
T[i+1,j-1]+1 if s[i]==s[j]
   0else

 And u find max value in the table which is the answer

 So time complexity  = space complexity = O(n^2).

 Correct me if i am wrong



 On 5 June 2014 23:44, Saurabh Paliwal saurabh.paliwa...@gmail.com
 wrote:

 And now I get what you meant when you said palindrome. You should have
 explained that if that was not exact palindrome

 So yes, your solution seems correct but that is the brute force
 approach. It runs in O(n*n*n) as there are n*n substrings and every check
 is linear. DP solution helps save time by memoization.


 On Thu, Jun 5, 2014 at 11:37 PM, Saurabh Paliwal 
 saurabh.paliwa...@gmail.com wrote:

 Ok! So I guess now we are talkng my solution. What i do is maintain two
 pointers i and j, i is the end of the first string and j is the beginning
 of the second. If both the character match, I calculate the answer for
 pointers i-1,j+1 and add 1 to the answer for i,j. If they don't match, I
 simply mark 0 as the answer for i,j. So my table if filled top-down like
 this. Finally, I return the maximum entry in the table.
 Need I explain further? If so, feel free. Should I explain what those
 methods do?




 --
  -Saurabh Paliwal

B-Tech. Comp. Science and Engg.

IIT ROORKEE

 --
 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.




 --
  -Saurabh Paliwal

B-Tech. Comp. Science and Engg.

IIT ROORKEE

 --
 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] DP problems

[Shashwat Anand]

I am not too sure about your O (N^3) solution even.  Can you link the
working code ?


On Thu, Jun 5, 2014 at 6:48 PM, kumar raja rajkumar.cs...@gmail.com wrote:

 This is a very good collection of DP problems.

 I want the answers for problem 2(e)
 and problem 14.

 for problem 14 the recurrence relation
 that i have is

 T[i,j] = 0 if i=j
1 if j=i+1 and s[i]=s[j]
0 if j=i+1 and s[i]!=s[j]
j-i+1/2 if s[i..j] is even length palindrome
j-i/2  if s[i..j] is odd length palindrome
max{T[i+1,j],T[i,j-1]} else

 But this is O(n^3) solution. Could not
 find out solution of order O(n^2).
 If someone knows please share the answers for them.


 --
 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] DP problems

[kumar raja]

U have two dimensions for the table ( has O(n^2) entries.) and to check
whether string is palindrome or not it will take O(n) . So it is O(n^3)
solution.

I have checked it manually for some inputs, and it works.


On 5 June 2014 18:53, Shashwat Anand m...@shashwat.me wrote:

 I am not too sure about your O (N^3) solution even.  Can you link the
 working code ?


 On Thu, Jun 5, 2014 at 6:48 PM, kumar raja rajkumar.cs...@gmail.com
 wrote:

 This is a very good collection of DP problems.

 I want the answers for problem 2(e)
 and problem 14.

 for problem 14 the recurrence relation
 that i have is

 T[i,j] = 0 if i=j
1 if j=i+1 and s[i]=s[j]
0 if j=i+1 and s[i]!=s[j]
j-i+1/2 if s[i..j] is even length palindrome
j-i/2  if s[i..j] is odd length palindrome
max{T[i+1,j],T[i,j-1]} else

 But this is O(n^3) solution. Could not
 find out solution of order O(n^2).
 If someone knows please share the answers for them.


 --
 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.