분류 전체보기93 [Leetcode/JS] 350. Intersection of Two Arrays II 문제링크 350. Intersection of Two Arrays II https://leetcode.com/problems/intersection-of-two-arrays-ii/description/ Intersection of Two Arrays II - LeetCode Can you solve this real interview question? Intersection of Two Arrays II - Given two integer arrays nums1 and nums2, return an array of their intersection. Each element in the result must appear as many times as it shows in both arrays and you.. 2023. 7. 18. [Leetcode/JS] 226. Invert Binary Tree 문제링크 226. Invert Binary Tree https://leetcode.com/problems/invert-binary-tree/description/ Invert Binary Tree - LeetCode Can you solve this real interview question? Invert Binary Tree - Given the root of a binary tree, invert the tree, and return its root. Example 1: [https://assets.leetcode.com/uploads/2021/03/14/invert1-tree.jpg] Input: root = [4,2,7,1,3,6,9] Output: [4 leetcode.com 문제 설명 Give.. 2023. 7. 18. [Leetcode/JS] 257. Binary Tree Paths 문제링크 https://leetcode.com/problems/binary-tree-paths/ Binary Tree Paths - LeetCode Can you solve this real interview question? Binary Tree Paths - Given the root of a binary tree, return all root-to-leaf paths in any order. A leaf is a node with no children. Example 1: [https://assets.leetcode.com/uploads/2021/03/12/paths-tree.jpg] In leetcode.com 기억하면 좋을 것 JavaScript에서 배열을 새로운 변수에 할당하는 경우 새로운 배.. 2023. 7. 17. [Leetcode/JS] 404. Sum of Left Leaves 문제링크 404. Sum of Left Leaves https://leetcode.com/problems/sum-of-left-leaves/description/ Sum of Left Leaves - LeetCode Can you solve this real interview question? Sum of Left Leaves - Given the root of a binary tree, return the sum of all left leaves. A leaf is a node with no children. A left leaf is a leaf that is the left child of another node. Example 1: [https://ass leetcode.com Given the .. 2023. 7. 17. 이전 1 ··· 3 4 5 6 7 8 9 ··· 24 다음
