1200. Minimum Absolute Difference - Easy 문제 Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements. Return a list of pairs...
LeetCode - 1629. Slowest Key
1629. Slowest Key - Easy 문제 A newly designed keypad was tested, where a tester pressed a sequence of n keys, one at a time. You are given a string keysPressed of length n, where keysPressed[i]...
LeetCode - 228. Summary Ranges
228. Summary Ranges - Easy 문제 You are given a sorted unique integer array nums. Return the smallest sorted list of ranges that cover all the numbers in the array exactly. That is, each element...
LeetCode - 500. Keyboard Row
500. Keyboard Row - Easy 문제 Given an array of strings words, return the words that can be typed using letters of the alphabet on only one row of American keyboard like the image below. In the ...
LeetCode - 565. Array Nesting
565. Array Nesting - Mediaum 문제 You are given an integer array nums of length n where nums is a permutation of the numbers in the range [0, n - 1]. You should build a set s[k] = {nums[k], nums...
LeetCode - 496. Next Greater Element I
496. Next Greater Element I - Easy 문제 The next greater element of some element x in an array is the first greater element that is to the right of x in the same array. You are given two distinc...
LeetCode - 111. Minimum Depth of Binary Tree
111. Minimum Depth of Binary Tree - Easy 문제 Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest...
LeetCode - 144. Binary Tree Preorder Traversal
144. Binary Tree Preorder Traversal - Easy 문제 Given the root of a binary tree, return the preorder traversal of its nodes’ values. 제한사항 The number of nodes in the tree is in the range [0, ...
LeetCode - 145. Binary Tree Postorder Traversal
145. Binary Tree Postorder Traversal - Easy 문제 Given the root of a binary tree, return the postorder traversal of its nodes’ values. 제한사항 The number of the nodes in the tree is in the rang...
LeetCode - 119. Pascal's Triangle II
119. Pascal’s Triangle II - Easy 문제 Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal’s triangle. In Pascal’s triangle, each number is the sum of the two numbers d...