![[Java] 2140. Solving Questions With Brainpower - LeetCode Daily Challenge](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FkWM93%2FbtseTDKK66l%2FuISrCLP83rnThNJxqoiEXK%2Fimg.png)
코딩테스트/leetcode2023. 5. 12. 14:32[Java] 2140. Solving Questions With Brainpower - LeetCode Daily Challenge
Solving Questions With Brainpower - LeetCode Can you solve this real interview question? Solving Questions With Brainpower - You are given a 0-indexed 2D integer array questions where questions[i] = [pointsi, brainpoweri]. The array describes the questions of an exam, where you have to process the qu leetcode.com 풀이 DFS를 이용해서, 해당 칸을 탐색할 수 있을 경우 탐색해서 모든 경우의수를 구한다음 최대값을 구하는 단순 DFS문제라고 생각했다. class ..