yes u r wrong..
1 is nt divisible by 23
On Sat, Aug 6, 2011 at 9:15 AM, sumit sumitispar...@gmail.com wrote:
This looks quite simple.
Every number ending in 3 follows a pattern.eg-
3 - 111
13 - 11
23 - 1 etc
we can find the reauired no. by :
suppose input no. is 33
In
no data structure.
rather implement chess board like a matrix and its(knight's)8 different
types of movement.
On Thu, Mar 24, 2011 at 6:19 PM, snehal jain learner@gmail.com wrote:
Design a data structure to represent the movement of a knight on a
chess board.
--
You received this
stack for sure..
pop out the enteries till they r same and push this entry back once.
On Wed, Feb 16, 2011 at 11:18 AM, jalaj jaiswal
jalaj.jaiswa...@gmail.comwrote:
can any1 tell me the question .. m gettin half of the post ,...
On Wed, Feb 16, 2011 at 10:41 AM, Jammy xujiayiy...@gmail.com
explain the 1st one again
On Thu, Dec 9, 2010 at 11:16 AM, Anand anandut2...@gmail.com wrote:
One of my friend recently had a telephonic interview and he got two
question to program.
1. Given a binary search tree. Write a function which takes any given node
from the binary tree and a
they will be integers in q2...
On 10/2/10, swayambhoo jain swayambhoo.j...@gmail.com wrote:
Are the four numbers in question #2 integers or they can be anything?
On Sat, Oct 2, 2010 at 10:03 AM, swayambhoo jain
swayambhoo.j...@gmail.comwrote:
What about the case when we have repeated
