Notice
Recent Posts
Recent Comments
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- 캐치카페
- 맥북
- 금융문자분석경진대회
- hackerrank
- 자연어처리
- PYTHON
- 백준
- ChatGPT
- 파이썬
- 프로그래머스 파이썬
- leetcode
- SW Expert Academy
- ubuntu
- Real or Not? NLP with Disaster Tweets
- AI 경진대회
- 더현대서울 맛집
- 데이콘
- 우분투
- Baekjoon
- 편스토랑 우승상품
- 프로그래머스
- programmers
- Docker
- dacon
- Kaggle
- Git
- 코로나19
- gs25
- 편스토랑
- github
Archives
- Today
- Total
목록
반응형
916. Word Subsets (1)
반응형
솜씨좋은장씨
[leetCode] 916. Word Subsets (Python)
We are given two arrays A and B of words. Each word is a string of lowercase letters. Now, say that word b is a subset of word a if every letter in b occurs in a, including multiplicity. For example, "wrr" is a subset of "warrior", but is not a subset of "world". Now say a word a from A is universal if for every b in B, b is a subset of a. Return a list of all universal words in A. You can retur..
Programming/코딩 1일 1문제
2020. 8. 9. 12:13
반응형