Interested to Buy Any Domain ? << Click Here >> for more details...
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.
1991Post New Manhattan Core Java Interview Questions
- Manhattan C++ General Interview Questions (1)
- Manhattan Programming Languages AllOther Interview Questions (3)
- Manhattan JSP Interview Questions (1)
- Manhattan ASP.NET Interview Questions (1)
- Manhattan Dot Net General Interview Questions (6)
- Manhattan WinRunner Interview Questions (1)
- Manhattan QTP Interview Questions (2)
- Manhattan Manual Testing Interview Questions (6)
- Manhattan Test Cases Interview Questions (2)
- Manhattan RPG400 Interview Questions (1)
- Manhattan IBM AS400 AllOther Interview Questions (1) Manhattan Core Java Interview Questions (3)
- Manhattan Electrical Engineering Interview Questions (3)
- Manhattan General Aptitude Interview Questions (2)
- Manhattan Puzzles Interview Questions (2)
- Manhattan Placement Papers Interview Questions (1)
- Manhattan C Code Interview Questions (1)
What is list array in c#?
What is the difference between class selector and id selector?
Are there any problems with performing mathematical operations on different variable types?
What is the importance of good received/ invoice received clearing account?
What is the use of popen and pclose?
How does session work in php?
Explain the purpose of inductor in an electric circuit?
Define gateway in sap r/3?
What is the ?$? as an authorization value?
How to get each name only once from an employee table?
What are Visual Studio command switches?
Is hashmap part of collection?
What are the differences between eav and flat model?
Explain bluetooth.
Do you use version control?
