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.
2800Given: 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.
2422Post New Manhattan Programming Languages AllOther Interview Questions
What are the reasons for using layered protocols ?
Can a system detect starvation?
What is mean by Compression technic and its formula? How many types of adaptors are there? How adaptive algorithm works for speech compression using Cosine packet transform?
Which is the best way for bob to limit her access to only those accounts?
What does magento cost?
Explain what is step-loop? Explain all the steps?
in mass flow meter what is drive friquancy ?
What is agent directive in jenkins?
What is inversejoincolumns in hibernate?
Explain the difference between css2 & css3?
What are the advantages of azure?
Explain the advantages of using c band for satellite communication?
What is @override annotation in java?
What is a column chart?
What is a qlikview publisher?