LeetCode 329

[LeetCode 75] Easy - 345. Reverse Vowels of a String

345. Reverse Vowels of a String Given a string s, reverse only all the vowels in the string and return it.The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in both lower and upper cases, more than once. Example 1:Input: s = "IceCreAm"Output: "AceCreIm"Explanation:The vowels in s are ['I', 'e', 'e', 'A']. On reversing the vowels, s becomes "AceCreIm".Example 2:Input: s = "leetcode"O..

LeetCode/LeetCode75 2024.11.11

[LeetCode 75] Medium - 1071. Greatest Common Divisor of Strings ☆

1071. Greatest Common Divisor of Strings For two strings s and t, we say "t divides s" if and only if s = t + t + t + ... + t + t (i.e., t is concatenated with itself one or more times).Given two strings str1 and str2, return the largest string x such that x divides both str1 and str2. Example 1:Input: str1 = "ABCABC", str2 = "ABC"Output: "ABC"Example 2:Input: str1 = "ABABAB", str2 = "ABAB"Outpu..

LeetCode/LeetCode75 2024.11.11

[LeetCode 75] Medium - 452. Minimum Number of Arrows to Burst Balloons

452. Minimum Number of Arrows to Burst Balloons There are some spherical balloons taped onto a flat wall that represents the XY-plane. The balloons are represented as a 2D integer array points where points[i] = [xstart, xend] denotes a balloon whose horizontal diameter stretches between xstart and xend. You do not know the exact y-coordinates of the balloons.Arrows can be shot up directly vertic..

LeetCode/공통 2024.11.10