일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- React
- leetcode
- Biweekly Contest 79
- commitlint
- Medium
- 모던 자바스크립트 Deep Dive
- engines locking
- React Router dom v6
- javascript
- BFS
- toast-ui-editor
- React Private Routes
- next.js
- next-auth
- medinum
- 컴포넌트 최적화
- eslintrc
- Weekly Contest
- react-dom
- Sanity.io
- 프로그래머스
- sql
- .env
- Vite
- tailwindcss
- LV. 2
- React Public Routes
- React.memo
- 모던 자바스크립티 Deep Dive
- 호이스팅
- Today
- Total
목록javascript (27)
뚜벅
304. Range Sum Query 2D - Immutable 난이도: Medium Given a 2D matrix matrix, handle multiple queries of the following type: Calculate the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2). Implement the NumMatrix class: NumMatrix(int[][] matrix) Initializes the object with the integer matrix matrix. int sumRegion(int..
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..