Search for a command to run...
Articles tagged with #leetcode
Medium — Backtracking | Depth-First Search | Matrix | String The Problem Given a 2D board of characters and a target word, determine if the word exists in the grid by connecting adjacent cells horizontally or vertically. Approach Use backtracking wit...
Hard — Trie | Backtracking | DFS | Matrix The Problem Given a 2D board of characters and a list of words, find all words from the list that can be formed by sequentially adjacent letters on the board, where each cell can only be used once per word. A...
Hard — BFS | Graph | Hash Table | String The Problem Find the length of the shortest transformation sequence from beginWord to endWord, where each transformation changes exactly one letter and each intermediate word must exist in the given wordList. ...
Medium — Dynamic Programming | String | Hash Table The Problem Given a string s and a dictionary of words wordDict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. Approach Uses dynamic programming whe...
Medium — BFS | Matrix | Graph The Problem Fill each empty room with the distance to its nearest gate, where rooms are represented by a 2D grid with gates (0), walls (-1), and empty rooms (INF). Approach Use multi-source BFS starting from all gates si...
Medium — Binary Tree | Depth-First Search | Recursion | Tree Traversal The Problem Given the root of a binary tree, determine if it is a valid binary search tree where all left descendants are less than the node and all right descendants are greater ...
