Get yourself prepared for DS and Algo.. Thats it.
On Fri, Aug 24, 2012 at 5:10 PM, vaibhav shukla vaibhav200...@gmail.comwrote:
its DU . please guide with watever details you have.
thanks
On Fri, Aug 24, 2012 at 4:42 PM, JITESH KUMAR jkhas...@gmail.com wrote:
Which college?
I can help
.
--
*Regards
Jitesh Kumar
There is only one 'YOU' in this world. You are Unique and Special.*
*Don't Ever Forget 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
Neither depth is known nor we have to find the shortest path. We just have
to find the path.
--
*Regards
Jitesh Kumar
*
--
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
.
On Wed, Sep 14, 2011 at 1:58 PM, Azhar Hussain azhar...@gmail.com wrote:
Union Find Algorithm would do
-
Azhar.
On Wed, Sep 14, 2011 at 1:42 PM, JITESH KUMAR jkhas...@gmail.com wrote:
Neither depth is known nor we have to find the shortest path. We just
have to find the path
I guess, if file is not found, fopen will return -1.
Which will evaluate the statement
if(f=fopen(file.txt,r)) as true..
--
*Regards
Jitesh Kumar
There is only one 'YOU' in this world. You are Unique and Special.*
*Don't Ever Forget it.*
--
You received this message because you are subscribed
).
--
*Regards
Jitesh Kumar*
--
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
, 2011 at 5:48 PM, veera reddy veeracool...@gmail.com wrote:
finding the shortest path between A and C nodes , gives required solution
.
We can use dijkstra's algorithm to find the shortest path ..
On Tue, Sep 13, 2011 at 5:43 PM, JITESH KUMAR jkhas...@gmail.com wrote:
Suppose you
)
{
int n = 0;
for(int i = 0; i 30; ++i)
n += n+f();
return n (int)(p*1073741824.0);
}
On Sep 12, 9:55 am, JITESH KUMAR jkhas...@gmail.com wrote:
Hi
You are given a function f() that returns either 0 or 1 with equal
probability.
Write a function g
, Karan Thakral karanthak...@gmail.comwrote:
bfs
On Tue, Sep 13, 2011 at 5:59 PM, JITESH KUMAR jkhas...@gmail.com wrote:
I guess you have misunderstood the problem.
We are not concerning about the length of path. We just have to find the
path.
But in the efficient way. suppose first person
Hi
You are given a function f() that returns either 0 or 1 with equal
probability.
Write a function g() using f() that return 0 with probability p (where 0p1
)
--
*Regards
Jitesh Kumar*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
*1073741824.0);
}
On Sep 12, 9:55 am, JITESH KUMAR jkhas...@gmail.com wrote:
Hi
You are given a function f() that returns either 0 or 1 with equal
probability.
Write a function g() using f() that return 0 with probability p (where
0p1
)
--
*Regards
Jitesh
For N=3, multiple solutions exists
3 1 2 1 3 2
2 3 1 2 1 3
what about this??
On Wed, Feb 9, 2011 at 1:35 PM, jalaj jaiswal jalaj.jaiswa...@gmail.comwrote:
yeah .. the input will bw given that only for which solution is possible
On Wed, Feb 9, 2011 at 1:18 PM, Jitesh Kumar jitesh2
I didn't get you..
In your example
One of the possible placement for 7 numbers in 14 positions is :
5 7 2 3 6 2 5 3 4 7 1 6 1 4
there is no perfect square...
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
Can you give me solution for N=1 and N=2?
I don't think that it is possible for every N.
--
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
14 matches
Mail list logo
