diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1249.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1249.java
new file mode 100644
index 0000000..40bf1b7
--- /dev/null
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1249.java
@@ -0,0 +1,82 @@
+package ssafy_avanced_study;
+
+import java.util.Scanner;
+import java.util.Queue;
+import java.io.BufferedReader;
+import java.io.InputStreamReader;
+import java.util.LinkedList;
+
+public class no_1249 {
+	
+	static int answer = Integer.MAX_VALUE;
+
+	public static void main(String[] args) throws Exception {
+		
+		
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+		int T;
+		T=Integer.parseInt(br.readLine());
+	
+		for(int test_case = 1; test_case <= T; test_case++){
+		
+			int size =Integer.parseInt(br.readLine());
+			
+			int[][]map = new int[size][size];
+			
+			for(int i=0;i<size;i++) {
+				
+				String str = br.readLine();
+				
+				for(int j=0;j<size;j++) {
+					map[i][j] = Integer.parseInt(""+str.charAt(j));
+					
+				}
+				
+				
+			}
+		
+			
+			int[][]move = {{1,0},{0,1},{-1,0},{0,-1}};
+			
+			boolean[][]visited = new boolean[size][size];
+		
+			dfs(size,0,0,move,map,visited,0);
+			
+			System.out.println(answer);
+			
+			answer = Integer.MAX_VALUE;
+			
+		}
+		
+	
+	}
+	
+	static void dfs(int size,int i,int j,int[][]move,int[][]map,boolean[][]visited,int now) {
+		
+		if(i>size-2 && j>size-2) {
+			
+			answer = Math.min(answer, now);
+			return;
+		}
+		
+		for(int d=0;d<4;d++) {
+			
+			int newI = i + move[d][0];
+			int newJ = j + move[d][1];
+			
+			if(newI<0||newJ<0||size-1<newI||size-1<newJ) continue;
+			
+			if(!visited[newI][newJ]) {
+				visited[newI][newJ] = true;
+				int newOne = now + map[newI][newJ];
+				dfs(size,newI,newJ,move,map,visited,newOne);
+				visited[newI][newJ] = false;
+			}
+			
+		}
+		
+		
+		
+		
+	}
+}
\ No newline at end of file
diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1936.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1936.java
new file mode 100644
index 0000000..a89a8df
--- /dev/null
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1936.java
@@ -0,0 +1,37 @@
+package ssafy_avanced_study;
+
+import java.util.Scanner;
+
+public class no_1936 {
+
+	
+	public static void main(String[] args) {
+		
+		Scanner scan = new Scanner(System.in);
+		
+		int a = scan.nextInt();
+        int b = scan.nextInt();
+        
+        String.valueOf(a);
+        
+        String answer = "";
+       
+        if(a==1){
+            if(b==2) answer = "B";
+            else answer = "A";
+        }else if(a==2){
+            if(b==3) answer = "B";
+            else answer = "A";
+        }else{
+            if(b==1) answer = "B";
+            else answer = "A";
+        }
+		/////////////////////////////////////////////////////////////////////////////////////////////
+		/*
+			 이 부분에 여러분의 알고리즘 구현이 들어갑니다.
+		 */
+		/////////////////////////////////////////////////////////////////////////////////////////////
+		System.out.println(answer);
+		
+	}
+}
diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1946.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1946.java
new file mode 100644
index 0000000..4721da0
--- /dev/null
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1946.java
@@ -0,0 +1,60 @@
+package ssafy_avanced_study;
+
+import java.util.Scanner;
+
+public class no_1946 {
+	
+	public static void main(String[] args) {
+		Scanner sc = new Scanner(System.in);
+		int T;
+		T=sc.nextInt();
+	
+
+		for(int test_case = 1; test_case <= T; test_case++)
+		{
+           
+		
+			int n = sc.nextInt();
+			
+			
+			
+			String answer = "";
+            
+			sc.nextLine();
+
+			for(int i=0;i<n;i++) {
+				
+				
+				String str = sc.nextLine();
+				char alpha = str.charAt(0);
+				int count = 0;
+			
+				if(str.charAt(2)=='1' && str.length()>3) {
+					count = Integer.parseInt(""+str.charAt(2)+str.charAt(3));
+				}else if(str.charAt(2)=='2' && str.length()>3) {
+					count = Integer.parseInt(""+str.charAt(2)+str.charAt(3));
+				}
+				else count = Integer.parseInt(String.valueOf(str.charAt(2)));
+				
+				for(int j=0;j<count;j++) answer += alpha;
+				
+				
+				
+			}
+
+			System.out.println("#"+test_case);
+			String a = "";
+			for(int i=1;i<=answer.length();i++) {
+				a += answer.charAt(i-1);
+				if(i%10==0) {
+					System.out.println(a);
+					a = "";
+				}
+			}
+			System.out.println(a);
+			
+			
+
+		}
+	}
+}
\ No newline at end of file
diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1959.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1959.java
new file mode 100644
index 0000000..498f395
--- /dev/null
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1959.java
@@ -0,0 +1,71 @@
+package ssafy_avanced_study;
+
+import java.util.Scanner;
+
+public class no_1959 {
+
+	public static void main(String[] args) {
+		
+		Scanner sc = new Scanner(System.in);
+		
+		int T;
+		T = sc.nextInt();
+		
+		for(int test_case=1;test_case<=T;test_case++) {
+			
+			String answer = "#"+test_case+" ";
+			
+			int a = sc.nextInt();
+			int b = sc.nextInt();
+			int ans = 0;
+			int []arr1 = new int[a];
+			int []arr2 = new int[b];
+			
+			for(int i=0;i<a;i++) arr1[i] = sc.nextInt();
+			for(int i=0;i<b;i++) arr2[i] = sc.nextInt();
+			
+			int max = 0;
+			
+			if(a<=b) {
+				
+				int c = b-a;
+				
+				for(int i=0;i<=c;i++) {
+					
+					for(int j=0;j<arr1.length;j++) ans += arr1[j] * arr2[j+i];
+						
+					System.out.println(ans);
+					
+					max = Math.max(max, ans);					
+					ans = 0;
+				}
+				
+				
+			}else {
+				
+				int c = a-b;
+				
+				for(int i=0;i<=c;i++) {
+					
+					for(int j=0;j<arr2.length;j++) ans += arr2[j] * arr1[j+i];
+					
+				
+					
+					max = Math.max(max, ans);
+					ans = 0;
+				}
+				
+				
+			}
+			
+			
+			answer += max;
+			
+			System.out.println(answer);
+			
+		}
+		
+		
+		
+	}
+}
diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1961.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1961.java
new file mode 100644
index 0000000..7c414d4
--- /dev/null
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1961.java
@@ -0,0 +1,83 @@
+package ssafy_avanced_study;
+
+import java.util.Scanner;
+
+public class no_1961 {
+
+	public static void main(String[] args) {
+		
+		
+		
+		Scanner sc = new Scanner(System.in);
+		int T;
+		T=sc.nextInt();
+		/*
+		   여러 개의 테스트 케이스가 주어지므로, 각각을 처리합니다.
+		*/
+
+		for(int test_case = 1; test_case <= T; test_case++){
+		
+			
+			
+			String answer = "#"+test_case;
+			
+			int size = sc.nextInt();
+			
+			int[][]map = new int[size][size];
+			
+			for(int i=0;i<size;i++) {
+				for(int j=0;j<size;j++) {
+					map[i][j] = sc.nextInt();
+				}
+			}
+			
+			System.out.println(answer);
+			
+			int[][]map1 = new int[size][size];
+			
+			for(int j=0;j<size;j++) {
+				for(int i=size-1;i>-1;i--) {
+					map1[j][size-i-1] = map[i][j];
+				}
+				
+			}
+			
+			int[][]map2 = new int[size][size];
+			
+			
+			for(int i=size-1;i>-1;i--) {
+				for(int j=size-1;j>-1;j--) {
+					map2[size-i-1][size-j-1] = map[i][j];
+				}
+				
+			}
+			
+			int[][]map3 = new int[size][size];
+			
+			for(int j=size-1;j>-1;j--) {
+				for(int i=0;i<size;i++) {
+					map3[size-j-1][i] = map[i][j];
+				}
+				
+			}
+			
+			for(int i=0;i<size;i++) {
+				for(int j=0;j<size;j++) {
+					System.out.print(map1[i][j]);
+					
+				}
+				System.out.print(" ");
+				for(int j=0;j<size;j++) {
+					System.out.print(map2[i][j]);
+				}
+				System.out.print(" ");
+				for(int j=0;j<size;j++) {
+					System.out.print(map3[i][j]);
+				}
+				System.out.println();
+			}
+			
+			
+		}
+	}
+}
\ No newline at end of file
diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1974.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1974.java
new file mode 100644
index 0000000..b21d1b7
--- /dev/null
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1974.java
@@ -0,0 +1,68 @@
+package ssafy_avanced_study;
+
+import java.util.Scanner;
+
+public class no_1974 {
+
+	public static void main(String[] args) {
+		
+		Scanner sc = new Scanner(System.in);
+		int T;
+		T=sc.nextInt();
+		
+		for(int test_case = 1; test_case <= T; test_case++){
+		
+			int[][]map = new int[9][9];
+			
+			boolean flag = true;
+			String answer = "#"+test_case+" ";
+			for(int i=0;i<9;i++) {
+				for(int j=0;j<9;j++) {
+					map[i][j] = sc.nextInt();
+				}
+			}
+			outerLoop:
+			for(int i=0;i<9;i++) {
+				int []arr = new int[9];
+				int []arr2 = new int[9];
+				for(int j=0;j<9;j++) {
+					arr[map[i][j]-1]++;
+					arr2[map[j][i]-1]++;
+					
+					if(arr[map[i][j]-1]>1 || arr2[map[i][j]-1]>1) {
+						flag = false;
+						break outerLoop;
+					}
+					
+					
+					}
+					
+				}
+			outerLoop:
+			for(int l=0;l<3;l++) {
+				
+				int[]arr = new int[9];
+
+				for(int i=0;i<3;i++) {
+					for(int j=0;j<3;j++) {
+						arr[map[i+(l*3)][j+(l*3)]-1]++;
+						if(arr[map[i][j]-1]>1) {
+							flag = false;
+							break outerLoop;
+						}
+						
+					}
+				}
+			}
+			
+			
+			if(!flag) answer += 0 ;
+			else answer += 1;
+			
+			System.out.println(answer);
+			
+			
+			
+		}
+	}
+}
\ No newline at end of file
diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1979.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1979.java
new file mode 100644
index 0000000..bf7f756
--- /dev/null
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_1979.java
@@ -0,0 +1,108 @@
+package ssafy_avanced_study;
+
+import java.util.Scanner;
+import java.util.Stack;
+
+public class no_1979 {
+	
+	public static void main(String[] args) {
+		
+		
+		Scanner sc = new Scanner(System.in);
+		int T;
+		T=sc.nextInt();
+		
+		for(int test_case = 1; test_case <= T; test_case++){
+		
+			String answer = "#"+test_case+" ";
+			
+			int size = sc.nextInt();
+			int len = sc.nextInt();
+			int ans = 0;
+			
+			int [][]map = new int[size][size];
+			
+			for(int i=0;i<size;i++) {
+				for(int j=0;j<size;j++) {
+					map[i][j] = sc.nextInt();
+				}
+			}
+			
+			//가로
+			
+			for(int i=0;i<size;i++) {
+				Stack<Integer> stack = new Stack<>();
+				for(int j=0;j<size;j++) {
+					
+					if(map[i][j]==1) stack.add(1);
+					else stack.add(0);
+				}
+				int count = 0;
+				
+				while(!stack.isEmpty()) {
+					
+					if(stack.isEmpty()) break;
+			
+					if(stack.peek()==1) count++;
+					else if(stack.peek()==0) count = 0;
+						
+			
+					stack.pop();	
+					
+					if(count==len) {
+						if(!stack.isEmpty()&&stack.peek()==0) {
+							ans++;
+							count = 0;
+							stack.pop();
+						}else if(stack.isEmpty()) {
+							ans++;
+						}
+					}
+					
+				}
+				
+			}
+			
+			//세로
+			
+			for(int j=0;j<size;j++) {
+				Stack<Integer> stack = new Stack<>();
+				for(int i=0;i<size;i++) {
+					
+					if(map[i][j]==1) stack.add(1);
+					else stack.add(0);
+				}
+				int count = 0;
+				
+				while(!stack.isEmpty()) {
+					
+					if(stack.isEmpty()) break;
+				
+					if(stack.peek()==1) count++;
+					else if(stack.peek()==0) count = 0;
+						
+					stack.pop();
+					
+					if(count==len) {
+						if(!stack.isEmpty()&&stack.peek()==0) {
+							ans++;
+							count = 0;
+							stack.pop();
+						}else if(stack.isEmpty()) {
+							ans++;
+						}
+					}
+					
+				}
+				
+			}
+			
+			answer += ans;
+			
+			System.out.println(answer);
+			
+			
+			
+		}
+	}
+}
\ No newline at end of file
diff --git a/Basic_Of_Algorithm/src/ssafy_avanced_study/no_2001.java b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_2001.java
new file mode 100644
index 0000000..52cf58d
--- /dev/null
+++ b/Basic_Of_Algorithm/src/ssafy_avanced_study/no_2001.java
@@ -0,0 +1,50 @@
+package ssafy_avanced_study;
+
+import java.util.Scanner;
+
+public class no_2001 {
+	
+	public static void main(String[] args) {
+		
+		
+		Scanner sc = new Scanner(System.in);
+		int T;
+		T=sc.nextInt();
+		/*
+		   여러 개의 테스트 케이스가 주어지므로, 각각을 처리합니다.
+		*/
+
+		for(int test_case = 1; test_case <= T; test_case++)
+		{
+		int n = sc.nextInt();
+		int k = sc.nextInt();
+		int [][]map = new int[n][n];
+		
+		for(int i=0;i<n;i++) {
+			for(int j=0;j<n;j++) {
+				map[i][j] = sc.nextInt();
+			}
+		}
+		
+		int ans = 0;
+		int max = 0;
+		
+		for(int i=0;i<=n-k;i++) {
+			for(int j=0;j<=n-k;j++) {
+				
+				for(int ii=0;ii<k;ii++) {
+					for(int jj=0;jj<k;jj++) {
+						ans += map[ii+i][jj+j];
+					}
+				}
+				
+				max = Math.max(ans, max);
+				ans = 0;
+			}
+		}
+		String answer = "#"+test_case+" "+max;
+		System.out.println(answer);
+		
+		}
+	}
+}