Answer Posted / satish sharma

LEFT HANDED THREAD
RIGHT HANDED THREAD

For ease of programming you can consider the maze as a 2D array with colors represented by below integer and characters (in capital letters). • B - Black • W -White • G- Green • R- Red R B W B W W W W W W B W B B W W W W W W W B W B W W W B W W W W B B W W W B W W W B W W B B B B W B W B W W B W W W B W W W B B B W W B W W W B W W B W B W W W B W B W W W W B B W W W W B W W W W W G Shortest Route Problem: • Solution that finds the shortest Route between Red and Green  White will have 1 Weight.  Red and Green carry no weights.  Shortest path is the path with less weight when you add up the weights in the path.

2019

---

what is comparable and comparator interface?

996

---

Differentiate between nested and inner class in java.

1006

---

How many types of array are there?

1011

---

What is a blocking method in Java?

1249

---

Does constructor be static?

1043

---

What is a ?

1203

---

what is the constructor and how many types of constructors are used in java?

1004

---

What is javac in java?

1012

---

Explain about core java?

1126

---

Is there any limitation of using inheritance?

1091

---

Is this valid in java ? Can we instantiate interface in java?

988

---

Does windows 10 need java?

1052

---

Give the difference between the println method and sqrt method?

1086

---

Can string be considered as a keyword?

1037

---