| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
| 27 | 28 | 29 | 30 |
- lv4
- Stack
- 프로그래머스
- 조합
- cte
- join
- Level2
- 파이썬
- time complexity
- mysql
- programmers
- 코딩테스트
- python
- 연습문제
- 완전탐색
- lambda
- 데이터분석
- collections
- coding test
- 코딩
- BFS
- sql
- level4
- itertools
- import re
- 시간복잡도
- Queue
- 코테
- counter
- coding
- Today
- Total
목록2025/04/05 (2)
ror_coding
[HackerRank] Binary Tree Nodes
WITH RECURSIVE (CTE) 로 Level 구하기 !!! 매우 중요! Question You are given a table, BST, containing two columns: N and P, where N represents the value of a node in Binary Tree, and P is the parent of N.Write a query to find the node type of Binary Tree ordered by the value of the node. Output one of the following for each node:Root: If node is root node.Leaf: If node is leaf node.Inner: If node is neith..
[HackerRank] Occupations
MySQL에서 Pivot 추출하는 방법! CASE-WHEN 을 사용한다. Question Pivot the Occupation column in OCCUPATIONS so that each Name is sorted alphabetically and displayed underneath its corresponding Occupation. The output should consist of four columns (Doctor, Professor, Singer, and Actor) in that specific order, with their respective names listed alphabetically under each column.Note: Print NULL when there are no..