전체 글 (2344) 썸네일형 리스트형 (C++) - LeetCode (easy) 599. Minimum Index Sum of Two Lists https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/ Minimum Index Sum of Two Lists - LeetCode Can you solve this real interview question? Minimum Index Sum of Two Lists - Given two arrays of strings list1 and list2, find the common strings with the least index sum. A common string is a string that appeared in both list1 and list2. A common string w leetcode.com 전수조사로 푼 문제였습.. (SQL) - LeetCode (easy) 596. Classes More Than 5 Students https://leetcode.com/problems/classes-more-than-5-students/description/ Classes More Than 5 Students - LeetCode Can you solve this real interview question? Classes More Than 5 Students - Table: Courses +-------------+---------+ | Column Name | Type | +-------------+---------+ | student | varchar | | class | varchar | +-------------+---------+ (student, class) is the leetcode.com group by ~ havin.. (SQL) - LeetCode (easy) 595. Big Countries https://leetcode.com/problems/big-countries/description/ Big Countries - LeetCode Can you solve this real interview question? Big Countries - Table: World +-------------+---------+ | Column Name | Type | +-------------+---------+ | name | varchar | | continent | varchar | | area | int | | population | int | | gdp | bigint | +----------- leetcode.com where을 사용해본 문제였습니다. 📕 풀이방법 📔 풀이과정 정해진 조건에 해당하는.. (C++) - LeetCode (easy) 594. Longest Harmonious Subsequence https://leetcode.com/problems/longest-harmonious-subsequence/description/ Longest Harmonious Subsequence - LeetCode Can you solve this real interview question? Longest Harmonious Subsequence - We define a harmonious array as an array where the difference between its maximum value and its minimum value is exactly 1. Given an integer array nums, return the length of its l leetcode.com 자료구조를 이용한 문제.. (C++) - LeetCode (easy) 590. N-ary Tree Postorder Traversal https://leetcode.com/problems/n-ary-tree-postorder-traversal/description/ N-ary Tree Postorder Traversal - LeetCode Can you solve this real interview question? N-ary Tree Postorder Traversal - Given the root of an n-ary tree, return the postorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order traversal. Each group of ch leetcode.com n진 tree의 후위순.. (C++) - LeetCode (easy) 589. N-ary Tree Preorder Traversal https://leetcode.com/problems/n-ary-tree-preorder-traversal/description/ N-ary Tree Preorder Traversal - LeetCode Can you solve this real interview question? N-ary Tree Preorder Traversal - Given the root of an n-ary tree, return the preorder traversal of its nodes' values. Nary-Tree input serialization is represented in their level order traversal. Each group of chil leetcode.com pre order를 다진 .. (SQL) - LeetCode (easy) 586. Customer Placing the Largest Number of Orders https://leetcode.com/problems/customer-placing-the-largest-number-of-orders/description/ Customer Placing the Largest Number of Orders - LeetCode Can you solve this real interview question? Customer Placing the Largest Number of Orders - Table: Orders +-----------------+----------+ | Column Name | Type | +-----------------+----------+ | order_number | int | | customer_number | int | +-----------.. (SQL) - LeetCode (easy) 584. Find Customer Referee https://leetcode.com/problems/find-customer-referee/description/ Find Customer Referee - LeetCode Can you solve this real interview question? Find Customer Referee - Table: Customer +-------------+---------+ | Column Name | Type | +-------------+---------+ | id | int | | name | varchar | | referee_id | int | +-------------+---------+ id is the primary leetcode.com select from where절을 사용해보는 기본 문제.. 이전 1 ··· 74 75 76 77 78 79 80 ··· 293 다음