bcoz u cant keep reinitializing the same object
On 5 September 2011 22:15, Neha Singh neha.ndelhi.1...@gmail.com wrote:
Guys hv a doubt, plz clarify ..
You mentioned that if a class has a private constructor then the object of
that class can be created using call to a static method which
for yahoo shudnt min additions be yahay?
On 6 September 2011 00:48, learner nimish7andr...@gmail.com wrote:
@sandeep Explain Algorithm/logic Time Complexity ?
Thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
];
}
}
printf(%s %d,d,c);
}
On 6 September 2011 01:21, Pratz mary pratima.m...@gmail.com wrote:
for yahoo shudnt min additions be yahay?
On 6 September 2011 00:48, learner nimish7andr...@gmail.com wrote:
@sandeep Explain Algorithm/logic Time Complexity ?
Thanks
--
You received this message
this s on geeks for geeks and the answer is 20
On 1 September 2011 00:11, htross htb...@gmail.com wrote:
u r not considering what if the first fork returns non zero and the
second for returns a zero value then
On Aug 31, 9:50 pm, rahul vatsa vatsa.ra...@gmail.com wrote:
int main()
{
ya thats wat i got too
On 11 August 2011 23:26, Mani Bharathi manibharat...@gmail.com wrote:
wrong. 5
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
rs aggarwal
On 10 August 2011 18:32, Shashank Jain shashan...@gmail.com wrote:
what is the best book for aptitude questions?
Shashank Jain
IIIrd year
Computer Engineering
Delhi College of Engineering
--
You received this message because you are subscribed to the Google Groups
ya ur right!!!
On 10 August 2011 18:44, vamshi vijay vamshi1...@gmail.com wrote:
@Sagar
See at level 4, 81 leaf nodes are possible, since in question it has been
given 28 leaf nodes, if i use just 10 nodes from level 3 (27 nodes), i can
get 28 leaves, but if u observe the remaining 17
the evalution starts from right to left bt gets printed from left to right
On 10 August 2011 16:14, Naveen Kumar naveenkumarve...@gmail.com wrote:
AFAIK evalution order of parameters in c is compiler dependent.
On Wed, Aug 10, 2011 at 4:09 PM, siddharam suresh
siddharam@gmail.com wrote:
i think its because when ur declaring func f ur passing a struct which hasnt
been declared yet...put the structure declaraion before the func declaration
On 31 July 2011 20:33, Rajesh Kumar testalgori...@gmail.com wrote:
What is Error in This program??plzrply
#includestdio.h
f(struct epm);
would it make a difference if it wasnt a circular array?
On 26 July 2011 23:52, coder coder i.code.program...@gmail.com wrote:
in the circular array ABCDEABCCDE
The answer is 6 because the circular string starting from the element
A in the 6th position comes first in the dictionary formed
how?
On 26 July 2011 23:18, ankit sambyal ankitsamb...@gmail.com wrote:
@vivin : Suffix trees are memory intensive..
This problem can be solved just by running 2 nested loops in O(1)
space and O(n^2) time
--
You received this message because you are subscribed to the Google Groups
hey the above case wont work for a few casesfor instance wen the seventh
letter of the alphabet is involved...
On 26 July 2011 15:32, sachet sache...@gmail.com wrote:
please explainthe code
#includestring
using namespace std;
int main()
{
int x=0;
string str;
cinstr;//only
us too...are u anna uni by any chance?
On 25 July 2011 19:43, Mani Bharathi manibharat...@gmail.com wrote:
which col?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
anurag :
ok i dont understand the part where uv done x^=(1(str[i]-97))
On 25 July 2011 22:49, SkRiPt KiDdIe anuragmsi...@gmail.com wrote:
You dint understand . Only the non-palindromic strings get rejected.
In odd_len words only one bit should be high for it to become a
palindrome.For
14 matches
Mail list logo
