공부용/모각코 개인6 모각코 6주차 sql2 https://school.programmers.co.kr/learn/courses/30/lessons/131114 프로그래머스 코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요. programmers.co.kr select WAREHOUSE_ID, WAREHOUSE_NAME, ADDRESS, IFNULL(FREEZER_YN, 'N') AS FREEZER_YN FROM FOOD_WAReHOUSE WHERE ADDRESS LIKE '경기%' order by warehouse_id https://school.programmers.co.kr/learn/courses/30/lessons/59039 프로그래머스 .. 2024. 2. 15. 모각코 5주차 sql1 https://school.programmers.co.kr/learn/courses/30/lessons/144853 프로그래머스 코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요. programmers.co.kr -- 코드를 입력하세요 SELECT Book_id, DATE_FORMAT(PUBLISHED_DATE, '%Y-%m-%d') from book where category = '인문' and year(published_date) = 2021 order by published_date asc; https://school.programmers.co.kr/learn/courses/30/lessons/13.. 2024. 2. 4. 모각코 4주차 dp 198. House Robber LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution(object): def rob(self, nums): """ :type nums: List[int] :rtype: int """ if not nums: return 0 prev1 = 0 prev2 = 0 for num in nums: tmp = prev1.. 2024. 2. 4. 모각코 3주차 순회문제 700. Search in a Binary Search Tree LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com # Definition for a binary tree node. # class TreeNode(object): # def __init__(self, val=0, left=None, right=None): # self.val = val # self... 2024. 1. 19. 모각코 2주차 bfs def bfs(graph, start_node): visit = list() queue = list() queue.append(start_node) while queue: node = queue.pop(0) if node not in visit: visit.append(node) queue.extend(graph[node]) return visit 관련 문제 199. Binary Tree Right Side View class Solution(object): def rightSideView(self, root): def bfs(root, level, rightSide): if not root: return if level == len(rightSide): rightSide.append(root.val) .. 2024. 1. 14. 모각코 1주차 dfs def dfs(graph, start_node): visit = list() stack = list() stack.append(start_node) while stack: node = stack.pop() if node not in visit: visit.append(node) stack.extend(graph[node]) return visit dfs code - iterator def dfs_recursive(graph, start, visit=None): if visit is None: visit = list() visit.append(start) for next in graph[start]: if next not in visit: dfs_recursive(graph, next, visit) ret.. 2024. 1. 11. 이전 1 다음