코딩92 CodeSignal [38/60] growingPlant Problem: Caring for a plant can be hard work, but since you tend to it regularly, you have a plant that grows consistently. Each day, its height increases by a fixed amount represented by the integer upSpeed. But due to lack of sunlight, the plant decreases in height every night, by an amount represented by downSpeed. Since you grew the plant from a seed, it started at height 0 initially. Given .. 2020. 5. 25. LeetCode 242. Valid Anagram Problem: Given two strings s and t , write a function to determine if t is an anagram of s. Example 1: Input: s = "anagram", t = "nagaram" Output: true Example 2: Input: s = "rat", t = "car" Output: false Note: You may assume the string contains only lowercase alphabets. -Summary- 1. Create two python dictionary to count each character in the string 's' and 't'. 2. If two dictionary is the same .. 2020. 5. 25. LeetCode 387. First Unique Character in a String Problem: Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: s = "leetcode" return 0. s = "loveleetcode", return 2. -Summary- 1. Create a dictionary to save each character count in 's' 2. Using for loop, if we find any index of character's count is 1, then we return the index value. (After loop is done, if answer not found.. 2020. 5. 25. CodeSignal [37/60] arrayMaxConsecutiveSum Problem: Given array of integers, find the maximal possible sum of some of its k consecutive elements. Example For inputArray = [2, 3, 5, 1, 6] and k = 2, the output should be arrayMaxConsecutiveSum(inputArray, k) = 8. All possible sums of 2 consecutive elements are: 2 + 3 = 5; 3 + 5 = 8; 5 + 1 = 6; 1 + 6 = 7. Thus, the answer is 8. -Summary- 1. Set the max_sum as first k consecutive sum from th.. 2020. 5. 25. CodeSignal [36/60] differentSymbolsNaive Problem: Given a string, find the number of different characters in it. Example For s = "cabca", the output should be differentSymbolsNaive(s) = 3. There are 3 different characters a, b and c. -Summary- 1. Create a temporary set variable to not have a duplicate value 2. Using for loop, if the character is already in the set, we skip and continue. If the first character faced, we add in to set an.. 2020. 5. 25. LeetCode 7. Reverse Integer Problem: Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: 123 Output: 321 Example 2: Input: -123 Output: -321 Example 3: Input: 120 Output: 21 -Summary- 1. Typecast the integer 'x' to the string 'x' to make iterable. 2. Create a 'res' variable to iterate each number in x and keep adding into it. (Used res = res*10 + x[i]) 3. if the character is '-' then we multiply .. 2020. 5. 25. 이전 1 ··· 11 12 13 14 15 16 다음
