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 <shashiski...@gmail.com> 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
[algogeeks] Re: Question asked in Amazon Online Test
count=0; Start parsing from left to right If operator push in stack. In number add in queue and increment count by one, if count == 2 then pop from stack add in queue, decrements the count by one. On Friday, 29 June 2012 19:46:43 UTC+5:30, zerocool142 wrote: Given an integer expression in a prefix format (i.e. the operator precedes the number it is operating on) , print the expression in the post fix format . Example: If the integer expression is in the prefix format is *+56-78, the postfix format expression is 56+78-*. Both of these correspond to the expression (5+6)*(7-8). -- 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/-/N4YE_XpyWjAJ. 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.
[algogeeks] Re: determine if a string if of form pZq
Its palindrome On Apr 20, 7:43 am, vikas vikas.rastogi2...@gmail.com wrote: couldn't understand the question :( On Apr 19, 1:32 pm, tech coder techcoderonw...@gmail.com wrote: determine whether the given string is of form pZq. p and q can contain only X and Y. like if p=XXYX then z will be XYXX for ex XXYXXXYXX is valid the limitation is that you can read only the next character at each point . -- Regards The Coder -- 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.
Re: [algogeeks] Re: Ties The Rope With Minimum Cost ..Interesting For Geeks
yaar it was sooo easy,,,room mein aa utkarsh btata hun.. On Tue, Mar 29, 2011 at 6:05 AM, bittu shashank7andr...@gmail.com wrote: @utkarsh i was just about to put Huffman algo ..yes it is optimized answer to solve the problem @all basicaly we have to minimize the cost of intermediate path ,final o/p will obvious be the same Try Huffman algo 1st read what it is..dan u will able to figure out soln of this problem Hope i am clear , if missing something , correct me Thanks Reagrds Shashank Mani CSE,BIT Mesra -- 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.
Re: [algogeeks] [brain teaser ] 15march
the west street barber has a hair style like a star..there r only 2 shop in that town and no one can cut his own hair.. so definitely the west barber went to east shop to cut his hair.. so the east barber is batter than west barber... On Tue, Mar 15, 2011 at 2:28 PM, amit singh amit.lu...@gmail.com wrote: to the east shop because he is busy doing other peoples hair and has no time for himself while the west one has no work and gets his hair done by the east shop barber :P On Tue, Mar 15, 2011 at 1:25 PM, Lavesh Rawat lavesh.ra...@gmail.comwrote: * barbershop **Problem Solution* * *A traveller arrives in a small town and decides he wants to get a haircut. There are only two barbershops in town - one on East Street and one on West Street. The East Street barbershop is a mess, and the barber has the worst haircut the traveller has ever seen. The West Street barbershop is neat and clean, its barber's hair looks as good as a movie star's. Which barbershop does the traveller go to for his haircut, and why? *Update Your Answers at *: Click Herehttp://dailybrainteaser.blogspot.com/2011/03/15march.html Solution: Will be updated after 1 day -- 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. -- Amit Kumar Singh Software Engineer Samsung India Software Operations Banglore India -- 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. -- Ashu Agarwal MCA -BIT MESRA (Ranchi) -- 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.
Re: [algogeeks] SPOJ PROBLEM
launda pelu nikla.
On Thu, Mar 10, 2011 at 10:22 AM, UTKARSH SRIVASTAV usrivastav...@gmail.com
wrote:
WELL I HAVE DONE THIS PROBLEM .HERE IS THE CODE
#includestdio.h
#includealgorithm
using namespace std;
main()
{
long long int t[2][2010],price[2010],r,c,i,j,n;
scanf(%lld,n);
for(i=0;in;i++)
{
scanf(%lld,price[i]);
}
for(r=n-1,c=0;r=0c=n-1;r--,c++)
{
for(i=r,j=n-1;i=0j=c;j--,i--)
t[i1][j]=max(price[i]*(n+i-j)+t[(i+1)1][j],price[j]*(n+i-j)+t[i1][j-1]);
}
printf(%lld\n,t[0][n-1]);
return 0;
}
On Wed, Mar 9, 2011 at 5:10 PM, Algoose chase harishp...@gmail.comwrote:
Hi,
Any solution other than brute force(exponential growth) for this problem ?
On Sun, Mar 6, 2011 at 6:42 PM, UTKARSH SRIVASTAV
usrivastav...@gmail.com wrote:
can anyone please tell me why i am getting wrong answer for
problem.https://www.spoj.pl/problems/TRT/
.
.
.
MY CODE IS THIS AND TO BE TESTED IN gcc COMPILER
#includestdio.h
double a[2100];
double fun(long long int m,long long int n,double count)
{
double k,l;
count++;
if(m==n)
{
return count*a[m];
}
if((k=(fun(m+1,n,count)))(l=(fun(m,n-1,count
{
return (count*a[m]+k);
}
else
{
return (count*a[n]+l);
}
}
int main()
{
long long int i,m,n;
double ans,c=0;
scanf(%lld,n);
for(i=1;i=n;i++)
{
scanf(%lf,a[i]);
}
m=1;
ans=fun(m,n,c);
printf(%.0lf\n,ans);
return 0;
}
--
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.
--
UTKARSH SRIVATAV
CSE-3
B-TECH 2nd YEAR
MNNIT ALLAHABAD
--
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.
[algogeeks] Re: do this: two numbers with min diff
May be this helps
http://ds-gyan.blogspot.com/2009/12/two-numbers-with-minimum-difference.html
On Sep 28, 10:28 am, coolfrog$ dixit.coolfrog.div...@gmail.com
wrote:
@ sorurav
yes , the basic logic is required so that the code can be understood in
single Run..
i also request the same to all dear friends.
Regards..
On Tue, Sep 28, 2010 at 8:11 PM, sourav souravs...@gmail.com wrote:
Hi Friends
This is an interesting problem and request you all to give a brief
intro to your code before putting the code. Or you may just mention
the under lying concept in the code. This will be of great help and
others will find it more ready to improve by adding there approach.
Coming back to the problem an O(n) solution can exist by following the
approach of building a min heap (or max heap) from an array of
elements. A mean heap from an array of elements can be built by
starting from middle element (all elements from mid +1 to end are them
selves single element min heaps) (references available in Cormen or
other books).
During constructing the mean heap always track the min difference
between any two elements in the so far constructed heap. At any
instant if you are handling root 'a' which has left child l and right
child r and aiming to build a min heap rooted at a, then the following
cases arise
1. a is less than both l and r. In this case no movement of a is
required. Now find |a-l| = x and |a-r| = y. 'a' cannot have a
difference z with any element under tree rooted at l such that z x
becuase l is the least element in the tree rooted at l. Similarly 'a'
cannot have a difference z' with any element under tree rooted at r
such that z' r. So least of x and y is the min diff between any
elements in the so far constructed min heap rooted at 'a'.
2. a is less than l but greater than r. In this case r will replace a
and a need to be pushed down the its right child. While pushing 'a'
down keep calculating the differences between 'a' and 'r' as long as
'a' is not pushed down to a node where it is the min element. While
you keep calculating also keep track of the min diff calculated so far
(say 'p'). Compare this 'p' with |a-l| and min diff between any two
elements for the tree rooted at l. Least of these three will be the
min diff between any 2 elements for the min head rooted at 'r' (which
replaced 'a''s position.
3. Both 'l' and 'r' are less than 'a'. Take the lesser or 'l' and 'r'
and replace that with 'a' and push 'a' down as in case 2 (normal min
heap construction algo).
Thus we can continue building the min heap and at the end have the min
diff between any 2 elements in the array. Just we keep tracking the
min diff, we can also keep note of the 2 elements than are
contributing to this min diff my adding some more steps.
This idea is all based on the fact that min heap can be constructed
from an array in linear time.
Thanks,
Sourav
On Sep 27, 1:32 pm, rahul rahulr...@gmail.com wrote:
If their is no constrain on assumptions.
1.Sort the array.
2. check the dif between 2 elements.
{ 99,35,45,33,88,9098,112,33455,678,3}
sorted arrary : { } would be something.
now update the min_diff.
another example : { 7,8,1,3,5,4}
sorted arrary : { 1,3,4,5,7,8}
min diff is 1.
Please correct me if i missed something.
On Mon, Sep 27, 2010 at 1:13 PM, satish satish@gmail.com wrote:
step1construct heap using siftdown. // time complexity wil be O(n)
and
space complexity O(1).
step2take mindifference=a[1].
step3for i=1 ,i=n/2 do
{ find the difference of
(root,root-left),(root,root-right)and
(root-left,root-right).and maintain mindifference is the smallest
difference of among
three differences.
}
step4return mindifference.
plz correct me if im wrong
--
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.comalgogeeks%2bunsubscr...@googlegroups
.com
algogeeks%2bunsubscr...@googlegroups.comalgogeeks%252bunsubscr...@googleg
roups.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 algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups
.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Divesh*
(¨`·.·´¨) Always
`·.¸(¨`·.·´¨ ) Keep
(¨`·.·´¨)¸.·´Smiling!
`·.¸.·´ Life can give u 100's of reason 2cry,but u can give life
[algogeeks] Re: Interview question.Provide the solution as per the constraints.
Check the blog http://ds-gyan.blogspot.com/2009/12/median-of-stream-of-numbers.html You can form similar tree with node having count of left elements. On Mar 8, 5:45 pm, Rohit Saraf rohit.kumar.sa...@gmail.com wrote: once u do that.. the solution is trivial :P -Rohit On Mon, Mar 8, 2010 at 5:54 PM, Nikhil Agarwal nikhil.bhoja...@gmail.comwrote: On Mon, Mar 8, 2010 at 5:04 PM, Rohit Saraf rohit.kumar.sa...@gmail.comwrote: can we assume that we have the sizes of subtree rooted at all nodes in our datastructure.? Yeah,that can be lead to 1 solution.well done. -Rohit On Mon, Mar 8, 2010 at 5:02 PM, sharad kumar aryansmit3...@gmail.comwrote: @gaurav :ur sol u mean like tk the mem loc for each node and make it as array ? On Mon, Mar 8, 2010 at 8:42 AM, gaurav gupta 1989.gau...@googlemail.com wrote: Median of BST means : median of Sorted array of elements? is it? Convert BST into Hight Balance Search Tree then root node will be your median. On Sun, Mar 7, 2010 at 2:42 AM, Nik_nitdgp nikhil.bhoja...@gmail.comwrote: Given a BST (Binary search Tree) how will you find median in that? Constraints: -No extra memory. Algorithm should be efficient in terms of complexity. Write a solid secure code for it. No extra memory--u cannot use stacks to avoid recursion. No static,global--u cannot use recursion and keep track of the elements visited so far in inorder. -- 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.comalgogeeks%2bunsubscr...@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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@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 algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thanks Regards Nikhil Agarwal Junior Undergraduate Computer Science Engineering, National Institute Of Technology, Durgapur,India http://tech-nikk.blogspot.com -- 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.comalgogeeks%2bunsubscr...@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 algoge...@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.
