몰입공간

#1. 문제 https://leetcode.com/problems/zigzag-conversion/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 문자열 s를 주어진 정수 값 numRows의 row 수로 다음과 같이 지그재그 패턴으로 나타낼 수 있을 때, P A H N A P L S I I G Y I R 라인별로 문자열을 재조합하는 문제 Input: s = ..

#1. 문제 https://leetcode.com/problems/clone-graph/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 말 그대로 복사된 클론 그래프를 도출하는 문제 Input: adjList = [[2,4],[1,3],[2,4],[1,3]] Output: [[2,4],[1,3],[2,4],[1,3]] Explanation: There are..

#1. 문제 https://leetcode.com/problems/average-of-levels-in-binary-tree/ Average of Levels in Binary Tree - LeetCode Can you solve this real interview question? Average of Levels in Binary Tree - Given the root of a binary tree, return the average value of the nodes on each level in the form of an array. Answers within 10-5 of the actual answer will be accepted. Examp leetcode.com 이진 트리가 주어질 때, 각 ..

#1. 문제 https://leetcode.com/problems/binary-tree-right-side-view/ Binary Tree Right Side View - LeetCode Can you solve this real interview question? Binary Tree Right Side View - Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 1: [https://asse leetcode.com 이진 탐색 트리가 주어질 때, 트리의 오른쪽에서..

#1. 문제 https://leetcode.com/problems/kth-smallest-element-in-a-bst Kth Smallest Element in a BST - LeetCode Can you solve this real interview question? Kth Smallest Element in a BST - Given the root of a binary search tree, and an integer k, return the kth smallest value (1-indexed) of all the values of the nodes in the tree. Example 1: [https://assets.leetco leetcode.com 이진 탐색 트리가 주어질 때, k 번째 작..

#1. 문제 https://leetcode.com/problems/minimum-absolute-difference-in-bst/ Minimum Absolute Difference in BST - LeetCode Can you solve this real interview question? Minimum Absolute Difference in BST - Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree. Example 1: [https://assets.l leetcode.com 이진 탐색 트리가 주어..

#1. 문제 https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ Find Minimum in Rotated Sorted Array - LeetCode Can you solve this real interview question? Find Minimum in Rotated Sorted Array - Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: * [4,5,6,7,0,1,2] if it leetcode.com 정렬된 정수..

#1. 문제 https://leetcode.com/problems/find-peak-element/ Find Peak Element - LeetCode Can you solve this real interview question? Find Peak Element - A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, leetcode.com 정수 배열 nums가 주어질 때 인접 요소보다 더 큰 peak 요소를 찾는 문..

#1. 문제 https://leetcode.com/problems/sort-list/ Sort List - LeetCode Can you solve this real interview question? Sort List - Given the head of a linked list, return the list after sorting it in ascending order. Example 1: [https://assets.leetcode.com/uploads/2020/09/14/sort_list_1.jpg] Input: head = [4,2,1,3] Output: [1, leetcode.com 주어진 연결 리스트를 정렬 상태로 반환하는 문제 Input: head = [-1, 5, 3, 4, 1] Outp..

#1. 문제 https://leetcode.com/problems/ransom-note/ Ransom Note - LeetCode Can you solve this real interview question? Ransom Note - Given two strings ransomNote and magazine, return true if ransomNote can be constructed by using the letters from magazine and false otherwise. Each letter in magazine can only be used once in ranso leetcode.com 두 문자열 ransomeNote와 magazine이 주어질 때, magazine의 철자로 ranso..