Apes Together Strong.

https://leetcode.com/problems/asteroid-collision/description Asteroid Collision - LeetCode Can you solve this real interview question? Asteroid Collision - We are given an array asteroids of integers representing asteroids in a row. For each asteroid, the absolute value represents its size, and the sign represents its direction (positive meaning leetcode.com Q. input array ast에서 각 값은 운석의 크기를, 부호..

https://leetcode.com/problems/removing-stars-from-a-string/description Removing Stars From a String - LeetCode Can you solve this real interview question? Removing Stars From a String - You are given a string s, which contains stars *. In one operation, you can: * Choose a star in s. * Remove the closest non-star character to its left, as well as remove the star it leetcode.com Q. input string s..

https://leetcode.com/problems/equal-row-and-column-pairs/description Equal Row and Column Pairs - LeetCode Can you solve this real interview question? Equal Row and Column Pairs - Given a 0-indexed n x n integer matrix grid, return the number of pairs (ri, cj) such that row ri and column cj are equal. A row and column pair is considered equal if they contain th leetcode.com Q. 해당 모든 행의 값들 순서와 해당..

https://leetcode.com/problems/determine-if-two-strings-are-close/description Determine if Two Strings Are Close - LeetCode Can you solve this real interview question? Determine if Two Strings Are Close - Two strings are considered close if you can attain one from the other using the following operations: * Operation 1: Swap any two existing characters. * For example, abcde -> leetcode.com Q. 두 문..

https://leetcode.com/problems/unique-number-of-occurrences/description Unique Number of Occurrences - LeetCode Can you solve this real interview question? Unique Number of Occurrences - Given an array of integers arr, return true if the number of occurrences of each value in the array is unique or false otherwise. Example 1: Input: arr = [1,2,2,1,1,3] Output: tr leetcode.com Q. 주어진 정수배열 arr에서 각 ..

https://leetcode.com/problems/find-the-difference-of-two-arrays/description Find the Difference of Two Arrays - LeetCode Can you solve this real interview question? Find the Difference of Two Arrays - Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where: * answer[0] is a list of all distinct integers in nums1 which are not present in nums2 leetcode.com Q. 주어진 ..

https://leetcode.com/problems/find-pivot-index/description Find Pivot Index - LeetCode Can you solve this real interview question? Find Pivot Index - Given an array of integers nums, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of leetcode.com Q. 특정 index를 기준으로, 우측과 좌측의 합이 같다면, 이 index..

https://leetcode.com/problems/find-the-highest-altitude/solutions Find the Highest Altitude - LeetCode Can you solve this real interview question? Find the Highest Altitude - There is a biker going on a road trip. The road trip consists of n + 1 points at different altitudes. The biker starts his trip on point 0 with altitude equal 0. You are given an integ leetcode.com Q. 입력된 배열은 해당 위치에서 이전 위치까..

https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element/description Longest Subarray of 1's After Deleting One Element - LeetCode Can you solve this real interview question? Longest Subarray of 1's After Deleting One Element - Given a binary array nums, you should delete one element from it. Return the size of the longest non-empty subarray containing only 1's in the resu..

https://leetcode.com/problems/max-consecutive-ones-iii/description Max Consecutive Ones III - LeetCode Can you solve this real interview question? Max Consecutive Ones III - Given a binary array nums and an integer k, return the maximum number of consecutive 1's in the array if you can flip at most k 0's. Example 1: Input: nums = [1,1,1,0,0,0,1,1,1,1,0], leetcode.com Q. 0과 1로 구성된 주어진 배열 nums와 정수..