Lv2

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/159993제한 사항입출력 예풀이def solution(maps): answer = 0 row_size = len(maps) col_size = len(maps[0]) start = [[-1, -1]] lever = [[-1, -1]] for r in range(row_size): for c in range(col_size): if maps[r][c] == 'S': start = [[r, c]] elif maps[r][c] == 'L': lever =..

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/284527 입출력 예 풀이SELECT G.SCORE, E.EMP_NO, E.EMP_NAME, E.POSITION, E.EMAILFROM HR_EMPLOYEES E INNER JOIN ( SELECT EMP_NO, SCORE, RANK() OVER(ORDER BY SCORE DESC) AS RNK FROM (SELECT EMP_NO, SUM(SCORE) AS SCORE FROM HR_GRADE WHERE YEAR = '2022' GROUP BY EMP_NO ) AS S ) ..

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/301649 입출력 예 풀이SELECT ID, CASE WHEN PERCENT ㄴ PERCENT_RANK() 사용 SELECT ID, CASE PERCENT WHEN 1 THEN 'CRITICAL' WHEN 2 THEN 'HIGH' WHEN 3 THEN 'MEDIUM' WHEN 4 THEN 'LOW' END AS 'COLONY_NAME'FROM ( SELECT *, NTILE(4) OVER(ORDER BY SIZE_OF_COLONY DESC) AS PERCENT FROM ECOLI_DATA) AS eOR..

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/42746 제한 사항   입출력 예   풀이 import java.util.Arrays;import java.util.stream.Collectors;class Solution { public String solution(int[] numbers) { return Arrays.stream(numbers) .boxed() .sorted((a, b) -> { String strA = String.valueOf(a) + String.valueOf(b); String strB = String..

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/81302   제한 사항   입출력 예   풀이import java.util.HashMap;import java.util.ArrayList;class Solution { HashMap nodeMap; public int[] solution(String[][] places) { int[] answer = new int[places.length]; for (int i = 0; i (); ArrayList pList = new ArrayList(); for (int y = 0; y    후기맨해튼 거리가..

문제 설명https://school.programmers.co.kr/learn/courses/30/lessons/77485 제한 사항 입출력 예 풀이class Solution { public int[] solution(int rows, int columns, int[][] queries) { int[] answer = new int[queries.length]; int[][] data = new int[rows][columns]; int count = 1; for (int i = 0; i start[0]; y--) { min = Math.min(min, data[y - 1][end[1]]); i..