부부의 코딩 성장 일기

1. 문제 링크 https://leetcode.com/problems/move-zeroes/description/ Move Zeroes - LeetCode Can you solve this real interview question? Move Zeroes - 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 2. 문제 설명 정수로 구성된 array nums가 있을 때, 값이 0인 elements를 뒤로 옮기기. (그 외의 elements들은 상대적 순서를 유지해야 한다.) 여기서 ..

1. 문제 링크 https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/description/ 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 2. 문제 설명 아래 형태의 binary tree가 주어졌을 때 struct Node { int val; Node *left; Node ..

1. 문제 링크 https://leetcode.com/problems/missing-number/description/ 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 2. 문제 설명 range[0,n] 사이의 숫자를 중복없이 포함하고 있는 nums라는 array가 주어졌을 때, range[0,n] 범위 해당 array에 빠진 숫자가 1개 있다고 할 때, 그 ..

1. 문제 링크 https://leetcode.com/problems/path-sum-ii/description/ 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 2. 문제 설명 이진트리의 root와 targetSum이라는 정수가 주어졌을 때, 각 노드의 합이 targetSum과 같으면서 root-to-leaf로 가는 모든 path를 구해서 list에 저장하여..

1. 문제 링크 https://leetcode.com/problems/binary-tree-level-order-traversal-ii/description/ 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 2. 문제 설명 이진트리의 root가 주어졌을 때, bottom-up level order traversal을 반환 여기서 bottom-up leverl ..

1. 문제 링크 https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ 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 2. 문제 설명 preorder, inorder에 대한 array가 주어졌을 때, 여기서 preorder는 이진트리의 preorder tr..

1. 문제 링크 Ugly Number - LeetCode Ugly Number - LeetCode Can you solve this real interview question? Ugly Number - An ugly number is a positive integer whose prime factors are limited to 2, 3, and 5. Given an integer n, return true if n is an ugly number. Example 1: Input: n = 6 Output: true Explanation: 6 = leetcode.com 2. 문제 설명 주어진 숫자가 Ugly Number인지 판별하는 문제 Ugly Number란 오직 2, 3, 5 세 소수의 곱으로만 이루어..

1. 문제 링크 https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ 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 2. 문제 설명 binary tree의 root가 주어졌을 때, level 별로 zigzag 순서로 nodes의 값을 적재하여 반환 level 0에서 왼쪽 → 오른쪽으로..