there are N number of matchboxes numbered 1...N.each
matchbox contain various number of stick.Two player can
alternatevely pick some amount of stick from the higest
stick containing box . The player is condidered win if
there is no stick after his move.Find the final move so
that the move player win.

Note:In case the number of stick is equal ,pick the stick
from the higest numbered box.


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Core Java Interview Questions

What is difference between hashset and hashmap?

0 Answers  


What is an inner class in java?

0 Answers  


Differences between external iteration and internal iteration?

0 Answers  


Can bool be null?

0 Answers  


os is developed in c no java is more secured then c na why dont the os developed is developed using java

1 Answers  






Explain jvm, jre, and jdk?

0 Answers  


What is an escape character in java?

0 Answers  


can any one tell me when do u go for inheritance and polymorphism

3 Answers  


What are the advantages of encapsulation in java?

0 Answers  


What is a lock or purpose of locks in java?

0 Answers  


What is immutable class? how to make a Class explicitly "Immutable"?Wap to make a class explicitly immutable.

3 Answers  


What is a condition in java?

0 Answers  


Categories