Apes Together Strong.

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/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가 아닌 문자, 즉 단어들의 집..

https://leetcode.com/problems/reverse-vowels-of-a-string Reverse Vowels of a String - LeetCode Can you solve this real interview question? 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 onc leetcode.com Q. input string s를 입력으로 받을때, 모음문자..

https://leetcode.com/problems/can-place-flowers Can Place Flowers - LeetCode Can you solve this real interview question? Can Place Flowers - You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. Given an integer array flowerbed containing 0's and 1' leetcode.com Q. 각 자리가 1일때 flow가 planted되어 있고, 0이면 그렇지 않다. flower..

https://leetcode.com/problems/kids-with-the-greatest-number-of-candies Kids With the Greatest Number of Candies - LeetCode Can you solve this real interview question? Kids With the Greatest Number of Candies - There are n kids with candies. You are given an integer array candies, where each candies[i] represents the number of candies the ith kid has, and an integer extraCandie leetcode.com Q. 배열..

Q. word1과 word2를 하나 씩 merge하라. 문제 그대로 연산하여 merge하면 됨. string mergeAlternately(string word1, string word2) { int p1 = 0, p2 = 0; string ret = ""; while (p1 < word1.length() || p2 < word2.length()) { if (p1 < word1.length()) ret += word1.at(p1++); if (p2 < word2.length()) ret += word2.at(p2++); } return ret; } Key : 사고과정을 플밍 구현으로 실현 여부 테스팅. Comment : 그냥 프로그램 단순 능력 테스팅.... 리트코드에 잘 없는 함정없이 쉬운 문제.

https://leetcode.com/problems/greatest-common-divisor-of-strings/description/?envType=study-plan-v2&envId=leetcode-75 Greatest Common Divisor of Strings - LeetCode Can you solve this real interview question? Greatest Common Divisor of Strings - For two strings s and t, we say "t divides s" if and only if s = t + ... + t (i.e., t is concatenated with itself one or more times). Given two strings s..