코딩92 CodeSignal [35/60] firstDigit Problem: Find the leftmost digit that occurs in a given string. Example For inputString = "var_1__Int", the output should be firstDigit(inputString) = '1'; For inputString = "q2q-q", the output should be firstDigit(inputString) = '2'; For inputString = "0ss", the output should be firstDigit(inputString) = '0'. -Summary- 1. isdigit() 함수를 이용하여 char 하나하나 비교후, if we found a 'True' value, then we ret.. 2020. 5. 25. CodeSignal [34/60] extractEachKth Problem: Given array of integers, remove each kth element from it. Example For inputArray = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] and k = 3, the output should be extractEachKth(inputArray, k) = [1, 2, 4, 5, 7, 8, 10]. -Summary- 1. Create a 'ans' list for answer list 2. While loop을 돌리면서 index 가 지워지는 번호에 해당하지 않는경우 ans list에 넣어준다. 3. loop을 다 돌리면 지워지는 Kth index element만 지워진 'ans' list값을 return. Additional.. 2020. 5. 24. LeetCode 350. Intersection of Two Arrays II Problem: Given two arrays, write a function to compute their intersection. Example 1: Input: nums1 = [1,2,2,1], nums2 = [2,2] Output: [2,2] Example 2: Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4] Output: [4,9] -Summary- Using the dictionary 1. Create a dictionary to hold an all numbers as a 'key' in the first nums1 list (Count +1 for each key) 2. Loop the second nums2 list and only append to answ.. 2020. 5. 24. LeetCode 136. Single Number Problem Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory? Example 1: Input: [2,2,1] Output: 1 Example 2: Input: [4,1,2,1,2] Output: 4 -Summary- #By using bit manipulation (no extra memory) 1. for each num in the nums list, do XOR bi.. 2020. 5. 23. LeetCode 217. Contains Duplicate Problem Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct. Example 1: Input: [1,2,3,1] Output: true Example 2: Input: [1,2,3,4] Output: false Example 3: Input: [1,1,1,3,3,4,3,2,4,2] Output: true -Summary- 1. Compare the length of the orig.. 2020. 5. 23. LeetCode 122. Best Time to Buy and Sell Stock II Problem Say you have an array prices for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times). Note: You may not engage in multiple transactions at the same time (i.e., you must sell the stock before you buy again). Example 1: I.. 2020. 5. 23. 이전 1 ··· 12 13 14 15 16 다음
