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
- engines locking
- Medium
- LV. 2
- next-auth
- react-dom
- React Private Routes
- leetcode
- Vite
- sql
- Biweekly Contest 79
- tailwindcss
- Sanity.io
- React Public Routes
- 프로그래머스
- React Router dom v6
- commitlint
- React
- eslintrc
- next.js
- BFS
- javascript
- .env
- toast-ui-editor
- 모던 자바스크립트 Deep Dive
- 호이스팅
- React.memo
- 컴포넌트 최적화
- 모던 자바스크립티 Deep Dive
- medinum
- Weekly Contest
Archives
- Today
- Total
목록backtracking (1)
뚜벅
51. N-Queens - 데일리 문제
51. N-Queens 난이도: Hard The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle. You may return the answer in any order. Each solution contains a distinct board configuration of the n-queens' placement, where 'Q' and '.' both indicate a queen and an empty space..
LeetCode
2022. 6. 5. 04:42