[이총명] Day2

leetcode2/1easy/이총명/Q2194.java

@@ -0,0 +1,9 @@
+class Solution {
+    public List<String> cellsInRange(String s) {
+        String[] split_s = s.split(":");
+        List<String> split_s_List = Arrays.asList(split_s);
+        String letter1 = 
+        return split_s_List;
+
+    }
+}

leetcode2/2medium/이총명/Q3326.java

@@ -0,0 +1,9 @@
+class Solution {
+    public int minOperations(int[] nums) {
+        for(int i = 0; i < nums.length - 1; i++){
+            if(nums[i] <= nums[i+1]){
+                nums[i] = nums[i] % 
+            }
+        }
+    }
+}

leetcode2/3hard/이총명/Q3229.java

@@ -0,0 +1,5 @@
+class Solution {
+    public long minimumOperations(int[] nums, int[] target) {
+
+    }
+}