LeetCode 51. N-Queens (Python / JavaScript) https://leetcode.com/problems/n-queens/description/ N-Queens - LeetCode N-Queens - 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 solut leetcode.com Python def s..
๋ฌธ์ : Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically. You may assume all four edges of the grid are all surrounded by water. Example 1: Input: grid = [ ["1","1","1","1","0"], ["1","1","0","1","0"], ["1","1","0","0","0"], ["..
- Total
- Today
- Yesterday
- DOM
- ๋ฐ์ดํฐ๋ฒ ์ด์ค
- react
- ์๋ฐ์คํฌ๋ฆฝํธ
- ๋ธ๋ผ์ฐ์
- JavaScript
- React Query
- zustand
- BOJ
- Python
- Browser
- ๊ทธ๋ํ
- ํจ์
- ํ์ด์ฌ
- leetcode
- mdn
- ์๋ฌ
- ์ ๋ ฌ
- useState
- error
- ์๊ณ ๋ฆฌ์ฆ
- ๋ฆฌ์กํธ
- github
- ์๋ฃ๊ตฌ์กฐ
- git
- DB
- Component
- Context API
- CSS
- state
์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |