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
- 리트코드
- Depth-first Search
- Python
- 중간
- leetcode
- recursive
- list
- two pointers
- matrix
- 문자열
- hash table
- sorting
- 이진트리
- HashTable
- 미디움
- tree
- string
- easy
- 쉬움
- Binary
- DP
- backtracking
- binary search
- math
- linked list
- 재귀
- dfs
- binary tree
- Medium
- Array
Archives
- Today
- Total
목록2024/01/26 (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