u can use any lang .
perl python etc .
On Thu, Sep 29, 2011 at 10:57 AM, prasanth n nprasnt...@gmail.com wrote:
c++ and java ll be given more preference
On Mon, Sep 26, 2011 at 5:59 PM, abhishek abhishek.ma...@gmail.comwrote:
c,c++ ,java
On Sep 26, 4:15 pm, Akash Mukherjee
a file is given containing lots of records seprated by new line
(records can be repeat)
and a substring given for egabc
now check for the record which contains the substring
and print top 10 record according to their frequency
derive algo with complexity o(n)
On Sep 26, 10:58 am, htross
any language pref?? are bash solns acceptable??
On Mon, Sep 26, 2011 at 12:04 PM, abhishek abhishek.ma...@gmail.com wrote:
a file is given containing lots of records seprated by new line
(records can be repeat)
and a substring given for egabc
now check for the record which contains the
c,c++ ,java
On Sep 26, 4:15 pm, Akash Mukherjee akash...@gmail.com wrote:
any language pref?? are bash solns acceptable??
On Mon, Sep 26, 2011 at 12:04 PM, abhishek abhishek.ma...@gmail.com wrote:
a file is given containing lots of records seprated by new line
(records can be
here is the process of paypal/ebay india
written test ---40 ques in 60 min (no negative marking)
interview 1
interview 2
HR interview
written was a mix of technical and aptitude question
interview 1
first asked me about my hobby and discussed about 5 to 10 min on it
discussed on project
asked
process was
written test
technical interview 1
tech interview 2
coading round
disscussion /improvement in coading
On Sep 26, 9:08 am, aditya kumar aditya.kumar130...@gmail.com wrote:
I cleared the written round, the next round was coding round.
We were asked to select any one problem out of
can u explain more on the coding question u solved?
On Sep 26, 9:08 am, aditya kumar aditya.kumar130...@gmail.com wrote:
I cleared the written round, the next round was coding round.
We were asked to select any one problem out of three in 2 hrs.
Q1) Given n number of xml files find a
DCE
i am also want to know recruitment process as it is coming on 23rd.
On Sep 21, 7:52 pm, Simran Singh sammy.4...@gmail.com wrote:
Hey.. Which college you from..?? And please do tell more about their
process..
On Wed, Sep 21, 2011 at 7:31 PM, abhishek abhishek.ma...@gmail.com wrote:
http://stackoverflow.com/questions/4573744/modify-a-given-number-to-find-the-required-sum/4573881#4573881
for
solution.. And please do share all the info you gather about the process..
On Wed, Sep 21, 2011 at 9:31 PM, abhishek abhishek.ma...@gmail.com wrote:
DCE
i am also want to know
http://in.careers.yahoo.com/students/content/186
check this .. it has visited many colleges including trichy NIT ..
contact them...kindly share ur experience after attending ...
On Sep 15, 8:09 am, Akash Mukherjee akash...@gmail.com wrote:
k...bt its a gud 2 weeks lefti guess der wud be sm
Check the link: http://www.careercup.com/page?pid=yahoo-interview-questions
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/2N_Nig__1foJ.
To post to this
do share u experiences..n questions if possible 4 sure!!!
thnx..in advance...
Regards,
PAYAL GUPTA,
CSE-3rd yr
NIT-B
On Fri, Sep 16, 2011 at 11:31 AM, siva viknesh sivavikne...@gmail.comwrote:
http://in.careers.yahoo.com/students/content/186
check this .. it has visited many colleges
please share the questions asked after the company visits ur campus
On Sep 14, 8:53 pm, Akash Mukherjee akash...@gmail.com wrote:
bit mesra, cg 7...dunno nething else :(
On Wed, Sep 14, 2011 at 3:00 PM, rahul sharma rahul23111...@gmail.comwrote:
in which col it is cumingn wats is
k...bt its a gud 2 weeks lefti guess der wud be sm other clg visits b4
dat
On Wed, Sep 14, 2011 at 9:22 PM, htross htb...@gmail.com wrote:
please share the questions asked after the company visits ur campus
On Sep 14, 8:53 pm, Akash Mukherjee akash...@gmail.com wrote:
bit mesra, cg
its offering 9.55was there a coding round also
On Sep 9, 4:19 pm, Dheeraj Sharma dheerajsharma1...@gmail.com wrote:
whch collg wat package?
last time when it came to our collg..it has 4 questions on probablity..2-3
on c..and rest 15 20 on unix..
On Fri, Sep 9, 2011 at 3:40
yeah..after that their was..one coding..round..and then interviews...
i didnt gave the coding round..bt i know..that there was..coding round..
On Fri, Sep 9, 2011 at 5:15 PM, htross htb...@gmail.com wrote:
its offering 9.55was there a coding round also
On Sep 9, 4:19 pm, Dheeraj
please someone post wat question was asked in coding
round.
On Sep 9, 6:55 pm, Dheeraj Sharma dheerajsharma1...@gmail.com wrote:
yeah..after that their was..one coding..round..and then interviews...
i didnt gave the coding round..bt i know..that there was..coding round..
Can anyone give an insight into the way XOR operations are used for swapping
two variables?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/ZJ_fiB6VmlQJ.
To
@abhi For XOR
a=a^b;
b=a^b;
a=a^b;
On Tue, Jul 12, 2011 at 4:26 PM, Abhi abhi123khat...@gmail.com wrote:
Can anyone give an insight into the way XOR operations are used for
swapping two variables?
--
You received this message because you are subscribed to the Google Groups
Algorithm
@vaibhav
Overflow problem in case of big number in option b.
the best and simple one is option a.
Best Wishes
Sachin Sharma | Software Trainee | Information Mosaic
New York | Dublin | London | Luxembourg | New Delhi | Singapore | Melbourne
|
e-mail: sachinku...@informationmosaic.com
Option A: Works on all data types
Option B: Works on numerical data, (best on integral data) but leads to
overflow problem
Option C: XOR would solve the problem of overflow, but afaik bitwise
operators work on integral data
Regards,
Sandeep Jain
On Mon, Jul 11, 2011 at 12:03 PM, sachin sharma
only first is conditionally independent and other options are used with some
conditions thats why always first one is preferable.
On Mon, Jul 11, 2011 at 12:03 PM, sachin sharma sachin.bles...@gmail.comwrote:
@vaibhav
Overflow problem in case of big number in option b.
the best and simple
thanks sandeep sir
On Mon, Jul 11, 2011 at 12:16 PM, aditya pratap contacttoadity...@gmail.com
wrote:
only first is conditionally independent and other options are used with
some conditions thats why always first one is preferable.
On Mon, Jul 11, 2011 at 12:03 PM, sachin sharma
1.using temporary variable method is the best as it is applicable to all
datatype.
2.using airthmatic expresion:- problem arise if we r swap the value using
pointer and both pointer point to same location
let int *x and int *y both point to a=20;
now we write a method swap
void swap(int
@Vaibhav: Your method b doesn't work for floating point numbers
because they have finite precision. E.g.,as an extreme example, try it
on a = 1 and b = 1d-25. When you form a+b, the result is 1, not 1 +
1d-25. Then 1 - 1d-25 gives 1 (which is correct), and 1 - 1 = 0. The
latter should be 1d-25, so
using a temp variable is considered to be the best option..
On 7/11/11, Dave dave_and_da...@juno.com wrote:
@Vaibhav: Your method b doesn't work for floating point numbers
because they have finite precision. E.g.,as an extreme example, try it
on a = 1 and b = 1d-25. When you form a+b, the
Oh I got it.
If ( interview at google)
{
Map reduce
} else if(interview at yahoo) {
Hadoop
} else {
Your personal preference.
}
On Thu, Jun 30, 2011 at 4:02 AM, bittu shashank7andr...@gmail.com wrote:
1.Use Haddop Map Reduce Framework .Obviously We Need Distributed
Algo we will make
1.Use Haddop Map Reduce Framework .Obviously We Need Distributed
Algo we will make one computer as master assign the job to all
slave computer to do the crawling the web depending upon the
geographic area ( m thinking real time problem).to crawled the
maximum
pages in least time we need
lol... unfortunately i gave the same answer, and they told me to try my luck
at google..
Regards,
Priyanshu Gupta
On Tue, Jun 28, 2011 at 10:42 AM, pacific :-) pacific4...@gmail.com wrote:
Brin and Larry would be the best people to answer this question.
On Tue, Jun 28, 2011 at 12:10 AM,
:))
On 28 June 2011 23:27, Priyanshu priyanshuro...@gmail.com wrote:
lol... unfortunately i gave the same answer, and they told me to try my
luck at google..
Regards,
Priyanshu Gupta
On Tue, Jun 28, 2011 at 10:42 AM, pacific :-) pacific4...@gmail.comwrote:
Brin and Larry would be
anyone!!!
On Jun 23, 3:28 pm, Priyanshu priyanshuro...@gmail.com wrote:
You have 100 computers, connected with each other. Give the most efficient
way to design a web crawler, which will crawl most pages in least amount of
time.
Thanks,
Priyanshu.
--
You received this message because you
@ravindara yeah this works perfect
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For
Here is a simple implementation. Complexity O(n). Please let me know if you
find any issues with this.
Assumptions as stated in original problem -
1- Required sub array is contiguous
2- Given array has only integers (+ve and -)
// Params are array arr, length of array n, given sum and product
@ Kishen
So lets say you have 100 parallel processors and you are given an array of
100 elements, then the loop will execute in 1 clock. Now lets say on the
same machine you are given a problem array of 1 million elements. So how
many clocks are you gonna consume, assuming all your 100 processors
It has nothing to do with time complexity.
My bad. Wrong choice of words. So in the PRAM model you can say the time
complexity is O(1), a pure theoretical concept. But the cost still remains
O(n), isn't it.
I guess now onwards we'll have to specifically ask interviewers whether they
are asking
@Mohit: What I understand that in your solution the sum and product array
contains the sum and products of contiguous sub-array starting from 0 to i
(index of array A). What happens when the expected sub array starts form an
index other than 0?
--
You received this message because you are
@ravindra
agree!
On Oct 24, 2:20 pm, ravindra patel ravindra.it...@gmail.com wrote:
@ Kishen
So lets say you have 100 parallel processors and you are given an array of
100 elements, then the loop will execute in 1 clock. Now lets say on the
same machine you are given a problem array of 1
@Ravindra, Ligerdave
You guys are all right. But with GPUs, you can literally have thousands of
threads running in parallel.
Again, my aim was not to prove that my O(n ^ 2) algorithm is O ( n) on a
single processor system.
It was more towards making the members of this group to think on the lines
@saurabh koar : no it will give that sub array .. but kishan das solution
is good...
btw my code explanation is
A: 2 4 356
PRODUCT:2 8 24 120 720
SUM 2 6 9 14 20
suppose i want sum 8 and product 15
make hash table for product array (in hashtable
Ok, if you look at the inner loop, it is -
for ( j = i to j = 0 ) {
sum[j] += A[ i]
product[j] *= A [ i]
}
This is as good as executing -
sum[i] = sum [ i ] + A[ i ] --- ( 1 )
sum[i-1]= sum[i-1]+ A[i] ( 2 )
--
---
---
sum[0] = sum[ 0]+A[i] -- ( i )
@Kishen
I don't have much knowledge on parallel computation in OpenCL or CUDA.
Do you mean parallelised=not have to do the computation at all?
did you mean without knowing the boundary of the inner loop which is
depended on the outer loop, the inner loop would be smart enough to
figure out the i
i wanna get a clear picture of this before start.
when you say min length of contiguous sub of an array
let's say array A=[3,1,2,3,4,5], N=6
are below both good solutions?
A[0] to A[m] where m=N
A[i] to A[m] where i=m m=N
On Oct 19, 3:58 am, Abhishek Kumar Singh iiita2007...@gmail.com
wrote:
@Kishen
as long as you have one for loop in another, you wont have O(n). it
will most likely run O(n^2)
On Oct 19, 7:41 pm, Kishen Das kishen@gmail.com wrote:
In the below code the jth and kth inner for loops can be run in parallel
making them O(1) and the entire thing O(n).
for ( i=0 to
Well, looks like people are not understanding when I say run a loop in
parallel !!!
Please look at some of the examples on Nvidia website on how computations
can be parallelised in OpenCL or CUDA.
And also some of the high level programming languages like Scala which is
also providing these
@umesh kewat :
In worst case it will be O(nk) in case of your solution.
check for this case:
01-06-11-16
02-07-12-17
03-08-13-18
04-09-14-19
05-10-15-20
--
Krunal
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
@umesh kewat:
In worst case it will be O(n*k), by your solution.
01-06-11-16
02-07-12-17
03-08-13-18
04-09-14-19
05-10-15-20
--
Krunal
By umesh kewat:
Create binary search tree using n nodes of K list den do in-order and
make a
single list
--
You received
Even if u are connected to that person via some another friend it'll
show the shortest chain by which you are connected to that
person..So DFS will be optimum i guessWhy do you think it
wouldn't be optimum.?
--
You received this message because you are subscribed to the Google
i will choose BFS. As we just don't want to show a connection.. we want to
show the shortest one.
On Sat, Sep 18, 2010 at 4:12 PM, soundar soundha...@gmail.com wrote:
Even if u are connected to that person via some another friend it'll
show the shortest chain by which you are connected to that
You could construct two level graphs starting starting simultanously
from your node and the other member's. Add layers one at a time to
each.
When, after adding a new level, you find one or more nodes in both
level graphs, you can stop. Each shared node gives you a least-edge
path between the
@Bittu
I am confused about one point you need to process atleast n*k
elements so how will you do it in nlogk time. It seems really
tricky if possible.it's min time should be O(nk). correct me if I
am wrong.
On Sep 17, 6:34 am, tkcn tkcna...@gmail.com wrote:
Use k-way merging +1.
1.
Create binary search tree using n nodes of K list den do in-order and make a
single list
On Fri, Sep 17, 2010 at 12:58 PM, vikas kumar vikas.kumar...@gmail.comwrote:
@Bittu
I am confused about one point you need to process atleast n*k
elements so how will you do it in nlogk time.
@vikas: Total number of elements are not n*k. Total number of elements are
n, which are divided into k lists.
@Rahul Singal: +1 for ur answer.
On Fri, Sep 17, 2010 at 12:58 PM, vikas kumar vikas.kumar...@gmail.comwrote:
@Bittu
I am confused about one point you need to process atleast n*k
Use k-way merging +1.
1. Before the merging start, sorting these lists according to the
first element of each list. // O(k log k)
2. So the first element in the first list is the smallest element. Put
the smallest into the result array. // O(1)
3. Then, using binary search to find the new
what is the complexity of this problem I think its O(n*n!) but
confused or O(n!) or O(n^2) right me if i m wrong.its
necessary to check the complexity REPLY is appreciated from every
algogeek
#include stdio.h
#includeconio.h
#includeiostream.h
#includestdlib.h
int main()
{
@peeyush:
the ratio is based on probability, it will be 1:1.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
ya i mean half girl and half boys i.e. 1:1 ratio of boys to girl
On Sun, Jul 4, 2010 at 5:25 PM, peeyush peeyush...@gmail.com wrote:
It can not be determined.
On Jul 4, 4:27 pm, Amit Jaspal amitjaspal...@gmail.com wrote:
it will be 1:1
On Sun, Jul 4, 2010 at 4:50 PM, Jitendra Kushwaha
One (space-intensive) idea:
Re-represent each string as a set of pairs (character, position of
character). Then sort each set of pairs by character. Then find
corresponding sequences in the sorted lists of pairs, where the
character and the difference between position is the same from pair to
57 matches
Mail list logo
