전체 글 (2344) 썸네일형 리스트형 (SQL) - LeetCode (easy) 577. Employee Bonus https://leetcode.com/problems/employee-bonus/description/ Employee Bonus - LeetCode Can you solve this real interview question? Employee Bonus - 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 outer join을 사용해보는 문제였습니다. 📕 풀이방법 📔 풀이과정 1. 서로 다른 table인 Employee에서 Bonus table을 left outer join 해줍.. (C++) - LeetCode (easy) 575. Distribute Candies https://leetcode.com/problems/distribute-candies/description/ Distribute Candies - LeetCode Can you solve this real interview question? Distribute Candies - Alice has n candies, where the ith candy is of type candyType[i]. Alice noticed that she started to gain weight, so she visited a doctor. The doctor advised Alice to only eat n / 2 of the can leetcode.com 자료구조 map을 이요해 해결한 문제였습니다. 📕 풀이방법 📔 입.. (C++) - LeetCode (easy) 572. Subtree of Another Tree https://leetcode.com/problems/subtree-of-another-tree/description/ Subtree of Another Tree - LeetCode Can you solve this real interview question? Subtree of Another Tree - Given the roots of two binary trees root and subRoot, return true if there is a subtree of root with the same structure and node values of subRoot and false otherwise. A subtree of a bin leetcode.com tree 순회 문제였습니다. 📕 풀이방법 📔 풀.. (C++) - LeetCode (easy) 566. Reshape the Matrix https://leetcode.com/problems/reshape-the-matrix/description/ Reshape the Matrix - LeetCode Can you solve this real interview question? Reshape the Matrix - In MATLAB, there is a handy function called reshape which can reshape an m x n matrix into a new one with a different size r x c keeping its original data. You are given an m x n matrix mat a leetcode.com 2차원 vector를 다루는 구현 문제였습니다. 📕 풀이방법 📔 .. (C++) - LeetCode (easy) 563. Binary Tree Tilt https://leetcode.com/problems/binary-tree-tilt/description/ Binary Tree Tilt - LeetCode Can you solve this real interview question? Binary Tree Tilt - Given the root of a binary tree, return the sum of every tree node's tilt. The tilt of a tree node is the absolute difference between the sum of all left subtree node values and all right subtr leetcode.com 자료구조 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 왼쪽과 오른쪽 s.. (C++) - LeetCode (easy) 561. Array Partition https://leetcode.com/problems/array-partition/description/ Array Partition - LeetCode Can you solve this real interview question? Array Partition - Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), ..., (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum. leetcode.com 정렬 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 1. 오름차순으로 num.. (C++) - LeetCode (easy) 557. Reverse Words in a String III https://leetcode.com/problems/maximum-depth-of-n-ary-tree/description/ Maximum Depth of N-ary Tree - LeetCode Can you solve this real interview question? Maximum Depth of N-ary Tree - Given a n-ary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Nary-Tree input seriali leetcode.com 재귀적인 tree 순회로 해결한 .. (C++) - LeetCode (easy) 557. Reverse Words in a String III https://leetcode.com/problems/reverse-words-in-a-string-iii/description/ 이전 1 ··· 75 76 77 78 79 80 81 ··· 293 다음