22. You are given an array of integers representing coordinates of obstacles situated on a straight line. Assume that you are jumping from the point with coordinate 0 to the right. You are allowed only to make jumps of the same length represented by some integer. Find the minimal length of the jump enough to avoid all the obstacles. [Example] [Solution] - ing # def avoidObstacles(inputArray): a ..

19. Call two arms equally strong if the heaviest weights they each are able to lift are equal. Call two people equally strong if their strongest arms are equally strong (the strongest arm can be both the right and the left), and so are their weakest arms. Given your and your friend's arms' lifting capabilities find out if you two are equally strong. [Example] For yourLeft = 10, yourRight = 15, f..

16. Two arrays are called similar if one can be obtained from another by swapping at most one pair of elements in one of the arrays. Given two arrays a and b, check whether they are similar. [Example] For a = [1, 2, 3] and b = [1, 2, 3], the output should be areSimilar(a, b) = true. The arrays are equal, no need to swap any elements. For a = [1, 2, 3] and b = [2, 1, 3], the output should be areS..

13. Write a function that reverses characters in (possibly nested) parentheses in the input string. Input strings will always be well-formed with matching ()s. [Example] For inputString = "(bar)", the output should be reverseInParentheses(inputString) = "rab"; For inputString = "foo(bar)baz", the output should be reverseInParentheses(inputString) = "foorabbaz"; For inputString = "foo(bar)baz(bli..

[신경망의 수학적 구성 요소] - 목차 - 2.1 신경망과의 첫 만남 2.2 신경망을 위한 데이터 표현 2.3 신경망의 톱니바퀴: 텐서 연산 2.4 신경망의 엔진: 그래디언트 기반 최적화 2.5 첫 번째 예제 다시 살펴보기 2.6 요약 - 핵심 내용 - 첫 번째 신경망 예제 만들기 텐서와 텐서 연산의 개념 역전파와 경사 하강법을 사용하여 신경망이 학습되는 방법 필요한 수학적 개념 텐서, 텐서 연산, 미분 경사 하강법(Gradient descent) 등 하지만 이 장에서는 기술적으로 깊게 들어가지 않음 [2.1 신경망과의 첫 만남] 이 장에서는 케라스나 비슷한 라이브러리를 사용한 경험이 없다면 예제를 이해하지 못할 가능성이 높으므로 그냥 이런 것이 있다는 정도로만 알려주는 것 같다는 느낌이 들었습니다.(코..

10. Given two strings, find the number of common characters between them. [Example] For s1 = "aabcc" and s2 = "adcaa", the output should be commonCharacterCount(s1, s2) = 3. Strings have 3 common characters - 2 "a"s and 1 "c". [Solution] def commonCharacterCount(s1, s2): s1_digit = list(set(s1)) s2_digit = list(set(s2)) sum = 0 ch = "" for i in range(len(s1_digit)): if (s1_digit[i] in s2_digit):..