leetcode

⭐️ 난이도 Easy ⭐️ 문제 https://leetcode.com/problems/merge-two-binary-trees/ Merge Two Binary Trees - LeetCode 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 You are given two binary trees root1 and root2. 이진 트리 root1과 root2가 주어진다. Imagine that when you put one of them to cover the other, some ..

⭐️ 난이도 Medium ⭐️ 문제 https://leetcode.com/problems/permutation-in-string/ Permutation in String - LeetCode 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 Given two strings s1 and s2, return true if s2 contains a permutation of s1, or false otherwise. 두 개의 string s1과 s2가 주어졌을 때, s2가 s1의 순열을 ..

⭐️ 난이도 Medium ⭐️ 문제 https://leetcode.com/problems/remove-nth-node-from-end-of-list/ Remove Nth Node From End of List - LeetCode 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 Given the head of a linked list, remove the nth node from the end of the list and return its head. Linked list의 hea..

⭐️ 난이도 Easy ⭐️ 문제 https://leetcode.com/problems/move-zeroes/ Move Zeroes - LeetCode 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 Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. 정수형 배열 nums가 주어졌을 때, 0이 아닌 원소들의 상대적인 ..

⭐️ 난이도 Medium ⭐️ 문제 https://leetcode.com/problems/delete-and-earn/ Delete and Earn - LeetCode 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 정수형 배열 nums가 주어진다. 주어진 연산(operation)을 여러 번 실행하여 얻을 수 있는 포인트를 최대로 하려고 한다. [연산(operation)] 1) 아무 nums[i]를 고르고 지우면, nums[i]만큼의 포인트를 얻을 수 있다. 2) 이후에는 num..

⭐️ 난이도 Medium ⭐️ 문제 https://leetcode.com/problems/house-robber-ii/ House Robber II - LeetCode 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 당신은 거리에 있는 집들을 따라서 도둑질 할 계획을 세우고 있는 프로 도둑이다. 각 집마다 일정한 양의 돈이 있다. 모든 집은 원의 형태를 띄고 있다. 즉, 첫 번째 집의 이웃은 마지막 집이다. 인접한 집에는 모두 경비 시스템이 연결되어 있는데, 만일 인접한 두 집이..