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

[algogeeks] Array problem

There is a stream of numbers coming in and you have to find K largest numbers out of the numbers received so far at any given time. Next problem is that a constraint is added. memory is limited to m. m k. How would you achieve the goal still. -- You received this message because you are

Re: [algogeeks] Primality testing

at 10:46 PM, payel roy smithpa...@gmail.com wrote: You are to test whether a number if prime or not. Digit of that number can be as large as 1000. How do you do that? I was thinking of basic idea. a) First I shall calculate all primes which is less than the square root of the given number b

Re: [algogeeks] Re: No of tri-angles

,a being lengths of sides of the triangle) and sum of any two sides is greater than the third. Consider : 1,2,3,4,5,6 Possible side combinations are: 1,2,4 1,2,5 1,2,6 1,3,5 1,3,6 1,4,6 2,3,6 On Wednesday, 13 June 2012 22:18:01 UTC+5:30, payel roy wrote: Let's say there are N

[algogeeks] No of tri-angles

Let's say there are N sides are given. Length of them are like 1,2,3,4,5,N. How do you determine how many tri-angles can be made out of these N sides? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

[algogeeks] problem

Find the number of fractions a/b such that- 1. *gcd(a, b) = 1* 2. *0 a/b 1* 3. *a * b = (n!) ^ (n!)* Where *n!* denotes the factorial of n and ^ denotes power, *i.e. (2!) ^ (2!) = 4*. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post

Re: [algogeeks] Re: problem

No constraints as such! On 10 June 2012 17:19, Nachammai Lakshmanan nnlna...@gmail.com wrote: what are the constraints or limits for a,b and n?? On Jun 10, 3:07 pm, payel roy smithpa...@gmail.com wrote: Find the number of fractions a/b such that- 1. *gcd(a, b) = 1* 2. *0 a/b 1* 3

Re: [algogeeks] Re: problem

. On Sunday, 10 June 2012 16:37:33 UTC+5:30, payel roy wrote: Find the number of fractions a/b such that- 1. *gcd(a, b) = 1* 2. *0 a/b 1* 3. *a * b = (n!) ^ (n!)* Where *n!* denotes the factorial of n and ^ denotes power, *i.e. (2!) ^ (2!) = 4*. On Sunday, 10 June 2012 16:37:33 UTC+5:30

[algogeeks] Rectangle area

How do you verify whether sides of rectangular area are integer number If square of diagonal of a rectangular area is prime? Ex : Let's say square of a diagonal is : 2 2 = 1^2 + 1^2 [where 1,1 are the sides of the rectangular area] square of a diagonal is : 29 29 = 5^2 + 2^2. -- You received

Re: [algogeeks]

@anurag, does the vector's next permutation return next higher element? On Dec 6, 8:10 am, Anurag Sharma anuragvic...@gmail.com wrote: In context of C++    1. Populate the digits of the given number in a vector V    2. call next_permutation() on V    3. print the vector [?] Thanks, Anurag

[algogeeks] No of triangles

You have been given a number n. If you have to divide n into 3 parts so that you can build a tri-angle. Given n, how many will be possible? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

Re: [algogeeks] Re: netapp!

kon app? On 19 August 2011 22:27, priya ramesh love.for.programm...@gmail.comwrote: @saurabh: thanks a lot! isn't DBMS important?? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

Re: [algogeeks] C easy doubt

Yes it is... a+1 will point to starting address of a + 12 * size of int. byte. On 8 August 2011 19:59, Brijesh Upadhyay brijeshupadhyay...@gmail.comwrote: int main() { int a[3][4]={1,2,3,4,5,6,7,8,9,10,11,12}; printf(%u %u %u,a, a+1,a+1); getch(); } how a+1 is valid..?? please

Re: [algogeeks] Re: Longest matching substring

Trie .. On 6 August 2011 14:24, Mukul Gupta mukul.gupta...@gmail.com wrote: Yes, vikash is right. This will work. Works in O(nm). http://ideone.com/G6RAK On Sat, Aug 6, 2011 at 1:30 PM, vikash vikash.ckiiit...@gmail.com wrote: apply longest common subsequqnce problem with a little

