노란 구슬 굽는 중

125. Valid PalindromeLeetCodehttps://leetcode.com/problems/valid-palindrome/description/ Valid Palindrome - LeetCodeCan you solve this real interview question? Valid Palindrome - A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric chaleetcode.comA phrase is a ..

200. Number of IslandsLeetCodehttps://leetcode.com/problems/number-of-islands/description/ Number of Islands - LeetCodeCan you solve this real interview question? Number of Islands - Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lleetcode.com Given an m..

226. Invert Binary TreeLeetCodehttps://leetcode.com/problems/invert-binary-tree/description/ Invert Binary Tree - LeetCodeCan 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: [4leetcode.com Given th..

242. Valid AnagramLeetCodehttps://leetcode.com/problems/valid-anagram/description/ Valid Anagram - LeetCodeCan you solve this real interview question? Valid Anagram - Given two strings s and t, return true if t is an anagram of s, and false otherwise. Example 1: Input: s = "anagram", t = "nagaram" Output: true Example 2: Input: s = "rat", t = "car" Output: fleetcode.com Given two strings s and..

56. Merge IntervalsLeetCodehttps://leetcode.com/problems/merge-intervals/description/ Merge Intervals - LeetCodeCan you solve this real interview question? Merge Intervals - Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the inputleetcode.com Given an array of i..

268. Missing NumberLeetCodehttps://leetcode.com/problems/missing-number/description/ Missing Number - LeetCodeCan you solve this real interview question? Missing Number - Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array. Example 1: Input: nums = [3,0,1] Output: 2 Explanatioleetcode.com Given an array nums ..

100. Same TreeLeetCodehttps://leetcode.com/problems/same-tree/description/ Same Tree - LeetCodeCan you solve this real interview question? Same Tree - Given the roots of two binary trees p and q, write a function to check if they are the same or not. Two binary trees are considered the same if they are structurally identical, and the nodes have theleetcode.com Given the roots of two binary trees..

53. Maximum SubarrayLeetCodehttps://leetcode.com/problems/maximum-subarray/description/ Maximum Subarray - LeetCodeCan you solve this real interview question? Maximum Subarray - Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1] has tleetcode.com Given an intege..

2574. Left and Right Sum DifferencesLeetCodehttps://leetcode.com/problems/left-and-right-sum-differences/description/ Left and Right Sum Differences - LeetCodeCan you solve this real interview question? Left and Right Sum Differences - You are given a 0-indexed integer array nums of size n. Define two arrays leftSum and rightSum where: * leftSum[i] is the sum of elements to the left of the index..

1480. Running Sum of 1d ArrayLeetCodehttps://leetcode.com/problems/running-sum-of-1d-array/ Running Sum of 1d Array - LeetCodeCan you solve this real interview question? Running Sum of 1d Array - Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums = [1,2,3,4] Output: [1,3,6,leetcode.com Given a..