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. eg: 3 box contain stick as:1,1,1. if u take 1 stick from 3rd numbred box you will any how win the match.
2889Given: coordinates of rectangle-> left bottom and right top points. the rectangles create a hole.Find the maximum area of the hole. eg. 4 rectangles create a hole in between. find its area.
2541Post New Manhattan Programming Languages AllOther Interview Questions
Write an example that shows every attribute must have a value in xhtml?
What do you mean by double hashing?
What are the types of gradients in css3?
Define procedural knowledge and declarative knowledge.
What is the difference between the distributed database and the traditional database?
What is posting change?
What are the objectives using the automation anywhere control room?
WHAT IS NPF IN ACCOUNTS. AN ENTRY IN BANK STATEMENT" NPF SOME NAME XXXX DR SIDE" PLEASE ANSWER WHAT IS NPF?
What is xsd and wsdl?
Explain work?
How can you set default node version using nvm?
What are the different types of JSF events?
Are arrays primitive data types?
Tell me any other tools for scheduling purpose other than workflow manager pmcmd?
What are the available windows controls list?