[algogeeks] Need help

2018-04-22 Thread pawan yadav
Hi All, Has anybody solved the following problem? https://www.careercup.com/question?id=5196860946907136 -Pawan -- 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

[algogeeks] MindTickle Interview process

2016-07-19 Thread pawan yadav
Hi All, Has anybody experienced the interview process with MindTickle Pune? If yes, please share the problems. Thanks, Pawan -- 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,

[algogeeks] Designing Interview questions

2016-07-10 Thread pawan yadav
Hi All, Can anyone please let me know where can I read/understand about questions like "Design a Car Service center", I see this type of questions in many interview sets. What do interviewer expect in this type of questions? It would be great help. -Pawan -- You received this message because

[algogeeks] Print the diameter of a binary tree

2014-04-18 Thread pawan yadav
Hi All, I know how to find the diameter of given binary tree but i don't know how to print the diameter (this longest path). Can somebody please give a code snippet for this? Thanks, Pawan. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group.

[algogeeks] Implement lastindexofastring(String s1,String s2)

2014-04-02 Thread pawan yadav
Hi All, How can we do the following problem in efficient way : Implement lastindexofastring(String s1,String s2) . If s2 is present multiple times return the last index of s2 in s1 , else return -1. Is KMP applicable for this problem? If yes, then how can we modify KMP algo? Thanks, Pawan. --

[algogeeks] output

2013-12-06 Thread pawan yadav
Hi All, I'm not able to get output of following c program : #includestdio.h main() { int a[] ={ 1,2,3,4,5,6,7}; char c[] = {'a','x','h','o','k'}; //printf(%u %u\n, a[3], a[0]); line 6 printf(%d %d %d %d \n, (a[3]-a[0])); } If line 6 is commented,

Re: [algogeeks] output

2011-07-12 Thread pawan yadav
@rahul thanks for reply o/p (of 1st program) : constructor constructor print statement destructor destructor here copy constructor is not called ... that's why i have posted this program On Tue, Jul 12, 2011 at 10:42 PM, rahul rahulr...@gmail.com wrote: Hi, In first program,it will call

Re: [algogeeks] regarding output

2010-10-11 Thread pawan yadav
one more problem is there int main() { short int a,b,c; scanf(%d,a); sacnf(%d,b); c=a+b; printf(c=%d,c); return(0); } if a=30,b=40, then c=40; and if a=40,b=30, then c=30; why it is ? eplain in details On Tue, Oct 12, 2010 at 2:55 AM, carry pawan1991ya...@gmail.com wrote: int main() { int i;

Re: [algogeeks] Re: palindromic base

2010-10-04 Thread pawan yadav
we have to find the base greater than or equal to 2 -- 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