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.

0 Answers   Manhattan,

---

What's the default access specifier for variables and methods of a class?

0 Answers  

---

How to connect to a remote database using Applet?

0 Answers  

---

What is variable and rules of variable?

0 Answers  

---

What are static variables and functions?

0 Answers   Tech Mahindra,

---

---

whats string ?

10 Answers   HCL,

---

List the three steps for creating an object for a class?

0 Answers  

---

Which is better ascii or unicode?

0 Answers  

---

Is 0 an even number?

0 Answers  

---

There are 2 methods in a class. Both have the same method signature except for return types. Is this overloading or overriding or what is it?

9 Answers   KPIT,

---

Does a function need a return?

0 Answers  

---

Convert Binary tree to linked list.

0 Answers   Amazon,

---