avatar
Articles
117
Tags
37
Categories
13
Home
About
Tech
Showcase
Resume
Danny's BlogCoding_Quiz_SQL_1 Back to Home
Home
About
Tech
Showcase
Resume

Coding_Quiz_SQL_1

Created2025-09-17|Updated2025-11-20|DEVCODING_QUIZ_SQL
|Post Views:
Author: Danny Ki
Link: https://kish191919.github.io/2025/09/17/Coding-Quiz-SQL-1/
Copyright Notice: All articles on this blog are licensed under CC BY-NC-SA 4.0 unless otherwise stated.
LEETCODESQL
Previous
TERADATA(1)-Overview of Teradata Studio Modules
๐Ÿ“˜ Teradata Studio ๊ธฐ๋ณธ ํ™”๋ฉด ์ดํ•ดํ•˜๊ธฐ๊ธฐ์ดˆ UI ์„ค๋ช… + SQL ์‹คํ–‰ ๋ฐฉ๋ฒ• + ํŠธ๋žœ์žญ์…˜ ๋ชจ๋“œ ๊ฐœ๋… ๐Ÿ“ 1. Teradata Studio ์ฒซ ํ™”๋ฉด ๊ตฌ์„ฑTeradata Studio๋ฅผ ์‹คํ–‰ํ•˜๋ฉด ๋‹ค์Œ๊ณผ ๊ฐ™์€ ์ฃผ์š” ์˜์—ญ์„ ๋ณด๊ฒŒ ๋ฉ๋‹ˆ๋‹ค. ๐Ÿ”น 1) ์ƒ๋‹จ ๋ฉ”๋‰ด(File / Edit / Window ๋“ฑ)์ผ๋ฐ˜์ ์ธ ํŒŒ์ผ ๊ด€๋ฆฌ, ๋ณด๊ธฐ ์„ค์ •, ํ™˜๊ฒฝ์„ค์ • ๋ณ€๊ฒฝ ๋“ฑ์„ ์ˆ˜ํ–‰ํ•ฉ๋‹ˆ๋‹ค. ๐Ÿ”น 2) Studio Toolbar์ฟผ๋ฆฌ ์‹คํ–‰, ์ €์žฅ, ์ƒˆ ์—ฐ๊ฒฐ ์ƒ์„ฑ ๋“ฑ ์ž์ฃผ ์‚ฌ์šฉํ•˜๋Š” ๊ธฐ๋Šฅ ์•„์ด์ฝ˜๋“ค์ด ์œ„์น˜ํ•ฉ๋‹ˆ๋‹ค. ๐Ÿ”น 3) Data Source Explorer (์ขŒ์ธก ์˜์—ญ)Teradata์— ์—ฐ๊ฒฐ๋œ ๋ฐ์ดํ„ฐ๋ฒ ์ด์Šค / ์œ ์ € / ํ…Œ์ด๋ธ” / ๋ทฐ ๋“ฑ์„ ํƒ์ƒ‰ํ•  ์ˆ˜ ์žˆ๋Š” ๊ฐ€์žฅ ์ค‘์š”ํ•œ ํŒจ๋„์ž…๋‹ˆ๋‹ค. ๐Ÿ”น 4) Project ExplorerSQL ํŒŒ์ผ์ด๋‚˜ ํ”„๋กœ์ ํŠธ๋ฅผ ๋กœ์ปฌ์— ์ €์žฅํ•˜์—ฌ ๊ด€๋ฆฌํ•  ๋•Œ ์‚ฌ์šฉํ•ฉ๋‹ˆ๋‹ค. ๐Ÿ”น 5) SQL Editor (์ค‘์•™ ์ƒ๋‹จ)SQL์„ ์ž‘์„ฑํ•˜๋Š” ๊ณต๊ฐ„์ž…๋‹ˆ๋‹ค.์˜ˆ: 1...
Next
Coding_Quiz_Python_1
1. Two SumLink : https://leetcode.com/problems/two-sum/description/?difficulty=EASY Hash Map (๋”•์…”๋„ˆ๋ฆฌ ์ด์šฉ)๋ณด์กฐ ๊ณต๊ฐ„์„ ์ด์šฉํ•ด ๋น ๋ฅด๊ฒŒ ์ฐจ์ด๋ฅผ ์ฐพ๋Š” ๋ฐฉ์‹. ์‹œ๊ฐ„ ๋ณต์žก๋„: O(n) ๊ณต๊ฐ„ ๋ณต์žก๋„: O(n) 1234567891011class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: num_map = {} for index, num in enumerate(nums): diff = target - num if diff in num_map: return [num_map[diff], index] num_map[num] = index Sorting + Two Pointers...
Related Articles
2025-09-17
Coding_Quiz_Python_1
1. Two SumLink : https://leetcode.com/problems/two-sum/description/?difficulty=EASY Hash Map (๋”•์…”๋„ˆ๋ฆฌ ์ด์šฉ)๋ณด์กฐ ๊ณต๊ฐ„์„ ์ด์šฉํ•ด ๋น ๋ฅด๊ฒŒ ์ฐจ์ด๋ฅผ ์ฐพ๋Š” ๋ฐฉ์‹. ์‹œ๊ฐ„ ๋ณต์žก๋„: O(n) ๊ณต๊ฐ„ ๋ณต์žก๋„: O(n) 1234567891011class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: num_map = {} for index, num in enumerate(nums): diff = target - num if diff in num_map: return [num_map[diff], index] num_map[num] = index Sorting + Two Pointers...
avatar
Danny Ki
A data engineer's journey in coding, analytics, and building real-world systems.
Articles
117
Tags
37
Categories
13
Follow Me
Announcement
This is my Blog
Recent Posts
DATABRICKS-Certified-Developer-62025-12-18
DATABRICKS-Certified-Developer-52025-12-18
DATABRICKS-Certified-Developer-42025-12-18
DATABRICKS-Certified-Developer-32025-12-18
DATABRICKS-Certified-Developer-22025-12-18
© 2025 By Danny KiFramework Hexo 7.3.0|Theme Butterfly 5.4.3