Re: [algogeeks] [URGENNT] : naukri.com paper pattern

[Manni mbd]

speed and time mangement were only hurdle.

On Thu, Mar 29, 2012 at 1:24 AM, Aman Goyal aman.goya...@gmail.com wrote:

 10 multiple choice questions on C : very easy , Kanetkar will suffice.

 Aptitude : subjective , with mostly mathematical puzzles . Lengthy due to
 time consuming problems. Focus on accuracy .Series completion, Time speed
 distance,permutation and combination is what i can recall in the aptitude
 paper.

 On Tue, Mar 27, 2012 at 8:07 PM, aditya gupta g.aditya.i...@gmail.comwrote:

 Hi all,

 nauri.com is visiting at my friend's college , can someone plz tell the
 pattern of its paper??

 --
 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.


-- 
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] Adobe Noida Interview Question

[Decipher]

This was asked from my friend in January for MTS profile.

Q1) Given a matrix with letters in each square and you have to find words 
which are there in the dictionary (like Children's Crosswords). You have 
been given a function which outputs 1 if the given word is in the 
dictionary. The word could be bidirectionally horizontal, vertical 
or diagonal. Write an optimal algorithm for printing all such words.   

Q2) Given a very large string in which there is no kind of delimiter and 
you have been given function strstr() . Find a given string in the larger 
string using that function using minimum time and space.

-- 
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/-/LEWoWBWfpVkJ.
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.