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
- 문자열
- recursive
- easy
- string
- Medium
- linked list
- backtracking
- Array
- list
- Binary
- Python
- hash table
- Depth-first Search
- leetcode
- 미디움
- binary search
- math
- 이진트리
- DP
- sorting
- dfs
- 쉬움
- two pointers
- HashTable
- 재귀
- binary tree
- tree
- 리트코드
- matrix
- 중간
Archives
- Today
- Total
목록79번 (1)
부부의 코딩 성장 일기

1. 문제 링크 Word Search - LeetCode Word Search - LeetCode Can you solve this real interview question? Word Search - Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are h leetcode.com 2. 문제 설명 board = [["A","B","C","E"],["S","F","C","S"],["A","D","E","E"]] ..
Algorithm/LeetCode
2024. 1. 26. 19:00