Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
| 31 |
Tags
- 재귀
- linked list
- sorting
- 문자열
- hash table
- easy
- DP
- two pointers
- string
- binary search
- recursive
- HashTable
- 이진트리
- matrix
- leetcode
- 미디움
- Python
- Medium
- tree
- 쉬움
- Array
- dfs
- Depth-first Search
- 중간
- list
- backtracking
- binary tree
- 리트코드
- Binary
- math
Archives
- Today
- Total
목록2024/03/21 (1)
부부의 코딩 성장 일기
LeetCode 137(Single Number II, Python)
1. 문제 링크 https://leetcode.com/problems/single-number-ii/description/ Single Number II - LeetCode Can you solve this real interview question? Single Number II - Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it. You must implement a solution with a lin leetcode.com 2. 문제 설명 정수로 구성된 array nums가 주어졌을..
Algorithm/LeetCode
2024. 3. 21. 19:00