Can anyone share programming questions asked for you in EPIC systems
skill assessment test and in which year you attended the test?
I am hoping to get list of questions asked recently.
--
Regards,
*SNK*
--
You received this message because you are subscribed to the Google Groups
Algorithm
Can anyone help me solve this problem.
http://poj.org/problem?id=1085
--
Regards,
*Narayanan S*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
http://www.geeksforgeeks.org
On Thu, Jul 12, 2012 at 9:08 AM, Rahul Kumar Patle
patlerahulku...@gmail.com wrote:
http://uva.onlinejudge.org/index.php
http://www.careercup.com/
http://www.codershunt.com/
http://www.cs.sunysb.edu/~skiena/392/programs/
dutch national flag problem..search in wiki...classical.
On Sat, Sep 24, 2011 at 9:39 AM, VIHARRI viharri@gmail.com wrote:
You are given a string (consisting of 0's, 1's or 2's) where 0
represents a blue ball, 1 a
red ball, and 2 a black ball. Using only swap operations (counting
sort
varun: can u explain it little further..
On Wed, Aug 10, 2011 at 7:49 PM, varun pahwa varunpahwa2...@gmail.comwrote:
make two ropes 50m and 100 meter. make a loop kind of thing with that now
you have two 50 mtr ropes so get down to 100 mtr point and tie loop rope in
downward now cut the loop
let intialize the count be equal to zero and pass it to left nodes as well
as right nodes.
verticalsum(struct node* node,int count)
{
verticalsum(node-left,count-1);
hash(count)+=node-data;
verticalsum(node-right,count+1);
}
On Wed, Aug 24, 2011 at 9:18 PM, Nikhil Veliath nve...@gmail.com wrote:
for(i=0 to n)
{
if(a[abs(a[i])-1]0)
a[abs(a[i])-1] = -a[abs(a[i])-1];
else
printf(%d,a[abs(a[i])]);
}
space : o(n)
time : o(1)
On Fri, Aug 19, 2011 at 12:45 AM, *$* gopi.komand...@gmail.com wrote:
How to find duplicate element (only one element is repeated) from an array
of unsorted positive
On Sat, Aug 20, 2011 at 9:07 PM, Naren s sweetna...@gmail.com wrote:
for(i=0 to n)
{
if(a[abs(a[i])-1]0)
a[abs(a[i])-1] = -a[abs(a[i])-1];
else
printf(%d,abs(a[i]));
}
space : o(n)
time : o(1)
On Fri, Aug 19, 2011 at 12:45 AM, *$* gopi.komand...@gmail.com wrote:
How to find
http://people.csail.mit.edu/bdean/6.046/dp/
--
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.
how to Implement a Queue using a stack if space complexity is there...
--
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
can anyone help me to solve this..how can we find nth element of a
tree without using recursion
--
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.
For more options, visit this group
yeah i've solved it using binary search but i want to know more
solutions
On Oct 25, 10:59 am, Antony Vincent Pandian.S. sant...@gmail.com
wrote:
Do a binary search
On Sun, Oct 25, 2009 at 12:13 AM, naren lalavat38na...@gmail.com wrote:
You have a sorted array of n elements some of them
You have a sorted array of n elements some of them occur more than
once. How can we find the index of an element in time t which is less
than O(n).
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
13 matches
Mail list logo
