Re: [algogeeks] Re: Amazon Job openings

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

Re: [algogeeks] Re: Amazon Job openings

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

Re: [algogeeks] Re: Amazon Job openings

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

Re: [algogeeks] Re: Amazon Job openings

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

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

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

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

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

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

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

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

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

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

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

Re: [algogeeks] Job Openings in Hyderabad/Bangalore

Вы кто? Отправлено со смартфона 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 окт

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

Re: [algogeeks] Need help

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

Re: [algogeeks] GREGOVIA in SPOJ

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

Re: [algogeeks] GREGOVIA in SPOJ

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

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.

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

Re: [algogeeks] Openings at Amazon - SDE IIs

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

Re: [algogeeks] Experience hiring in siemens with 5-8 years in C\C++

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,

Re: [algogeeks] Designing Interview questions

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

Re: [algogeeks] Re: 25march

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)

Re: [algogeeks] Minimal number of swaps

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

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

Re: [algogeeks] Minimal number of swaps

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

Re: [algogeeks] Minimal number of swaps

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,

Re: [algogeeks] Minimal number of swaps

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

Re: [algogeeks] Minimal number of swaps

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

Re: [algogeeks] Minimal number of swaps

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

Re: [algogeeks] Find all the subarrays in a given array with sum=k

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

Re: [algogeeks] Find all the subarrays in a given array with sum=k

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 >

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

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

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

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

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

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

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

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

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

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] +

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

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

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

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:

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

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

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

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

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

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

Re: [algogeeks] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

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

Re: [algogeeks] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

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

Re: [algogeeks] Re: [BANNED!!!] Urgent need Lead - Java Developer in Atlanta, GA

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

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

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

Re: [algogeeks] Re: Openings in Flipkart BLR

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

Re: [algogeeks] Urgent Need Test Lead - Performance Engineer / Architect - Middleware in Atlan,GA for 6 months

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

Re: [algogeeks] Urgent Need ITIL Service Management Operations Business/Process Analyst in Manhattan, NY for 6+ months

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

Re: [algogeeks] Urgent Need Test Lead - Performance Architect in Atlanta, GA for 6 months

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

Re: [algogeeks] Urgent Need ITIL Service Management Operations Business/Process Analyst in Manhattan, NY for 6+ months

^^ +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 >>

Re: [algogeeks] Urgent Need ITIL Service Management Operations Business/Process Analyst in Manhattan, NY for 6+ months

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

Re: [algogeeks] Urgent Need Test Lead - Performance Architect in Atlanta, GA for 6 months

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

Re: [algogeeks] Urgent Need Test Lead - Performance Architect in Atlanta, GA for 6 months

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

Re: [algogeeks] Openings in Flipkart BLR

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

Re: [algogeeks] Acces violation problem

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

Re: [algogeeks] Openings in Flipkart BLR

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.

Re: [algogeeks] Acces violation problem

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,

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

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

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

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

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

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

Re: [algogeeks] Opening @ Microsoft Hyd

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

Re: [algogeeks] Opening @ Microsoft Hyd

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~*~

Re: [algogeeks] Opening @ Microsoft Hyd

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

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

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

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

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

Re: [algogeeks] Distributed System problem

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,

Re: [algogeeks] Openings in Snapdeal

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

Re: [algogeeks] Distributed System problem

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

Re: [algogeeks] Better data structure/Algorithm to handle the following porblem

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,

RE: [algogeeks] Yo! Help me make a Music Video

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

Re: [algogeeks] Need a Proper ebook of Javascript

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

Re: [algogeeks] Digest for algogeeks@googlegroups.com - 3 updates in 1 topic

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,

Re: [algogeeks] Distributed System problem

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

Re: [algogeeks] Distributed System problem

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

Re: [algogeeks] Largest Rectangle

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

Re: [algogeeks] Most Optimal Palindrome?

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

Re: [algogeeks] Need a Proper ebook of Javascript

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

Re: [algogeeks] SDE-1 openings in Amazon

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

Re: [algogeeks] SDE-1 openings in Amazon

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 :)

Re: [algogeeks] Technology for Graphical User Interface on Linux

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

Re: [algogeeks] Technology for Graphical User Interface on Linux

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

Re: [algogeeks] Openings in Adobe India !!!

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

Re: [algogeeks] Openings in Adobe India !!!

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

Re: [algogeeks] Most Optimal Palindrome?

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.

Re: [algogeeks] Re: Comparing string of unequal length

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

Re: [algogeeks] Re: Comparing string of unequal length

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

Re: [algogeeks] Re: Comparing string of unequal length

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

Re: [algogeeks] C++ initialization list

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

Re: [algogeeks] C++ initialization list

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,

Re: [algogeeks] C++ initialization list

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

Re: [algogeeks] C++ initialization list

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

Re: [algogeeks] C++ initialization list

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

Re: [algogeeks] C++ initialization list

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

Re: [algogeeks] Regarding approach to solve

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

Re: [algogeeks] Re: I am developing a new algorithm constructing Suffix Array and I want some knowledge on genome

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

Re: [algogeeks] Re: I am developing a new algorithm constructing Suffix Array and I want some knowledge on genome

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

Re: [algogeeks] Amazon Hiring SDE-Is, SDE-IIs, SDM and QAE-1

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

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

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

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

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

Re: [algogeeks] Design Questions/Answers with UML

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

Re: [algogeeks] DP problems

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

Re: [algogeeks] DP problems

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

Re: [algogeeks] DP problems

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

  1   2   3   4   5   6   7   8   9   10   >