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.
2838Given: 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.
2486Post New Manhattan Programming Languages AllOther Interview Questions
Which is the default scripting language on the client side?
Describe the role of radiation therapy in cancer treatment and how it complements other modalities.
What are the different kinds of tags available in XML?
What is iapxtb structure? Explain its importance
What do you understand from 'internet banking'?
How to programmatically trigger a click event that's being handled by jquery?
What are the rules for debit and credit for different accounts to increase the amount in your business accounts?
What issues come up in test automation, and how do you manage them?
How to turn on the session support in php?
Explain important index characteristics?
Explain what is the smallest unit of execution in .net?
What is a buffer in computer?
Which design patterns have you used?
How to insert data into database in codeigniter?
What is ancestry in Spark? How adaptation to internal failure is accomplished in Spark utilizing Lineage Graph?