| # | Title | Solutions | Video | Difficulty | Tag

|------|---------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------------------------------------------------------------------------------------------------------------------------|-------------------------------------------------------------------------------|------------|----------------------------------------------------------------------

| 3248|[Snake in Matrix](https://leetcode.com/problems/snake-in-matrix/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3248.java)|| Easy|

| 3243|[Shortest Distance After Road Addition Queries I](https://leetcode.com/problems/shortest-distance-after-road-addition-queries-i/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3243.java)|| Medium|

| 3242|[Design Neighbor Sum Service](https://leetcode.com/problems/design-neighbor-sum-service/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3242.java)|| Easy|

| 3241|[Time Taken to Mark All Nodes](https://leetcode.com/problems/time-taken-to-mark-all-nodes/)|[Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3241.java)|| Hard|

packagecom.fishercoder.solutions.fourththousand;

importjava.util.List;

publicclass_3248 {

publicstaticclassSolution1 {

publicintfinalPositionOfSnake(intn,List<String>commands) {

int[]pos =newint[2];

for (Stringcommand :commands) {

if (command.equals("RIGHT")) {

pos[1]++;

}elseif (command.equals("DOWN")) {

pos[0]++;

}elseif (command.equals("UP")) {

pos[0]--;

}elseif (command.equals("LEFT")) {

pos[1]--;

}

}

returnpos[0] *n +pos[1];

}

}

}