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.
2797Given: 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.
2415Post New Manhattan Programming Languages AllOther Interview Questions
What sort of advantages do businesses have with effective database management? : hana administration
What are the actions followed by hadoop?
What is clr ddl trigger?
How do I enable activex controls in excel?
What is the use of sap bi launchpad? : hana bi development
What is wpmudev?
Why do we use using namespace std in c++?
What are the key characteristics of a blockchain?
Can I initialize unions?
What technical support do we get with Delphi?
What is the test harness?
What sharepoint development tool works best to create custom workflows?
Is google pixel an android phone?
How will retry the failed cases in your process?
Which is the fastest operating system?