Re: [algogeeks] inorder

I could not understand why people are using extra space. And you would be able to change the actual structure of the tree. How horrible is the idea and people are still supporting it Goodness me. The signature of the function will be : tree* inordersucc(tree *root,tree *node); UTKARSH

Re: [algogeeks] size -------

Starting byte is always multiple of size. As double is of 8 bytes, so it will start from 0,8,16 ... th byte.. On 6 August 2011 19:02, SANDEEP CHUGH sandeep.aa...@gmail.com wrote: yeah answer is 24 .. i knw.. i hav missed something in question that allocation starts at address which is

Re: [algogeeks] Re: remove duplicate words in a string

Hash table ??? On 5 August 2011 13:58, vaibhav shukla vaibhav200...@gmail.com wrote: give it in C/C++ On Fri, Aug 5, 2011 at 1:57 PM, aj aj.jaswa...@gmail.com wrote: you can write a python program to do that easily. program starts here : c=str.split(raw_input()) d=[] for x in c:

[algogeeks] Random number

Given a range 0-N, generate 'M' random numbers from the range without any duplication. The space complexity is O(1). -- 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

Re: [algogeeks] MS

Kadane algorithm. Google it. On 5 August 2011 17:35, rShetty rajeevr...@gmail.com wrote: You're given an array containing both positive and negative integers and required to find the sub- array with the largest sum (O(N) a la KBL). Write a routine in C for the above Is this problem as

Re: [algogeeks] Random number

[1] http://en.wikipedia.org/wiki/Linear_feedback_shift_register On Fri, Aug 5, 2011 at 5:19 PM, payel roy smithpa...@gmail.com wrote: Given a range 0-N, generate 'M' random numbers from the range without any duplication. The space complexity is O(1). -- You received this message because

Re: [algogeeks] Amazon Question

Is there any solution for the above? On 3 August 2011 21:09, coder coder i.code.program...@gmail.com wrote: ya amazon will be visiting our campus within few days -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send

Re: [algogeeks] Sort IT

Can you please elaborate ?? On 2 August 2011 12:38, sunny agrawal sunny816.i...@gmail.com wrote: Radix sort is one of the solution. because this Question is in the section Radix sort in CLRS. :) On Tue, Aug 2, 2011 at 11:10 AM, Ravinder Kumar ravinde...@gmail.comwrote: I have little

[algogeeks] merge

Input Data : {[1,3],[2,4],[10,11],[4,6]} Output: {[1,6],[10,11]} We have to merge all the ranges that are overlapping. You can consider Input data as any Data structure. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group,

Re: [algogeeks] Sort IT

system. Check if possible On Tue, Aug 2, 2011 at 1:02 PM, payel roy smithpa...@gmail.com wrote: Can you please elaborate ?? On 2 August 2011 12:38, sunny agrawal sunny816.i...@gmail.com wrote: Radix sort is one of the solution. because this Question is in the section Radix sort

[algogeeks] Largest Rectangle

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] Amazon Question

You are given an array ' containing 0s and 1s. Find O(n) time and O(1) space algorithm to find the maximum sub sequence which has equal number of 1s and 0s. Examples 1) 10101010 The longest sub sequence that satisfies the problem is the input itself 2)1101000 The longest sub sequence that

Re: [algogeeks] Re: Sort IT

@Dave, Can you please explain the algo? It's getting very difficult to understand the code .. On 3 August 2011 01:14, Dave dave_and_da...@juno.com wrote: @Pankaj: Assuming generously that by N^2 you mean N*N instead of N exclusive-or 2, your very first statement is already O(N^2), as it will

Re: [algogeeks] Amazon Question

It is contiguous ...the answer will be 0110. On 2 August 2011 20:59, ankit sambyal ankitsamb...@gmail.com wrote: @payel : Is it sub-sequence or sub-array ?? A sub-sequence may not be continuous but a sub-array must be continuous. eg : What wud be the answer for- 100110 ?? -- You