diff --git "a/leetcode3/\353\263\200\354\247\200\355\230\221/v3/1886. Determine Whether Matrix Can Be Obtained By Rotation.py" "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/1886. Determine Whether Matrix Can Be Obtained By Rotation.py"
new file mode 100644
index 00000000..e290a89c
--- /dev/null
+++ "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/1886. Determine Whether Matrix Can Be Obtained By Rotation.py"	
@@ -0,0 +1,26 @@
+'''
+첫번째 행: 마지막 열
+두번째 행: 중간 열
+세번째 행: 첫번째 열
+'''
+class Solution:
+    def rotate(self, mat):
+        n = len(mat)
+        tmp = [[0] * n for _ in range(n)]
+        last = n-1
+        for i in range(n):
+            for j in range(n):
+                tmp[j][last] = mat[i][j]
+            last -= 1
+        
+        return tmp
+
+    def findRotation(self, mat: List[List[int]], target: List[List[int]]) -> bool:
+        # print(self.rotate(mat))
+
+        for _ in range(4):
+            mat = self.rotate(mat)
+            if target == mat:
+                return True
+
+        return False    
\ No newline at end of file
diff --git "a/leetcode3/\353\263\200\354\247\200\355\230\221/v3/894. All Possible Full Binary Trees.py" "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/894. All Possible Full Binary Trees.py"
new file mode 100644
index 00000000..ad76eb77
--- /dev/null
+++ "b/leetcode3/\353\263\200\354\247\200\355\230\221/v3/894. All Possible Full Binary Trees.py"	
@@ -0,0 +1,39 @@
+'''
+실패
+'''
+from collections import deque
+
+class Solution:
+    def allPossibleFBT(self, n: int) -> List[Optional[TreeNode]]:
+        queue = deque()
+        t = TreeNode()
+        t.left = TreeNode()
+        t.right = TreeNode()
+        queue.append(t)
+        count = 3
+        ans = []
+
+        if n == 3:
+            return [t]
+
+        while True:
+            node = []
+            while queue:
+                node.append(queue.pop())
+
+            for n in node:
+                left = TreeNode()
+                right = TreeNode()
+                left.left = n
+                left.right = TreeNode()
+                right.right = n
+                right.left = TreeNode()
+                queue.append(left)
+                queue.append(right)
+            count+=2
+
+            if count == n:
+                break
+        
+        # print(len(queue))
+        return list(queue)
\ No newline at end of file