# [leetcode / medium] 3286. Find a Safe Walk Through a Grid - (bfs + dp) (Java) | 개발일지 [리트코드] 3286. Find a Safe Walk Through a Grid 문제를 Java를 사용해 bfs + dp로 풀었습니다. [https://joonk2.github.io/posts/2026/07/02/leetcode-3286/](https://joonk2.github.io/posts/2026/07/02/leetcode-3286/)
[leetcode / medium] 3286. Find a Safe Walk Through a Grid - (bfs + dp) (Java) | 개발일지
[리트코드] 3286. Find a Safe Walk Through a Grid 문제를 Java를 사용해 bfs + dp로 풀었습니다.
https://joonk2.github.io/posts/2026/07/02/leetcode-3286/