Apes Together Strong.

https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/description Maximum Number of Vowels in a Substring of Given Length - LeetCode Can you solve this real interview question? Maximum Number of Vowels in a Substring of Given Length - Given a string s and an integer k, return the maximum number of vowel letters in any substring of s with length k. Vowel letters in..

https://leetcode.com/problems/maximum-average-subarray-i/description Maximum Average Subarray I - LeetCode Can you solve this real interview question? Maximum Average Subarray I - You are given an integer array nums consisting of n elements, and an integer k. Find a contiguous subarray whose length is equal to k that has the maximum average value and return thi leetcode.com Q. 연속된 sub array의 길이가..

https://leetcode.com/problems/max-number-of-k-sum-pairs/description Max Number of K-Sum Pairs - LeetCode Can you solve this real interview question? Max Number of K-Sum Pairs - You are given an integer array nums and an integer k. In one operation, you can pick two numbers from the array whose sum equals k and remove them from the array. Return the maximum nu leetcode.com Q. 배열에서 두 수의 합이 sum이 되면..

https://leetcode.com/problems/container-with-most-water/description Container With Most Water - LeetCode Can you solve this real interview question? Container With Most Water - You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that toget leetcode.com Q. height 배열이 각 벽의 높이를 ..

https://leetcode.com/problems/is-subsequence Is Subsequence - LeetCode Can you solve this real interview question? Is Subsequence - Given two strings s and t, return true if s is a subsequence of t, or false otherwise. A subsequence of a string is a new string that is formed from the original string by deleting some (can be n leetcode.com Q. 입력문자 t의 일부만 제거하되, 순서 변경없이 입력문자 s를 구성할수 있는지 여부를 반환하라. S..

https://leetcode.com/problems/move-zeroes Move Zeroes - LeetCode Can you solve this real interview question? Move Zeroes - Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements. Note that you must do this in-place without making a copy of the array. E leetcode.com Q. 배열에 등장하는 0을 모두 뒤로 옮기도록 배열을 재 구성하라. 우선 직관적으로 0이 등장하면, 뒤로 옮기고, 0이..

https://leetcode.com/problems/string-compression String Compression - LeetCode Can you solve this real interview question? String Compression - Given an array of characters chars, compress it using the following algorithm: Begin with an empty string s. For each group of consecutive repeating characters in chars: * If the group's leng leetcode.com Q. 입력캐릭터를 다음과 같은 조건에 기반하여 압축하라. - 문자를 출력하고 다음에 해당..

https://leetcode.com/problems/increasing-triplet-subsequence Increasing Triplet Subsequence - LeetCode Can you solve this real interview question? Increasing Triplet Subsequence - Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i < j < k and nums[i] < nums[j] < nums[k]. If no such indices exists, return false leetcode.com Q. 증가하는 3개의 index와 그 값이 오..

https://leetcode.com/problems/product-of-array-except-self Product of Array Except Self - LeetCode Can you solve this real interview question? Product of Array Except Self - Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nu leetcode.com Q. 입력 array nums가 있을때, 이 arra..

https://leetcode.com/problems/reverse-words-in-a-string Reverse Words in a String - LeetCode Can you solve this real interview question? Reverse Words in a String - Given an input string s, reverse the order of the words. A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space. Return a strin leetcode.com Q. s는 space와 space가 아닌 문자, 즉 단어들의 집..