Ollivander's Inventory Harry Potter and his friends are at Ollivander's with Ron, finally replacing Charlie's old broken wand. Hermione decides the best way to choose is by determining the minimum number of gold galleons needed to buy each non-evil wand of high power and age. Write a query to print the id, age, coins_needed, and power of the wands that Ron's interested in, sorted in order of des..
Julia just finished conducting a coding contest, and she needs your help assembling the leaderboard! Write a query to print the respective hacker_id and name of hackers who achieved full scores for more than one challenge. Order your output in descending order by the total number of challenges in which the hacker earned a full score. If more than one hacker received full scores in same number of..
You are given two tables: Students and Grades. Students contains three columns ID, Name and Marks. Grades contains the following data: Ketty gives Eve a task to generate a report containing three columns: Name, Grade and Mark. Ketty doesn't want the NAMES of those students who received a grade lower than 8. The report must be in descending order by grade -- i.e. higher grades are entered first. ..
Population Census Given the CITY and COUNTRY tables, query the sum of the populations of all cities where the CONTINENT is 'Asia'. Note: CITY.CountryCode and COUNTRY.Code are matching key columns. Input Format The CITY and COUNTRY tables are described as follows: SELECT SUM(A.population) FROM CITY A JOIN COUNTRY B ON A.CountryCode = B.Code WHERE B.CONTINENT = 'Asia'; African Cities Given the CIT..
- Total
- Today
- Yesterday
- 경구치료제
- tensorflow
- list
- MSSQL
- mysql
- 에코캡
- python3
- TSQL
- python
- MS SQL Server
- 해커랭크
- 매매일지
- 넥스트BT
- SQL Server
- Tableau
- 테슬라
- 분석탭
- Weather Observation Station
- hackerrank
- DATABASE
- 리비안
- 대원화성
- 동국알앤에스
- 코로나19
- 몰누피라비르
- 미중무역전쟁
- insert
- 넷플릭스
- string
- HK이노엔
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 | 31 |