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.
1565Post 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 are destructors in C#?
How do I log into an ftp server?
Define method overloading in c#?
What is gutter in newspaper?
What is mean carry over of Aux. Boiler?
What is spoolsv exe?
How do I open dll files to edit?
What is meant by a deadlock situation?
How can we provide the WebParts control functionality to a server control?
Tell us what is a transaction in sap terminology?
What are your views on Triple talaq?
Why should we select you over other candidates?
Is empty check in php?
How to retrieve data from mongodb using java?
What is ng bind html?
