내 인생에도 예쁜 꽃이 피었으면 좋겠다

[hackerrank] Prepare > SQL > Advanced Select > Binary Tree Nodes [문제] 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. In..

[hackerrank] Prepare > SQL > Advanced Select > The PADS [문제] Generate the following two result sets: Query an alphabetically ordered list of all names in OCCUPATIONS, immediately followed by the first letter of each profession as a parenthetical (i.e.: enclosed in parentheses). For example: AnActorName(A), ADoctorName(D), AProfessorName(P), and ASingerName(S). Query the number of ocurrences of e..

[hackerrank] Prepare > SQL > Advanced Select > type of triangle [문제] Write a query identifying the type of each record in the TRIANGLES table using its three side lengths. Output one of the following statements for each record in the table: Equilateral: It's a triangle with sides of equal length. Isosceles: It's a triangle with sides of equal length. Scalene: It's a triangle with sides of differ..

[hackerrank] Prepare > SQL > Advanced Select > Binary Tree Nodes [문제] 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. In..

[hackerrank] Prepare > SQL > Basic Select > Employee Salaries [문제] Write a query that prints a list of employee names (i.e.: the name attribute) for employees in Employee having a salary greater than per month who have been employees for less than months. Sort your result by ascending employee_id. Input Format The Employee table containing employee data for a company is described as follows: whe..

[hackerrank] Prepare > SQL > Basic Select > Higher Than 75 Marks [문제] Query the Name of any student in STUDENTS who scored higher than Marks. Order your output by the last three characters of each name. If two or more students both have names ending in the same last three characters (i.e.: Bobby, Robby, etc.), secondary sort them by ascending ID. Input Format The STUDENTS table is described as f..

[hackerrank] Prepare > SQL > Basic Select > Weather Observation Station 12 [문제] Query the list of CITY names from STATION that do not start with vowels and do not end with vowels. Your result cannot contain duplicates. Input Format The STATION table is described as follows: where LAT_N is the northern latitude and LONG_W is the western longitude. [MYSQL] [ORCALE] select distinct(city) from stati..

[hackerrank] Prepare > SQL > Basic Select > Weather Observation Station 11 [문제] [MYSQL] [ORCALE] select distinct(city) from station where not regexp_like(city,'^a|^e|^o|^u|^i','i') or not regexp_like(city,'a$|e$|o$|u$|i$','i');

[hackerrank] Prepare > SQL > Basic Select > Weather Observation Station 10 [문제] Query the list of CITY names from STATION that do not end with vowels. Your result cannot contain duplicates. Input Format The STATION table is described as follows: where LAT_N is the northern latitude and LONG_W is the western longitude. [MYSQL] [ORCALE] select distinct(city) from station where not regexp_like(city..

[hackerrank] Prepare > SQL > Basic Select > Weather Observation Station 9 [문제] Query the list of CITY names from STATION that do not start with vowels. Your result cannot contain duplicates. Input Format The STATION table is described as follows: where LAT_N is the northern latitude and LONG_W is the western longitude. [MYSQL] [ORCALE] select distinct(city) from station where not regexp_like(cit..