일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | ||
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 |
- Big size image
- assignment1
- Backpropagation
- 회로
- backward pass
- KNN
- pulldown
- #9
- cs231n
- Softmax
- assignment
- error
- pullup
- Features
- leetcode
- softmax backpropagation
- neural net
- atmega128
- 풀업저항
- TensorFlow
- 풀다운저항
- NotFoundError
- pyTorch
- Floating
- palindrome
- impl
- two-layer neural net
- Solution
- Circuit
- autoencoder
- Today
- Total
목록ML , DL (2019)/알고리즘 (3)
코딩공부
간단하고 많이쓰이는 회문수 찾기 문제이다. https://leetcode.com/problems/palindrome-number/description/ Palindrome Number - LeetCode Can you solve this real interview question? Palindrome Number - Given an integer x, return true if x is a palindrome, and false otherwise. Example 1: Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left. Ex leetcode.com 수가 정수로 주어질 때 가장 간..
Binary Tree가 symmetric한지 알아내는 문제이다. https://leetcode.com/problems/symmetric-tree/ Symmetric Tree - LeetCode Can you solve this real interview question? Symmetric Tree - Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). Example 1: [https://assets.leetcode.com/uploads/2021/02/19/symtree1.jpg] Input: roo leetcode.com Follow up에서 recursive, ..
Acceptance Rate가 높은 문제들 위주로 풀이를 진행중이다. https://leetcode.com/problems/intersection-of-two-linked-lists/ Intersection of Two Linked Lists - LeetCode Can you solve this real interview question? Intersection of Two Linked Lists - Given the heads of two singly linked-lists headA and headB, return the node at which the two lists intersect. If the two linked lists have no intersection at all, return nu..