https://leetcode.com/problems/validate-binary-search-tree/description/ Validate Binary Search Tree - LeetCode Validate Binary Search Tree - Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: * The left subtree of a node contains only nodes with keys less than the node's key. * The right subtree leetcode.com 문제 Given the root o..

https://leetcode.com/problems/word-search/ Word Search - LeetCode 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 horizontally or vertically neighboring. The s leetcode.com 문제 Given an m x n grid of characters board and a string word, ..

https://leetcode.com/problems/rotate-image/description/ Rotate Image - LeetCode Rotate Image - You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). You have to rotate the image in-place [https://en.wikipedia.org/wiki/In-place_algorithm], which means you have to modify the input 2D matrix leetcode.com 문제 You are given an n x n 2D matrix representing ..

https://leetcode.com/problems/spiral-matrix/ Spiral Matrix - LeetCode Spiral Matrix - Given an m x n matrix, return all elements of the matrix in spiral order. Example 1: [https://assets.leetcode.com/uploads/2020/11/13/spiral1.jpg] Input: matrix = [[1,2,3],[4,5,6],[7,8,9]] Output: [1,2,3,6,9,8,7,4,5] Example 2: [https://a leetcode.com 문제 Given an m x n matrix, return all elements of the matrix i..

https://leetcode.com/problems/set-matrix-zeroes/description/ Set Matrix Zeroes - LeetCode Set Matrix Zeroes - Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's. You must do it in place [https://en.wikipedia.org/wiki/In-place_algorithm]. Example 1: [https://assets.leetcode.com/uploads/2020/08/17/ma leetcode.com 문제 Given an m x n integer matrix matrix, ..