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
- tailwindcss
- Medium
- 컴포넌트 최적화
- Sanity.io
- commitlint
- Weekly Contest
- 호이스팅
- BFS
- React Public Routes
- next-auth
- React.memo
- react-dom
- 프로그래머스
- 모던 자바스크립트 Deep Dive
- LV. 2
- next.js
- React Router dom v6
- .env
- React
- javascript
- sql
- eslintrc
- leetcode
- toast-ui-editor
- Biweekly Contest 79
- medinum
- engines locking
- 모던 자바스크립티 Deep Dive
- React Private Routes
- Vite
Archives
- Today
- Total
목록set (1)
뚜벅
1461. Check If a String Contains All Binary Codes of Size K 문제 풀이
1461. Check If a String Contains All Binary Codes of Size K 난이도: Medium Given a binary string s and an integer k, return true if every binary code of length k is a substring of s. Otherwise, return false. Example 1: Input: s = "00110110", k = 2 Output: true Explanation: The binary codes of length 2 are "00", "01", "10" and "11". They can be all found as substrings at indices 0, 1, 3 and 2 respec..
LeetCode
2022. 5. 31. 22:04