I am using Dev C++ its showing last output as 99 only
On 6/22/11, oppilas . jatka.oppimi...@gmail.com wrote:
Yes, that I know, but why last argument is printing 100 instead of 99?
On Wed, Jun 22, 2011 at 7:50 PM, Piyush Sinha
ecstasy.piy...@gmail.comwrote:
the arguments are passed from
.
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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926
.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
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
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message
WAP to find the LCA in a n-ary tree.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send
*A preorder of a complete binary tree is given , prints its level order*
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
Algorithm
*How will you design a SpellChecker for an e-mail application?*
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
on
to the next heap. The player who picks the last coin wins. Design an
algorithm for predicting the winner.*
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed
, 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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https
ignore the above answerit shouldn't rotate again...
On Mon, Jun 13, 2011 at 1:37 PM, Piyush Sinha ecstasy.piy...@gmail.comwrote:
should rotate again..
On Mon, Jun 13, 2011 at 1:12 PM, sunny agrawal sunny816.i...@gmail.comwrote:
Pull the Trigger Again ??
On Mon, Jun 13, 2011 at 1:01
this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
@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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com
.
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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91
is
'RGGB' and the user guesses 'YRGB' they have 2 hits and one pseudo hit.
Write a program to, given a solution and a guess, calculate the number of
hits and pseudo hits.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926
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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91
, here if you increase a or decrease b in both case
difference will increase.. ? correct me if i am wrong.
On Jun 7, 2:39 pm, Piyush Sinha ecstasy.piy...@gmail.com wrote:
Whats the problem in using two pointers one pointing the lower index
while
the other pointing the upper
pm, Piyush Sinha ecstasy.piy...@gmail.com wrote:
Can we use recursion/internal stack memory???
On 6/5/11, hary rathor harry.rat...@gmail.com wrote:
it it is possible in order of O(n )
--
You received this message because you are subscribed to the Google
Groups
Algorithm Geeks group
all of them in linear time.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
use the same logic u use for a+b=k for difference..
because, here if you increase a or decrease b in both case
difference will increase.. ? correct me if i am wrong.
On Jun 7, 2:39 pm, Piyush Sinha ecstasy.piy...@gmail.com wrote:
Whats the problem in using two
://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
On a empty chessboard, a horse starts from a point( say location x,y) and it
starts moving randomly, but once it moves out of board, it cant come inside.
So what is the total probability that it stays within the board after N
steps.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91
Design your hash_map that allow the following Add in O(1) , delete in
O(1) , iterate in O(n)?
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google
(root-left,p);
r=findDiameter(root-right,p);
*p=max(*p,(l+r));
return max(l,r)+1;
}
return 0;
}
On Mon, May 30, 2011 at 3:16 PM, Piyush Sinha
ecstasy.piy...@gmail.comwrote:
I think following algo will work..I haven't tested it plus its in its
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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91
+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you
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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
@Vipulwont this become the case of extra memory overhead???
On 6/3/11, Vipul Kumar vipul.k.r...@gmail.com wrote:
convert the trees to DLL and then merge them to get the combined
sorted DLL , now create the AVl tree of that DLL.
On Fri, Jun 3, 2011 at 3:47 PM, Piyush Sinha ecstasy.piy
Sinha ecstasy.piy...@gmail.com
wrote:
m talking in terms of pointers..
On 6/3/11, Vipul Kumar vipul.k.r...@gmail.com wrote:
no,use the node of the tree as the node of the LL .
On Fri, Jun 3, 2011 at 5:08 PM, Piyush Sinha ecstasy.piy...@gmail.com
wrote:
@Vipulwont this become the case
ya true.nice solution...my bad
On 6/3/11, Vipul Kumar vipul.k.r...@gmail.com wrote:
yeah .. still complexity will be O(n) only far better then O(n^2)
On Fri, Jun 3, 2011 at 5:27 PM, Piyush Sinha ecstasy.piy...@gmail.com
wrote:
Ok..sorry my bad.i confused it with something else
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google
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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926
+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you
/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
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.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed
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.
--
*Piyush Sinha
=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
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.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
:
@Piyush， how to deal with this case :100 , 10
2011/5/27 Piyush Sinha ecstasy.piy...@gmail.com
we can work out if we sort according to the leftmost integer
On 5/27/11, adityasir...@gmail.com adityasir...@gmail.com wrote:
are you kidding me. Just simple sort wont work.
On Fri, May 27
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.
--
*Piyush Sinha
.
For example, given array A such that
A[0]=10, A[1]=2, A[2]=5, A[3]=1, A[4]=8, A[5]=20
the function should return 1, because the triple (0, 2, 4) fulfills
all of the required conditions.
For array A such that
A[0]=10, A[1]=50, A[2]=5, A[3]=1
the function should return 0
--
*Piyush Sinha*
*IIIT
);
if ( ithbit ^ jthbit) return false;
i++;j--;
}
return true;
}
Thanks,
Immanuel
On Tue, May 24, 2011 at 12:42 AM, Piyush Sinha
ecstasy.piy...@gmail.comwrote:
Constraint is no extra space and the complexity should be as efficient
as possible.
On 5/24/11, Piyush Sinha
@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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id
The input number is n. Find the closest Fibonacci series number i where i n.
Show the time complexity of the problem.
For eg : if n = 10, the output i should be 8
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926
+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you
. for the unknown one, i
ll have to think..
On Tue, May 24, 2011 at 6:48 AM, Piyush Sinha
ecstasy.piy...@gmail.comwrote:
@Aakash Sir...if it is so, can u elaborate ur logic??i mean what
should be maximum limit on the precomputation??
On 5/24/11, Aakash Johari aakashj@gmail.com wrote:
if u
.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
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
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.
--
*Piyush Sinha*
*IIIT, Allahabad
://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group
Find whether the binary representation of a number is palindrome or
not. The input begins with integer N.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed
Constraint is no extra space and the complexity should be as efficient
as possible.
On 5/24/11, Piyush Sinha ecstasy.piy...@gmail.com wrote:
Find whether the binary representation of a number is palindrome or
not. The input begins with integer N.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91
@MONSIEUR..
someone once saidTHE SECRET OF SUCCESS IS TO NEVER REVEAL YOUR
SOURCES... ;)...:P..:P
On 5/22/11, MONSIEUR monsieur@gmail.com wrote:
@piyush: excellent buddybtw what was the initial
spark...???.:-)
On May 21, 1:01 pm, Piyush Sinha ecstasy.piy...@gmail.com
@immanuel...i don't think it will..even if u think it does, provide
any sample test case
On 5/21/11, immanuel kingston kingston.imman...@gmail.com wrote:
I think your soln will print repetitions also.
On Mon, May 16, 2011 at 2:34 PM, Piyush Sinha
ecstasy.piy...@gmail.comwrote:
*int
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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91
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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727
Design an algorithm to find whether a given string is formed by the
interleaving of two given strings or not. e.g. s1= aabccabc s2= dbbabc s3=
aabdbbccababcc Given s1,s2,s3 design an efficient algorithm to find whether
s3 is formed from the interleaving of s1 and s2
--
*Piyush Sinha*
*IIIT
email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message
, 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.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727
... [?]
On Wed, May 18, 2011 at 4:52 PM, Piyush Sinha ecstasy.piy...@gmail.comwrote:
I think it can be done in O(n) but the auxilliary space required will be
more... in the solution which i have got its in the order of 2n
On Wed, May 18, 2011 at 4:44 PM, Kunal Patil kp101...@gmail.com wrote:
@Amit: Ohh
Given an English word in the form of a string, how can you quickly
find all valid
anagrams for that string (all valid rearrangements of the letters that
form valid
English words)?
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id
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.
--
PIYUSH SINHA
9936757773
--
You received
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.
--
PIYUSH SINHA
9936757773
--
You received
://groups.google.com/group/algogeeks?hl=en.
--
PIYUSH SINHA
9936757773
--
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
.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
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
:
Kunal,
Your solution runs in O(n) time but it is a wrong solution. It will run fine
if the array is sorted.
Anuj Agarwal
Engineering is the art of making what you want from things you can get.
On Mon, May 16, 2011 at 7:17 PM, Kunal Patil kp101...@gmail.com wrote:
@Piyush Sinha: I doubt
=en.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
each person's
three friends.
--
*Piyush Sinha*
*IIIT, Allahabad*
*+91-8792136657*
*+91-7483122727*
*https://www.facebook.com/profile.php?id=10655377926 *
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
, D:7, E:8} Then B, C, and D are friends of A, but A is not a
friend of any of them.
Dave
On May 16, 4:31 pm, Piyush Sinha ecstasy.piy...@gmail.com wrote:
Say you have an array containing information regarding n people. Each
person is
described using a string (their name) and a number
...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
PIYUSH SINHA
9936757773
--
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
/algogeeks?hl=en.
--
PIYUSH SINHA
9936757773
--
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
101 - 171 of 171 matches
Mail list logo
