breadth-first-search

Practice › LeetCode › LeetCode 39xx ›

LeetCode 3924 - Minimum Threshold Path With Limited Heavy Edges

LeetCode Problem 3924 Difficulty: 🔴 Hard Topics: Binary Search, Breadth-First Search, Graph Theory Solution LeetCode 3924 - Minimum Threshold Path With Limited Heavy Edges Problem Understanding We are given an undirected weighted graph with n nodes and a list of weighted edges. We must travel from source to target . The key concept in this problem is the definition of a threshold . Once a threshold is chosen, every edge...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3666 - Minimum Operations to Equalize Binary String

LeetCode Problem 3666 Difficulty: 🔴 Hard Topics: Math, String, Breadth-First Search, Union-Find, Ordered Set Solution Problem Understanding The problem asks us to transform a binary string s consisting of characters '0' and '1' into a string where all characters are '1' . The allowed operation is flipping exactly k different indices in one move, turning '0' to '1' and '1' to '0' . The goal is to find the minimum...

Practice › LeetCode › LeetCode 39xx ›

LeetCode 3910 - Count Connected Subgraphs with Even Node Sum

LeetCode Problem 3910 Difficulty: 🔴 Hard Topics: Array, Bit Manipulation, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Enumeration Solution Correctness The solution does address the correct exercise and correctly identifies that the task is to generalize Algorithm S by handling the case when subtraction is performed without knowing which operand is larger. It correctly uses the standard TAOCP idea: if a final borrow remains, then the computed digit string represents...

Practice › LeetCode › LeetCode 39xx ›

LeetCode 3905 - Multi Source Flood Fill

LeetCode Problem 3905 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to simulate a multi-source flood fill on an n x m grid. Each element of the sources array represents a starting point with a specific color, and all other cells start uncolored, represented as 0. At each time step, the currently colored cells spread their color to their four immediate neighbors (up,...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3820 - Pythagorean Distance Nodes in a Tree

LeetCode Problem 3820 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search Solution Problem Understanding The problem requires identifying special nodes in a tree based on distances to three distinct target nodes, x , y , and z . A node is special if the distances from it to x , y , and z form a Pythagorean triplet , meaning that when sorted in ascending order, the sum of squares of...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3831 - Median of a Binary Search Tree Level

LeetCode Problem 3831 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree Solution Corrected Solution for Exercise 4.3.1.9 Exercise 4.3.1.9 asks for a generalization of Algorithm A to add two $n$-place numbers in a mixed-radix system with bases $b_0, b_1, \dots, b_{n-1}$ from right to left. Algorithm A in TAOCP §4.3.1 describes standard addition with carry propagation in a single-radix positional system. Here we adapt...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3787 - Find Diameter Endpoints of a Tree

LeetCode Problem 3787 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Graph Theory Solution Problem Understanding The problem asks us to identify special nodes in a tree, which are nodes that serve as endpoints of any diameter path . A tree is an acyclic connected graph, and its diameter is defined as the longest simple path between any two nodes. Multiple diameter paths can exist, especially in trees with branches of...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3629 - Minimum Jumps to Reach End via Prime Teleportation

LeetCode Problem 3629 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Breadth-First Search, Number Theory Solution Problem Understanding This problem is essentially about navigating an array using two types of moves: adjacent steps and prime-based teleportation . You start at the first index and want to reach the last index in the minimum number of moves. An adjacent step is straightforward: you can move to the next or previous index...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3568 - Minimum Moves to Clean the Classroom

LeetCode Problem 3568 Difficulty: 🟡 Medium Topics: Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix Solution LeetCode 3568 - Minimum Moves to Clean the Classroom Problem Understanding We are given a grid representing a classroom. A student starts at the cell marked 'S' and must collect every litter cell marked 'L' . Movement is allowed only in the four cardinal directions, and moving one cell costs exactly one unit of...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3310 - Remove Methods From Project

LeetCode Problem 3310 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory Solution Understood. For any TAOCP Volume 1 exercise you provide, I will write the solution in the style of a rigorous solution manual: Use Knuth's notation and terminology from the relevant section. State precisely what is to be proved or computed. Justify every algebraic manipulation, combinatorial argument, and algorithmic step. Omit unnecessary exposition and motivational commentary. Present...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3710 - Maximum Partition Factor

LeetCode Problem 3710 Difficulty: 🔴 Hard Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem asks us to split a set of n points in a 2D Cartesian plane into exactly two non-empty groups, such that the minimum Manhattan distance among all pairs of points within each group (the partition factor) is maximized. The Manhattan distance between points [xi, yi] and [xj, yj]...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3807 - Minimum Cost to Repair Edges to Traverse a Graph

LeetCode Problem 3807 Difficulty: 🟡 Medium Topics: Binary Search, Breadth-First Search, Graph Theory Solution Problem Understanding The problem presents an undirected graph with n nodes labeled from 0 to n-1 and m edges. Each edge has a repair cost, and initially, all edges are damaged. We can spend a certain amount of money to repair all edges whose cost is less than or equal to that amount. After repairing some...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3690 - Split and Merge Array Transformation

LeetCode Problem 3690 Difficulty: 🟡 Medium Topics: Array, Hash Table, Breadth-First Search Solution LeetCode 3690 - Split and Merge Array Transformation Problem Understanding The problem gives us two arrays, nums1 and nums2 , of equal length n . We are allowed to repeatedly perform a special operation on nums1 . In a single operation, we choose any contiguous subarray, remove it from its current location, and then insert that entire...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3528 - Unit Conversion I

LeetCode Problem 3528 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding The problem is asking us to compute, for each unit type from 0 to n-1 , the number of that unit equivalent to a single unit of type 0 . We are given a list of direct conversion relationships between units. Each conversion specifies that 1 unit of sourceUnit is equivalent to some integer...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3419 - Minimize the Maximum Edge Weight of Graph

LeetCode Problem 3419 Difficulty: 🟡 Medium Topics: Binary Search, Depth-First Search, Breadth-First Search, Graph Theory, Shortest Path Solution Problem Understanding The problem is asking us to manipulate a directed weighted graph in order to minimize the maximum edge weight while satisfying two constraints: every node must be able to reach node 0, and no node may have more outgoing edges than a given threshold . The input consists of: n...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3619 - Count Islands With Total Value Divisible by K

LeetCode Problem 3619 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem is asking us to count islands in a 2D grid where the sum of the values in each island is divisible by a given integer k . An island is defined as a group of positive integers that are 4-directionally connected, meaning we can move horizontally or vertically between adjacent positive...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3607 - Power Grid Maintenance

LeetCode Problem 3607 Difficulty: 🟡 Medium Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Heap (Priority Queue), Ordered Set Solution Problem Understanding The problem gives an undirected graph of c power stations labeled from 1 to c , connected by bidirectional cables. These connections define connected components, which are referred to as power grids. Importantly, these grids are static, meaning connectivity does not change even if stations...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3552 - Grid Teleportation Traversal

LeetCode Problem 3552 Difficulty: 🟡 Medium Topics: Array, Hash Table, Breadth-First Search, Matrix Solution Problem Understanding This problem presents a 2D grid traversal scenario with obstacles and teleportation portals. You are given a matrix of characters representing cells. Empty cells '.' are freely passable, '#' represents obstacles that block movement, and uppercase letters 'A' - 'Z' are teleportation portals. The task is to move from the top-left (0, 0) to...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3535 - Unit Conversion II

LeetCode Problem 3535 Difficulty: 🟡 Medium Topics: Array, Math, Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding The input describes a collection of unit conversion relationships. Each conversion is given as: source -> target with factor f meaning: 1 unit of source = f units of target The important observation is that there are exactly n - 1 conversion edges among n units, and the statement guarantees that unit...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3493 - Properties Graph

LeetCode Problem 3493 Difficulty: 🟡 Medium Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem asks us to model a 2D array of integers, called properties , as an undirected graph. Each row of the array corresponds to a node in the graph. Two nodes are connected if the number of distinct integers they share is at least k . Our goal is...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3481 - Apply Substitutions

LeetCode Problem 3481 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution LeetCode 3481 - Apply Substitutions Problem Understanding This problem gives us a collection of replacement rules and a text containing placeholders. Every placeholder has the format %X% , where X is a single uppercase letter corresponding to one of the replacement keys. The important detail is that replacement values may...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3376 - Minimum Time to Break Locks I

LeetCode Problem 3376 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Backtracking, Bit Manipulation, Breadth-First Search, Bitmask Solution LeetCode 3376 - Minimum Time to Break Locks I Problem Understanding The problem describes a sequence of locks that must all be broken. Each lock requires a certain amount of energy, given by strength[i] . Bob's sword starts with: Energy = 0 Growth factor x = 1 Every minute, the sword gains x...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3372 - Maximize the Number of Target Nodes After Connecting Trees I

LeetCode Problem 3372 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search Solution LeetCode 3372 - Maximize the Number of Target Nodes After Connecting Trees I Problem Understanding We are given two separate undirected trees. The first tree contains n nodes labeled from 0 to n - 1 , and the second tree contains m nodes labeled from 0 to m - 1 . A node u is considered a...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1992 - Find All Groups of Farmland

LeetCode Problem 1992 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding In this problem, we are given a binary matrix called land . Each cell contains either: 0 , representing forest land 1 , representing farmland The farmland cells are organized into rectangular groups. Every group is guaranteed to form a perfect rectangle made entirely of 1 s. Additionally, different groups never touch each other...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2556 - Disconnect Path in a Binary Matrix by at Most One Flip

LeetCode Problem 2556 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem is asking whether it is possible to disconnect a path from the top-left corner (0, 0) to the bottom-right corner (m - 1, n - 1) in a binary matrix by flipping at most one cell from 1 to 0 or 0 to 1 . A path only allows moves...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1905 - Count Sub Islands

LeetCode Problem 1905 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem presents two m x n binary matrices, grid1 and grid2 , representing maps of land ( 1 ) and water ( 0 ). Each matrix may contain multiple islands, where an island is defined as a connected group of 1 s that are adjacent vertically or horizontally . The task is...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2617 - Minimum Number of Visited Cells in a Grid

LeetCode Problem 2617 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Stack, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Monotonic Stack Solution Problem Understanding The problem asks us to determine the minimum number of cells we need to visit in order to reach the bottom-right corner of a given m x n grid. Each cell (i, j) contains a number grid[i][j] representing the maximum number of steps we can move right...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2577 - Minimum Time to Visit a Cell In a Grid

LeetCode Problem 2577 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution That is a long, multi-section technical guide. To make sure I target the correct problem and avoid producing the wrong reference document, can you confirm the exact LeetCode problem number/title? You mentioned LeetCode 2577 - Minimum Time to Visit a Cell In a Grid . If that is correct, I will...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2641 - Cousins in Binary Tree II

LeetCode Problem 2641 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem gives us the root of a binary tree and asks us to replace every node’s value with the sum of all of its cousins’ values. Two nodes are considered cousins if: They are at the same depth in the tree They do not share the same parent The depth...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3283 - Maximum Number of Moves to Kill All Pawns

LeetCode Problem 3283 Difficulty: 🔴 Hard Topics: Array, Math, Bit Manipulation, Breadth-First Search, Game Theory, Bitmask Solution Problem Understanding The problem gives us a 50 x 50 chessboard containing exactly one knight and up to 15 pawns. The knight starts at position (kx, ky) , and every pawn is placed at one of the coordinates in positions . Two players, Alice and Bob, alternate turns. Alice moves first. During a...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2360 - Longest Cycle in a Graph

LeetCode Problem 2360 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a directed graph represented by an array called edges . The graph contains n nodes labeled from 0 to n - 1 . Each node has at most one outgoing edge. The meaning of the array is straightforward: If edges[i] = j , there is a directed edge...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3373 - Maximize the Number of Target Nodes After Connecting Trees II

LeetCode Problem 3373 Difficulty: 🔴 Hard Topics: Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem gives us two separate undirected trees. The first tree contains n nodes and the second tree contains m nodes. A tree is an acyclic connected graph, so every pair of nodes has exactly one simple path between them. For any two nodes u and v , node u is considered a target node...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2773 - Height of Special Binary Tree

LeetCode Problem 2773 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution LeetCode 2773 - Height of Special Binary Tree Problem Understanding This problem gives us the root of a special binary tree. At first glance, it looks like a normal binary tree, but there is an unusual property involving the leaf nodes. Suppose the leaves of the tree, ordered by their node values, are: $$b_1 <...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2998 - Minimum Number of Operations to Make X and Y Equal

LeetCode Problem 2998 Difficulty: 🟡 Medium Topics: Dynamic Programming, Breadth-First Search, Memoization Solution Problem Understanding The problem asks us to transform an integer x into another integer y using the minimum number of operations. At every step, we are allowed to perform exactly one of four actions: Divide x by 11 if it is divisible by 11 . Divide x by 5 if it is divisible by 5 . Decrease...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2471 - Minimum Number of Operations to Sort a Binary Tree by Level

LeetCode Problem 2471 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to determine the minimum number of swap operations required to sort the values of a binary tree level by level in strictly increasing order. Specifically, at each level of the tree, we can only swap values of nodes that exist on that level. The tree is given as a standard binary...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2204 - Distance to a Cycle in Undirected Graph

LeetCode Problem 2204 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a connected undirected graph with n nodes and exactly n edges. A connected graph with n nodes normally forms a tree when it has n - 1 edges. Since this graph has one extra edge, it contains exactly one cycle. Our goal is to compute, for every node,...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3286 - Find a Safe Walk Through a Grid

LeetCode Problem 3286 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution Problem Understanding The problem requires determining whether there exists a path from the top-left corner (0, 0) to the bottom-right corner (m - 1, n - 1) in a binary m x n matrix grid , while maintaining a health value greater than or equal to 1. Each cell with a...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3015 - Count the Number of Houses at a Certain Distance I

LeetCode Problem 3015 Difficulty: 🟡 Medium Topics: Breadth-First Search, Graph Theory, Prefix Sum Solution Here is a complete technical solution guide for LeetCode 3015 - Count the Number of Houses at a Certain Distance I , formatted according to your specifications. Problem Understanding The problem describes a simple linear city with n houses numbered from 1 to n . Each consecutive house i and i + 1 are connected by...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2146 - K Highest Ranked Items Within a Price Range

LeetCode Problem 2146 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrix Solution Problem Understanding This problem gives us a 2D grid representing a shop layout. Every cell in the grid has one of three meanings: 0 means the cell is blocked by a wall and cannot be traversed. 1 means the cell is empty space and can be walked through. Any value greater than 1 represents...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2492 - Minimum Score of a Path Between Two Cities

LeetCode Problem 2492 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem asks us to find the minimum possible score of a path between city 1 and city n in a graph defined by n cities and roads . Each road connects two cities bidirectionally and has an associated distance. The score of a path is defined as the minimum distance among all...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1926 - Nearest Exit from Entrance in Maze

LeetCode Problem 1926 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us a rectangular maze represented by a 2D grid. Each cell contains either: '.' , meaning the cell is empty and can be walked on '+' , meaning the cell is a wall and cannot be crossed We are also given the coordinates of an entrance cell. The entrance is guaranteed to be...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2503 - Maximum Number of Points From Grid Queries

LeetCode Problem 2503 Difficulty: 🔴 Hard Topics: Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrix Solution Problem Understanding The problem asks us to calculate the maximum number of points that can be collected in a grid for a series of queries. The grid is represented by an m x n matrix of integers, where each cell has a value. For each query value q , we start...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2608 - Shortest Cycle in a Graph

LeetCode Problem 2608 Difficulty: 🔴 Hard Topics: Breadth-First Search, Graph Theory Solution Problem Understanding The problem gives us an undirected graph with n vertices labeled from 0 to n - 1 . The graph is represented using an edge list, where each edge connects two vertices in both directions. Our task is to find the length of the shortest cycle in the graph. A cycle is a path that starts...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1993 - Operations on Tree

LeetCode Problem 1993 Difficulty: 🟡 Medium Topics: Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Design Solution LeetCode 1993 - Operations on Tree Problem Understanding The problem asks us to design a mutable tree-based data structure that supports three operations: lock , unlock , and upgrade . Each node in the tree may either be unlocked or locked by exactly one user. The operations must follow strict rules about when...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2612 - Minimum Reverse Operations

LeetCode Problem 2612 Difficulty: 🔴 Hard Topics: Array, Hash Table, Breadth-First Search, Union-Find, Ordered Set Solution This will be a very large, multi-thousand-word technical guide because of the required depth, full proofs, worked examples, Python and Go implementations, detailed walkthroughs, complexity reasoning, and exhaustive tests. To ensure quality and avoid truncation, I will split it cleanly into sections across messages. Part 1: Problem Understanding, Approaches, Algorithm Walkthrough, and Python Solution...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3387 - Maximize Amount After Two Days of Conversions

LeetCode Problem 3387 Difficulty: 🟡 Medium Topics: Array, String, Depth-First Search, Breadth-First Search, Graph Theory Solution LeetCode 3387 - Maximize Amount After Two Days of Conversions Problem Understanding This problem models currency conversions as graph traversal across two separate days. You begin with exactly 1.0 unit of initialCurrency , and you may perform any number of exchanges on day 1 using the first set of conversion rates, followed by any...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3243 - Shortest Distance After Road Addition Queries I

LeetCode Problem 3243 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Graph Theory Solution Problem Understanding We are given n cities labeled from 0 to n - 1 . Initially, the graph forms a simple directed chain: 0 -> 1 1 -> 2 2 -> 3 ... n - 2 -> n - 1 This means that before processing any queries, the shortest path from city 0 to city n -...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2039 - The Time When the Network Becomes Idle

LeetCode Problem 2039 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Graph Theory Solution Problem Understanding This problem involves a network of servers where server 0 is the master and all other servers are data servers. Each data server initially sends a message to the master, and the master instantly responds upon receiving the message. The data servers resend messages periodically if they have not received a reply, according to the...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2415 - Reverse Odd Levels of Binary Tree

LeetCode Problem 2415 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to reverse the values of nodes at odd levels of a perfect binary tree . A perfect binary tree is a tree in which every parent node has exactly two children and all leaves appear at the same depth. The root node is at level 0 (even), its children...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2596 - Check Knight Tour Configuration

LeetCode Problem 2596 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix, Simulation Solution Problem Understanding The problem gives us an n x n matrix called grid , where every number from 0 to n * n - 1 appears exactly once. Each value represents the order in which a knight visited that cell during a tour of the chessboard. A knight in chess moves in an L-shape. From...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2852 - Sum of Remoteness of All Cells

LeetCode Problem 2852 Difficulty: 🟡 Medium Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution LeetCode 2852 - Sum of Remoteness of All Cells Problem Understanding We are given an n × n grid where each cell is either: A positive integer, representing a valid cell with that value. -1 , representing a blocked cell. Movement is allowed only between non-blocked cells that share an edge, meaning up,...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2192 - All Ancestors of a Node in a Directed Acyclic Graph

LeetCode Problem 2192 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a Directed Acyclic Graph (DAG) with n nodes labeled from 0 to n - 1 , along with a list of directed edges. Each edge [u, v] means there is a one way connection from node u to node v . The goal is to compute, for every...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3123 - Find Edges in Shortest Paths

LeetCode Problem 3123 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path Solution LeetCode 3123 - Find Edges in Shortest Paths Problem Understanding The problem gives us an undirected weighted graph with n nodes and m edges. Each edge connects two nodes and has a positive weight. We need to determine which edges belong to at least one shortest path from node 0 to...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2059 - Minimum Operations to Convert Number

LeetCode Problem 2059 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search Solution Problem Understanding This problem asks us to transform a starting integer into a target integer using the minimum number of operations. At every step, we may choose any number from the nums array and apply one of three operations to the current value: Addition Subtraction Bitwise XOR The current value is stored in a variable x , which initially...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2658 - Maximum Number of Fish in a Grid

LeetCode Problem 2658 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem provides a 2D grid representing a map of land and water cells. Each cell can either be land (value 0 ) or water containing a positive number of fish. The goal is to determine the maximum number of fish a fisher can collect by starting from any water cell and moving...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2583 - Kth Largest Sum in a Binary Tree

LeetCode Problem 2583 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Sorting, Binary Tree Solution Problem Understanding The problem gives us the root of a binary tree and an integer k . For every level in the tree, we calculate the sum of all node values that appear on that level. After computing all level sums, we must return the kth largest level sum. A binary tree level is determined by...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2045 - Second Minimum Time to Reach Destination

LeetCode Problem 2045 Difficulty: 🔴 Hard Topics: Breadth-First Search, Graph Theory, Shortest Path Solution Here is a comprehensive technical solution guide for LeetCode 2045 following your requested format: Problem Understanding The problem asks us to find the second minimum time to travel from vertex 1 to vertex n in a weighted, undirected graph, where the weight of every edge is the same ( time ). The twist is that each...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3141 - Maximum Hamming Distances

LeetCode Problem 3141 Difficulty: 🔴 Hard Topics: Array, Bit Manipulation, Breadth-First Search Solution Problem Understanding The problem asks us to compute the maximum Hamming distance for each element in an array of integers. The Hamming distance between two integers is defined as the number of positions where their binary representations differ. We are given an array nums and an integer m , and each element of nums is guaranteed to...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3383 - Minimum Runes to Add to Cast Spell

LeetCode Problem 3383 Difficulty: 🔴 Hard Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Topological Sort Solution Problem Understanding We are given a directed graph with n focus points, numbered from 0 to n - 1 . Some focus points already contain magic crystals. These are the starting sources of magic energy. Directed runes represent one-way magic flow between focus points. If there is a rune from u to...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2328 - Number of Increasing Paths in a Grid

LeetCode Problem 2328 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix Solution Problem Understanding In this problem, we are given a two dimensional matrix called grid . Each cell contains a positive integer. From any cell, we may move in four directions: up, down, left, or right. Diagonal movement is not allowed. The goal is to count how many strictly increasing...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2814 - Minimum Time Takes to Reach Destination Without Drowning

LeetCode Problem 2814 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Matrix Solution LeetCode 2814 - Minimum Time Takes to Reach Destination Without Drowning Problem Understanding This problem takes place on a two-dimensional grid where each cell represents a type of terrain. The grid contains: "S" : your starting position. "D" : the destination you want to reach. "." : an empty cell that can be walked on. "X" : a...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1971 - Find if Path Exists in Graph

LeetCode Problem 1971 Difficulty: 🟢 Easy Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem asks us to determine whether a path exists between two nodes in an undirected graph. The graph is defined by n vertices labeled from 0 to n - 1 and a list of edges, where each edge connects two distinct vertices. The key points are that the graph is bi-directional ,...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2101 - Detonate the Maximum Bombs

LeetCode Problem 2101 Difficulty: 🟡 Medium Topics: Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometry Solution Problem Understanding In this problem, each bomb is represented by three integers: its x-coordinate, y-coordinate, and explosion radius. If a bomb explodes, every other bomb whose center lies within or on the boundary of that radius will also explode. Those newly exploded bombs can continue triggering additional bombs, creating a chain reaction. The...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2316 - Count Unreachable Pairs of Nodes in an Undirected Graph

LeetCode Problem 2316 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem asks us to find the number of pairs of nodes in an undirected graph that cannot reach each other via any path. You are given an integer n representing the total number of nodes labeled from 0 to n - 1 and a list of edges representing connections between nodes. Each...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3203 - Find Minimum Diameter After Merging Two Trees

LeetCode Problem 3203 Difficulty: 🔴 Hard Topics: Tree, Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding We are given two separate undirected trees. The first tree contains n nodes and is represented by edges1 , while the second tree contains m nodes and is represented by edges2 . A tree is a connected graph with no cycles. Since each tree has exactly nodes - 1 edges, the input already...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2258 - Escape the Spreading Fire

LeetCode Problem 2258 Difficulty: 🔴 Hard Topics: Array, Binary Search, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to determine how long we can safely wait before starting to move from the top-left corner of a grid to the bottom-right corner while a fire spreads across the grid over time. The grid contains three types of cells: 0 represents empty grass that both the player and the fire...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2858 - Minimum Edge Reversals So Every Node Is Reachable

LeetCode Problem 2858 Difficulty: 🔴 Hard Topics: Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding This problem gives us a directed graph with n nodes and exactly n - 1 edges. The important guarantee is that if we ignore the direction of every edge, the graph becomes a tree. That means the underlying structure is connected and acyclic. Each edge is currently directed one way. For every...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2277 - Closest Node to Path in Tree

LeetCode Problem 2277 Difficulty: 🔴 Hard Topics: Array, Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem is asking us to process queries on a tree structure. Each query gives a path between two nodes starti and endi and a third node nodei . We are asked to find which node along the path is closest to nodei in terms of the number of edges separating them, also known...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2493 - Divide Nodes Into the Maximum Number of Groups

LeetCode Problem 2493 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding We are given an undirected graph with n nodes and a list of edges. The graph may contain multiple disconnected components. Our task is to divide all nodes into ordered groups numbered from 1 to m . The key constraint is based on graph edges. If two nodes are connected by an edge,...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2458 - Height of Binary Tree After Subtree Removal Queries

LeetCode Problem 2458 Difficulty: 🔴 Hard Topics: Array, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to answer multiple independent queries on a binary tree. For each query, we temporarily remove an entire subtree rooted at a specific node, then compute the height of the remaining tree. The binary tree contains n nodes, and every node has a unique value from 1 to n...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2685 - Count the Number of Complete Components

LeetCode Problem 2685 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding This problem asks us to count how many connected components in an undirected graph are complete graphs . We are given an integer n , representing the number of vertices labeled from 0 to n - 1 , and a list of undirected edges. Each edge [a, b] means there is a bidirectional...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2290 - Minimum Obstacle Removal to Reach Corner

LeetCode Problem 2290 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution LeetCode 2290, Minimum Obstacle Removal to Reach Corner Problem Understanding This problem gives us a 2D grid where every cell is either empty or blocked by an obstacle. A value of 0 means we can move through the cell freely, while a value of 1 means the cell contains an obstacle...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3235 - Check if the Rectangle Corner Is Reachable

LeetCode Problem 3235 Difficulty: 🔴 Hard Topics: Array, Math, Depth-First Search, Breadth-First Search, Union-Find, Geometry Solution Problem Understanding The problem asks whether there is a clear, unobstructed path from the bottom-left corner (0, 0) to the top-right corner (xCorner, yCorner) of a rectangle, such that the path does not touch or go inside any given circles. Each circle is represented by its center (xi, yi) and radius ri . The...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2467 - Most Profitable Path in a Tree

LeetCode Problem 2467 Difficulty: 🟡 Medium Topics: Array, Tree, Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding The problem presents a rooted tree with n nodes numbered from 0 to n-1 , where node 0 is the root. Each node has a gate that can either cost money to open (negative value) or give a reward (positive value). Alice starts at the root, and Bob starts at a specified...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2368 - Reachable Nodes With Restrictions

LeetCode Problem 2368 Difficulty: 🟡 Medium Topics: Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution That is a large, highly structured guide. To make sure I target the exact problem and keep the response complete in a single message, can you confirm you want the full solution guide for LeetCode 2368 - Reachable Nodes With Restrictions ? The prompt body currently says 2368 , while some...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2385 - Amount of Time for Binary Tree to Be Infected

LeetCode Problem 2385 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to model the spread of an infection across a binary tree. Each node in the tree has a unique integer value, and the infection starts from a specific node, identified by start . The infection spreads to adjacent nodes-this means both the parent and child nodes of...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2445 - Number of Nodes With Value One

LeetCode Problem 2445 Difficulty: 🟡 Medium Topics: Array, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The tree in this problem is not given explicitly through an edge list. Instead, the structure is defined mathematically. Every node v has parent floor(v / 2) , which creates the same structure as a binary heap. For example: Node 2 and node 3 are children of node 1 Node 4 and...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2477 - Minimum Fuel Cost to Report to the Capital

LeetCode Problem 2477 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding The problem gives us a country road network that forms a tree. A tree is a connected graph with no cycles, which means there is exactly one path between any two cities. The cities are numbered from 0 to n - 1 , and city 0 is always the capital. Each city has...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2174 - Remove All Ones With Row and Column Flips II

LeetCode Problem 2174 Difficulty: 🟡 Medium Topics: Array, Bit Manipulation, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us an m x n binary matrix where every cell contains either 0 or 1 . Our goal is to remove all 1 s using the minimum number of operations. An operation can only be performed on a cell (i, j) that currently contains a 1 . Once we choose such...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3385 - Minimum Time to Break Locks II

LeetCode Problem 3385 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Graph Theory Solution Problem Understanding In this problem, Bob must break a collection of locks, where each lock requires a certain minimum amount of energy before it can be destroyed. The input array strength represents these requirements. If strength[i] = s , then Bob must wait until the sword's energy reaches at least s before breaking that lock. The sword...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2812 - Find the Safest Path in a Grid

LeetCode Problem 2812 Difficulty: 🟡 Medium Topics: Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix Solution LeetCode 2812 - Find the Safest Path in a Grid Problem Understanding This problem asks us to find a path from the top-left corner (0,0) to the bottom-right corner (n-1,n-1) that maximizes its safeness factor . The grid contains thieves, represented by cells with value 1 , and empty cells, represented by...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3157 - Find the Level of Tree with Minimum Sum

LeetCode Problem 3157 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem gives us the root of a binary tree, where every node contains a positive integer value. Our task is to determine which level of the tree has the smallest sum of node values. A binary tree is organized into levels: The root node is at level 1 Its children are at...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1970 - Last Day Where You Can Still Cross

LeetCode Problem 1970 Difficulty: 🔴 Hard Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding This problem asks us to find the last day we can cross a grid from the top row to the bottom row, walking only on land. The grid is initially all land ( 0 ), and each day, specific cells are flooded with water ( 1 ) according to the cells...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 841 - Keys and Rooms

LeetCode Problem 841 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding This problem can be interpreted as a graph traversal challenge. Each room is a node in a graph labeled from 0 to n-1 , and the keys inside a room represent directed edges to other nodes that can be unlocked. The input rooms is a list of lists, where rooms[i] contains the set of...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 102 - Binary Tree Level Order Traversal

LeetCode Problem 102 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to perform a level order traversal on a binary tree. A binary tree is a hierarchical structure where each node can have at most two children, commonly referred to as the left child and the right child. A level order traversal means we visit the tree one level at a time,...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1625 - Lexicographically Smallest String After Applying Operations

LeetCode Problem 1625 Difficulty: 🟡 Medium Topics: String, Depth-First Search, Breadth-First Search, Enumeration Solution Problem Understanding The problem gives us a numeric string s of even length and two operations that can be performed any number of times in any order. The first operation adds the integer a to every digit located at an odd index. Since digits must remain between 0 and 9 , the addition wraps around using...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 133 - Clone Graph

LeetCode Problem 133 Difficulty: 🟡 Medium Topics: Hash Table, Depth-First Search, Breadth-First Search, Graph Theory Solution Clone Graph Problem Understanding This problem asks us to create a deep copy of an undirected connected graph. We are given a reference to one node in the graph, and we must return a completely independent copy of the entire graph structure. Each graph node contains two pieces of information: val , an integer...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1129 - Shortest Path with Alternating Colors

LeetCode Problem 1129 Difficulty: 🟡 Medium Topics: Breadth-First Search, Graph Theory Solution Problem Understanding The problem gives us a directed graph with n nodes labeled from 0 to n - 1 . Every edge in the graph has a color, either red or blue. The graph is represented using two separate edge lists: redEdges , containing all red directed edges blueEdges , containing all blue directed edges We need to...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1631 - Path With Minimum Effort

LeetCode Problem 1631 Difficulty: 🟡 Medium Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix Solution Problem Understanding The problem gives us a grid called heights , where each cell contains an integer representing elevation. We start at the top-left corner (0, 0) and want to reach the bottom-right corner (rows - 1, columns - 1) . At each step, we may move in one of...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 965 - Univalued Binary Tree

LeetCode Problem 965 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution LeetCode 965 - Univalued Binary Tree Problem Understanding The problem gives us the root node of a binary tree and asks whether the tree is "uni-valued". A binary tree is considered uni-valued if every node in the tree contains exactly the same integer value. In simpler terms, we need to examine every node in the...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 559 - Maximum Depth of N-ary Tree

LeetCode Problem 559 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem asks us to compute the maximum depth of an n-ary tree. An n-ary tree is a tree where each node can have zero or more children, unlike a binary tree where each node has at most two children. The depth of a tree is defined as the number of nodes along the longest...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 365 - Water and Jug Problem

LeetCode Problem 365 Difficulty: 🟡 Medium Topics: Math, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem gives us two water jugs with capacities x and y . We can perform only three types of operations: Fill a jug completely Empty a jug completely Pour water from one jug into the other until either the source jug becomes empty or the destination jug becomes full Our goal is to determine...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 547 - Number of Provinces

LeetCode Problem 547 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem is asking us to determine the number of provinces in a network of cities. Each city can be connected directly to other cities, and indirectly through chains of connections. A province is defined as a set of cities that are all directly or indirectly connected, and that has no connections to...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 773 - Sliding Puzzle

LeetCode Problem 773 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix Solution Problem Understanding The Sliding Puzzle problem presents a 2 x 3 board containing five numbered tiles from 1 to 5 and a blank space represented as 0 . The goal is to transform the board into a solved configuration [[1,2,3],[4,5,0]] using the fewest number of moves, where a move consists of swapping 0 with...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 685 - Redundant Connection II

LeetCode Problem 685 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem asks us to identify a redundant edge in a directed graph that originated as a rooted tree. A rooted tree has a single root with all other nodes having exactly one parent. The graph given is initially a tree with n nodes labeled 1 to n , with exactly one extra...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1765 - Map of Highest Peak

LeetCode Problem 1765 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem presents a matrix isWater of size m x n where each cell is either water ( 1 ) or land ( 0 ). We are asked to assign heights to every cell in a way that satisfies three rules. First, all heights must be non-negative integers. Second, water cells must have a height of...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1778 - Shortest Path in a Hidden Grid

LeetCode Problem 1778 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix, Interactive Solution Problem Understanding This problem asks us to find the shortest path from a robot's unknown starting position to a hidden target inside a grid. The major challenge is that the grid itself is not directly accessible. Instead of receiving the matrix as input, we interact with the environment through a GridMaster API. The robot can...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 490 - The Maze

LeetCode Problem 490 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to determine whether a rolling ball can stop exactly at a destination cell inside a maze. The maze is represented as a two-dimensional grid where: 0 represents an empty space the ball can roll through 1 represents a wall The important detail is that the ball does not move one...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1609 - Even Odd Tree

LeetCode Problem 1609 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Binary Tree Solution Here’s a fully detailed, reference-style solution guide for LeetCode 1609 - Even Odd Tree , following all your formatting rules: Problem Understanding The problem asks us to determine whether a given binary tree satisfies the Even-Odd Tree property. In other words, we need to validate two main conditions based on the level of the tree: For even-indexed...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1036 - Escape a Large Maze

LeetCode Problem 1036 Difficulty: 🔴 Hard Topics: Array, Hash Table, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem gives us a massive 1,000,000 x 1,000,000 grid. Each cell is identified by coordinates (x, y) , and movement is allowed in four directions: up, down, left, and right. Some cells are blocked, meaning we cannot step onto them. We are given three inputs: blocked , a list of blocked coordinates...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 919 - Complete Binary Tree Inserter

LeetCode Problem 919 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Design, Binary Tree Solution Problem Understanding This problem asks us to design a data structure that allows insertion into a complete binary tree while maintaining its completeness. A complete binary tree is one where all levels are fully filled, except possibly the last, which is filled from left to right. The key requirement is that after each insertion, the tree...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1469 - Find All The Lonely Nodes

LeetCode Problem 1469 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to traverse a binary tree and identify every node that is considered "lonely". A node is lonely if it is the only child of its parent. In other words, if a parent node has exactly one child, that child is lonely. The input is the root of a binary...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1448 - Count Good Nodes in Binary Tree

LeetCode Problem 1448 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem gives us the root of a binary tree and asks us to count how many nodes are considered "good". A node is called good if, along the path from the root to that node, there is no node with a value greater than the current node's value. In other words, the...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 513 - Find Bottom Left Tree Value

LeetCode Problem 513 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to find the leftmost value in the last row of a binary tree. A binary tree is a hierarchical data structure where each node has at most two children: a left child and a right child. The input to the problem is the root node of the tree, which...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1215 - Stepping Numbers

LeetCode Problem 1215 Difficulty: 🟡 Medium Topics: Math, Backtracking, Breadth-First Search Solution Problem Understanding The problem is asking us to find all integers within a given range [low, high] that are stepping numbers . A stepping number is defined as a number in which the absolute difference between every pair of adjacent digits is exactly 1 . For instance, 321 is a stepping number because |3-2| = 1 and |2-1|...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1740 - Find Distance in a Binary Tree

LeetCode Problem 1740 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to determine the distance between two nodes in a binary tree, given their values p and q . The distance is defined as the number of edges in the shortest path connecting the two nodes. The input is the root of a binary tree and two integers...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1810 - Minimum Path Cost in a Hidden Grid

LeetCode Problem 1810 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Interactive, Shortest Path Solution Problem Understanding This problem is an interactive shortest path problem on a hidden weighted grid. We control a robot that starts somewhere in an unknown grid, and we must determine the minimum total movement cost required to reach a hidden target cell. Unlike a normal grid problem, we...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 684 - Redundant Connection

LeetCode Problem 684 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem is asking us to identify a redundant edge in a graph that started as a tree. A tree is a connected graph with n nodes and exactly n-1 edges, meaning it has no cycles. The input graph has n nodes and n edges, so by definition, it contains exactly one cycle....

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1257 - Smallest Common Region

LeetCode Problem 1257 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding This problem describes a hierarchical relationship between geographic regions. Each list in regions represents a parent-child relationship where the first element is the parent region and every remaining element in the list is directly contained within that parent. For example, the list: ["North America", "United States", "Canada"] means that "North America"...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 623 - Add One Row to Tree

LeetCode Problem 623 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to modify a binary tree by adding a new row of nodes with a given value val at a specified depth depth . The input consists of the root of a binary tree, the integer value val to insert, and the target depth depth . Depth is defined such...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 428 - Serialize and Deserialize N-ary Tree

LeetCode Problem 428 Difficulty: 🔴 Hard Topics: String, Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding LeetCode 428, LeetCode Serialize and Deserialize N-ary Tree, asks us to design a reversible encoding system for an N-ary tree. The problem is not asking for a specific serialization format. Instead, it asks us to guarantee that after serializing a tree into a string and then deserializing that string, we reconstruct the exact same...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1267 - Count Servers that Communicate

LeetCode Problem 1267 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix, Counting Solution Problem Understanding The problem gives us a two dimensional grid representing a server center. Each cell contains either: 1 , meaning there is a server in that position 0 , meaning the cell is empty A server can communicate with another server if both servers are located in the same row or the same...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 514 - Freedom Trail

LeetCode Problem 514 Difficulty: 🔴 Hard Topics: String, Dynamic Programming, Depth-First Search, Breadth-First Search Solution LeetCode 514 - Freedom Trail Problem Understanding The problem models a circular dial, represented by the string ring , where each character is engraved at a position around the circle. Another string, key , represents the sequence of characters we must spell. At the beginning, the character at index 0 of ring is aligned at...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 733 - Flood Fill

LeetCode Problem 733 Difficulty: 🟢 Easy Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem is asking us to simulate a flood fill operation on a 2D grid that represents an image. Each cell in the grid contains an integer representing a pixel color. You are given a starting pixel (sr, sc) and a target color color . The goal is to change the color of the...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 864 - Shortest Path to Get All Keys

LeetCode Problem 864 Difficulty: 🔴 Hard Topics: Array, Bit Manipulation, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to find the shortest path to collect all keys in a 2D grid maze. The grid contains walls, open spaces, keys, locks, and a starting point. You can move in the four cardinal directions but cannot move diagonally, through walls, or outside the grid. Each lock can only be passed...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1391 - Check if There is a Valid Path in a Grid

LeetCode Problem 1391 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem presents a grid where each cell represents a street segment with a specific orientation, denoted by a number from 1 to 6. Each number encodes which directions the street in that cell connects to neighboring cells. For example, 1 connects left and right, while 2 connects up and down, and the...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 463 - Island Perimeter

LeetCode Problem 463 Difficulty: 🟢 Easy Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to calculate the perimeter of an island represented in a 2D grid. Each cell in the grid is either land ( 1 ) or water ( 0 ). The island consists of one or more connected land cells, where connectivity is strictly horizontal or vertical. The grid is completely surrounded...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 695 - Max Area of Island

LeetCode Problem 695 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem is asking us to find the largest connected area of land in a 2D binary matrix. Each cell in the matrix represents either water ( 0 ) or land ( 1 ). A group of 1 s forms an island if the 1 s are connected 4-directionally (up, down, left, or...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 126 - Word Ladder II

LeetCode Problem 126 Difficulty: 🔴 Hard Topics: Hash Table, String, Backtracking, Breadth-First Search Solution Problem Understanding This problem asks us to find all shortest transformation sequences from beginWord to endWord , where each transformation changes exactly one character and every intermediate word must exist in wordList . We can think of the problem as navigating through a graph. Each word is a node, and two words are connected if they...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 317 - Shortest Distance from All Buildings

LeetCode Problem 317 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to find the optimal location to build a house on a grid so that the total travel distance to all existing buildings is minimized. The input is an m x n grid of integers where each cell is either empty land ( 0 ), a building ( 1 ), or an obstacle...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1293 - Shortest Path in a Grid with Obstacles Elimination

LeetCode Problem 1293 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to find the minimum number of steps required to move from the top-left corner of a grid to the bottom-right corner. The grid contains two kinds of cells: 0 , representing an empty cell that can be entered freely 1 , representing an obstacle Normally, obstacles block movement. However, we are allowed...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1315 - Sum of Nodes with Even-Valued Grandparent

LeetCode Problem 1315 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution That is a long, structured reference document and will exceed a single response comfortably. I can provide the complete guide in the exact format you requested. Before I start, one quick clarification: do you want the full solution guide for LeetCode 1315 - Sum of Nodes with Even-Valued Grandparent , including Problem Understanding, Approaches, Algorithm...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 928 - Minimize Malware Spread II

LeetCode Problem 928 Difficulty: 🔴 Hard Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem is about a network of computers represented as an undirected graph using an adjacency matrix. Each node represents a computer, and an edge between two nodes indicates a direct connection. Some nodes are initially infected with malware, and the infection spreads along the network: if a node is...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 530 - Minimum Absolute Difference in BST

LeetCode Problem 530 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree Solution Problem Understanding This problem gives us the root node of a Binary Search Tree, abbreviated as BST, and asks us to find the minimum absolute difference between the values of any two distinct nodes in the tree. A Binary Search Tree has a very important property: Every value in the left subtree...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 286 - Walls and Gates

LeetCode Problem 286 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us a 2D grid called rooms , where each cell represents one of three possible states. A value of -1 represents a wall or obstacle that cannot be passed through. A value of 0 represents a gate. A value of 2147483647 , which is referred to as INF , represents an empty room...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1483 - Kth Ancestor of a Tree Node

LeetCode Problem 1483 Difficulty: 🔴 Hard Topics: Binary Search, Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Design Solution Problem Understanding The problem gives us a rooted tree with n nodes labeled from 0 to n - 1 . Instead of providing the tree as adjacency lists or edges, the input is represented using a parent array. For every node i , parent[i] tells us which node is its...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 515 - Find Largest Value in Each Tree Row

LeetCode Problem 515 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to find the largest value in each row of a binary tree, where a row is defined as all nodes at the same depth. The input is the root of a binary tree, which may contain up to 10,000 nodes, and each node's value is a signed 32-bit integer....

Practice › LeetCode › LeetCode 01xx ›

LeetCode 111 - Minimum Depth of Binary Tree

LeetCode Problem 111 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to determine the minimum depth of a binary tree. In other words, given the root of a binary tree, we want to find the shortest path from the root node down to the nearest leaf node. A leaf node is explicitly defined as a node with no children, meaning...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 797 - All Paths From Source to Target

LeetCode Problem 797 Difficulty: 🟡 Medium Topics: Backtracking, Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding The problem gives us a directed acyclic graph, usually abbreviated as a DAG. The graph contains n nodes labeled from 0 to n - 1 . The graph is represented as an adjacency list, where graph[i] contains all nodes that can be reached directly from node i . Our task is to find...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 103 - Binary Tree Zigzag Level Order Traversal

LeetCode Problem 103 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to perform a level order traversal of a binary tree, but with a twist. Instead of always traversing each level from left to right, we alternate the traversal direction at every level. A normal level order traversal, also called Breadth-First Search (BFS), visits nodes level by level starting from the root....

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1161 - Maximum Level Sum of a Binary Tree

LeetCode Problem 1161 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding In this problem, we are given the root node of a binary tree. Every node belongs to a specific level in the tree. The root is at level 1 , its direct children are at level 2 , their children are at level 3 , and so on. Our goal is to compute...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 314 - Binary Tree Vertical Order Traversal

LeetCode Problem 314 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree Solution Problem Understanding The problem asks us to group the nodes of a binary tree by their vertical columns and return those groups from left to right. Each node in the tree belongs to a conceptual coordinate system: The root starts at column 0 Moving to the left child decreases the column index...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1236 - Web Crawler

LeetCode Problem 1236 Difficulty: 🟡 Medium Topics: String, Depth-First Search, Breadth-First Search, Interactive Solution Problem Understanding The problem asks us to implement a simplified web crawler. We are given a starting URL and access to an HtmlParser interface that can retrieve all URLs linked from a given webpage. Our task is to traverse the web graph beginning from startUrl , but with two important restrictions: We may only visit URLs...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 958 - Check Completeness of a Binary Tree

LeetCode Problem 958 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to determine whether a given binary tree is a complete binary tree . A complete binary tree has a specific structural property: every level, except possibly the last, is completely filled, and in the last level, all nodes appear as far left as possible. The input is the root of a...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 934 - Shortest Bridge

LeetCode Problem 934 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us an n x n binary matrix called grid . Each cell contains either 1 or 0 . A value of 1 represents land, and a value of 0 represents water. Land cells that are connected vertically or horizontally form an island. The problem guarantees that there are exactly two separate...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 737 - Sentence Similarity II

LeetCode Problem 737 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find Solution Problem Understanding This problem asks us to determine whether two sentences are considered similar based on a set of similarity relationships between words. Each sentence is represented as an array of strings, where each string is a single word. We are also given a list of word pairs, where each pair indicates that...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 924 - Minimize Malware Spread

LeetCode Problem 924 Difficulty: 🔴 Hard Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding In this problem, we are given an undirected graph represented as an adjacency matrix. Each node represents a computer in a network, and an edge between two nodes means those computers are directly connected. Some subset of nodes is initially infected with malware. Malware spreads through connections, meaning that if...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 112 - Path Sum

LeetCode Problem 112 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to determine whether a binary tree contains at least one valid root-to-leaf path whose node values add up to a given target sum. A binary tree consists of nodes where each node can have a left child and a right child. Each node also stores an integer value. The...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1273 - Delete Tree Nodes

LeetCode Problem 1273 Difficulty: 🟡 Medium Topics: Array, Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem provides a tree rooted at node 0 , represented in two parallel arrays: parent and value . The parent[i] array indicates the parent of the i-th node, with -1 denoting the root. The value[i] array gives the integer value of each node. The task is to remove all subtrees whose sum of...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 302 - Smallest Rectangle Enclosing Black Pixels

LeetCode Problem 302 Difficulty: 🔴 Hard Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding This problem gives us a binary matrix where each cell contains either '0' or '1' . A '1' represents a black pixel, while a '0' represents a white pixel. All black pixels belong to exactly one connected component, meaning every black pixel can be reached from every other black pixel using only...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 865 - Smallest Subtree with all the Deepest Nodes

LeetCode Problem 865 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem gives us the root of a binary tree and asks us to find the smallest subtree that contains all of the deepest nodes in the tree. The depth of a node is defined as the number of edges between that node and the root. The root itself has depth...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 364 - Nested List Weight Sum II

LeetCode Problem 364 Difficulty: 🟡 Medium Topics: Stack, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem gives us a nested list structure where each element can either be: A single integer Another nested list containing additional integers or lists The goal is to compute a weighted sum of all integers, but unlike the standard "Nested List Weight Sum" problem, the weighting is inverted. Normally, deeper integers receive larger weights....

Practice › LeetCode › LeetCode 04xx ›

LeetCode 417 - Pacific Atlantic Water Flow

LeetCode Problem 417 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us a rectangular grid called heights , where each cell represents the elevation of a piece of land. Water can flow from one cell to another if the neighboring cell has a height less than or equal to the current cell. Movement is allowed only in the four cardinal directions: up,...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 959 - Regions Cut By Slashes

LeetCode Problem 959 Difficulty: 🟡 Medium Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Let's dive into a full, detailed technical solution guide for LeetCode 959 - Regions Cut By Slashes following your formatting rules. Problem Understanding The problem gives us an n x n grid where each cell contains either a forward slash '/' , a backslash '\\' , or a blank space ' ' ....

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1376 - Time Needed to Inform All Employees

LeetCode Problem 1376 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem asks us to calculate the total time it takes for a piece of urgent information to propagate through a company hierarchy, starting from the head of the company. Each employee has a direct manager, forming a tree structure rooted at the head of the company. The manager array specifies the direct manager for...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 617 - Merge Two Binary Trees

LeetCode Problem 617 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to combine two binary trees into a single merged tree. Each tree consists of nodes where every node contains a value and pointers to a left and right child. The merge process starts from the roots of both trees and proceeds recursively through corresponding positions in the trees. Whenever...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 100 - Same Tree

LeetCode Problem 100 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to determine whether two binary trees are exactly the same. We are given the roots of two binary trees, p and q . A binary tree consists of nodes where each node contains a value and references to a left child and a right child. The task is to...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1462 - Course Schedule IV

LeetCode Problem 1462 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a directed acyclic graph representing course dependencies. Each course is a node, and a prerequisite relationship [a, b] means there is a directed edge from a to b . In other words, course a must be completed before course b . The important detail is that prerequisites are...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 399 - Evaluate Division

LeetCode Problem 399 Difficulty: 🟡 Medium Topics: Array, String, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Shortest Path Solution Problem Understanding This problem gives us a collection of equations between variables, where each equation represents a division relationship. For example, if we are given: a / b = 2.0 b / c = 3.0 then we can infer additional relationships such as: a / c = 6.0 c / a...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 787 - Cheapest Flights Within K Stops

LeetCode Problem 787 Difficulty: 🟡 Medium Topics: Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path Solution Here’s a complete, detailed technical solution guide for LeetCode 787, following your formatting instructions exactly. Problem Understanding The problem asks us to find the cheapest flight cost from a source city src to a destination city dst while taking at most k stops along the way. We are given...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1559 - Detect Cycles in 2D Grid

LeetCode Problem 1559 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem asks us to detect cycles in a 2D grid of characters where all cells in the cycle must contain the same character . A cycle is defined as a path that starts and ends at the same cell and has a length of four or more . Movement is allowed only...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1345 - Jump Game IV

LeetCode Problem 1345 Difficulty: 🔴 Hard Topics: Array, Hash Table, Breadth-First Search Solution Problem Understanding The problem is asking for the minimum number of steps required to reach the last index of an integer array, starting from the first index, given specific movement rules. You can move to the next index ( i + 1 ), the previous index ( i - 1 ), or any other index j where...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1102 - Path With Maximum Minimum Value

LeetCode Problem 1102 Difficulty: 🟡 Medium Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix Solution Problem Understanding The problem asks us to find the maximum possible score of a path from the top-left corner (0, 0) to the bottom-right corner (m-1, n-1) of a 2D grid. Each cell in the grid contains an integer value, and the score of a path is defined as the...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1042 - Flower Planting With No Adjacent

LeetCode Problem 1042 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding The problem presents n gardens, labeled from 1 to n , and a list of bidirectional paths connecting pairs of gardens. Each garden must be planted with one of four types of flowers (1 through 4). The constraint is that no two gardens connected by a path can have the same type of flower....

Practice › LeetCode › LeetCode 03xx ›

LeetCode 339 - Nested List Weight Sum

LeetCode Problem 339 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search Solution Problem Understanding This problem gives us a special nested data structure called NestedInteger . Each element in the input can either be: A single integer Another list containing more NestedInteger objects The goal is to compute a weighted sum where every integer is multiplied by the depth at which it appears. Depth starts at 1 for elements directly...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 499 - The Maze III

LeetCode Problem 499 Difficulty: 🔴 Hard Topics: Array, String, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution LeetCode 499 - The Maze III Problem Understanding This problem extends the mechanics introduced in earlier Maze problems, but adds two important complications. First, we are no longer looking for a simple reachable or unreachable answer. Instead, we must find the shortest path by travel distance. Second, if...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 815 - Bus Routes

LeetCode Problem 815 Difficulty: 🔴 Hard Topics: Array, Hash Table, Breadth-First Search Solution Problem Understanding This problem asks us to determine the minimum number of buses required to travel from a given starting bus stop ( source ) to a destination bus stop ( target ) given a set of bus routes. Each route is represented as a list of bus stops that a particular bus cycles through indefinitely. For...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 694 - Number of Distinct Islands

LeetCode Problem 694 Difficulty: 🟡 Medium Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Sorting, Matrix, Hash Function Solution Problem Understanding The problem gives us a binary matrix called grid , where each cell contains either 0 or 1 . A value of 1 represents land, and a value of 0 represents water. An island is formed by connecting adjacent land cells in the four cardinal directions: up, down,...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1202 - Smallest String With Swaps

LeetCode Problem 1202 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting Solution Problem Understanding The problem gives us a string s and a list of index pairs called pairs . Each pair [a, b] means we are allowed to swap the characters at positions a and b . The important detail is that swaps can be performed any number of times. This changes the...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 690 - Employee Importance

LeetCode Problem 690 Difficulty: 🟡 Medium Topics: Array, Hash Table, Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem provides a collection of employees where each employee contains three pieces of information: A unique employee ID An integer importance value A list of IDs representing their direct subordinates We are also given the ID of one employee, and we must calculate the total importance for that employee and everyone...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 863 - All Nodes Distance K in Binary Tree

LeetCode Problem 863 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution LeetCode 863 - All Nodes Distance K in Binary Tree Problem Understanding This problem gives us the root of a binary tree, a specific target node inside that tree, and an integer k . Our task is to return all node values whose distance from the target node is exactly k . The...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 433 - Minimum Genetic Mutation

LeetCode Problem 433 Difficulty: 🟡 Medium Topics: Hash Table, String, Breadth-First Search Solution Problem Understanding The problem describes a mutation process between genetic sequences. Each gene is represented as a string of exactly 8 characters, and every character must be one of four possible nucleotides: 'A' , 'C' , 'G' , or 'T' . We are given three inputs: startGene , the initial gene sequence endGene , the target gene...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 329 - Longest Increasing Path in a Matrix

LeetCode Problem 329 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix Solution Problem Understanding The problem gives us a two-dimensional grid of integers called matrix . Each position in the grid contains a value, and we are asked to find the length of the longest strictly increasing path. A path starts from any cell and moves one step at a time...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 653 - Two Sum IV - Input is a BST

LeetCode Problem 653 Difficulty: 🟢 Easy Topics: Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree Solution LeetCode 653, Two Sum IV - Input is a BST Problem Understanding This problem gives us the root of a Binary Search Tree (BST) and an integer k . We must determine whether there are two distinct nodes in the tree whose values add up to k ....

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1302 - Deepest Leaves Sum

LeetCode Problem 1302 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution That is a long, comprehensive reference document with multiple sections and full code in two languages. To keep quality high and avoid truncation, I should provide it in a canvas document. I’ll include all requested sections in one complete guide: Problem Understanding Approaches (brute force and optimal) Comparison table Algorithm Walkthrough with proof sketch Complete...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1361 - Validate Binary Tree Nodes

LeetCode Problem 1361 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Binary Tree Solution Problem Understanding The problem gives us n nodes labeled from 0 to n - 1 . For every node i , we are told which node is its left child and which node is its right child through the arrays leftChild and rightChild . If leftChild[i] = x , then node x...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 261 - Graph Valid Tree

LeetCode Problem 261 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem asks whether a given undirected graph forms a valid tree. A tree is a special type of graph with two important properties: The graph is fully connected, meaning every node can be reached from every other node. The graph contains no cycles. The input consists of two parts: n , the...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 279 - Perfect Squares

LeetCode Problem 279 Difficulty: 🟡 Medium Topics: Math, Dynamic Programming, Breadth-First Search Solution Problem Understanding The problem asks for the minimum number of perfect square numbers whose sum equals a given integer n . A perfect square is a number that can be written as x * x for some integer x . Examples include 1 , 4 , 9 , 16 , and 25 . The task is not...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 101 - Symmetric Tree

LeetCode Problem 101 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to determine whether a binary tree is symmetric around its center. A tree is symmetric if the left subtree is a mirror reflection of the right subtree. In a mirror relationship, the following conditions must hold: The values of the corresponding nodes must be equal. The left child of...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1203 - Sort Items by Groups Respecting Dependencies

LeetCode Problem 1203 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem asks us to sort n items while satisfying two different kinds of constraints at the same time. The first constraint comes from dependencies between items. If item a appears in beforeItems[b] , then item a must appear before item b in the final ordering. This is a classic dependency ordering...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 802 - Find Eventual Safe States

LeetCode Problem 802 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us a directed graph represented as an adjacency list. Each node represents a state, and each directed edge represents a possible transition from one node to another. The input graph[i] contains all nodes that can be reached directly from node i . If graph[i] is empty, then node i...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 505 - The Maze II

LeetCode Problem 505 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution Problem Understanding This problem presents a maze represented as a 2D grid of size m x n where each cell is either an empty space ( 0 ) or a wall ( 1 ). A ball starts at a given position and can roll up, down, left, or right...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 322 - Coin Change

LeetCode Problem 322 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Breadth-First Search Solution Problem Understanding The problem gives us an array called coins , where each element represents a coin denomination, and an integer called amount , which represents the target sum we want to construct. Our goal is to determine the minimum number of coins needed to make exactly amount . We are allowed to use each coin denomination...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 847 - Shortest Path Visiting All Nodes

LeetCode Problem 847 Difficulty: 🔴 Hard Topics: Dynamic Programming, Bit Manipulation, Breadth-First Search, Graph Theory, Bitmask Solution Problem Understanding The problem gives us an undirected and connected graph with n nodes labeled from 0 to n - 1 . The graph is represented as an adjacency list, where graph[i] contains all nodes directly connected to node i . We must compute the length of the shortest path that visits every...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1210 - Minimum Moves to Reach Target with Rotations

LeetCode Problem 1210 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding This problem models a shortest path search on a grid, but the moving object is not a single cell. Instead, the object is a snake that occupies exactly two adjacent cells. The snake begins in a horizontal orientation at positions (0,0) and (0,1) , and the goal is to move it to the bottom-right corner so...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1490 - Clone N-ary Tree

LeetCode Problem 1490 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search Solution LeetCode 1490 - Clone N-ary Tree Problem Understanding This problem asks us to create a deep copy of an N-ary tree. An N-ary tree is a tree where each node can have zero or more children, unlike a binary tree which limits each node to at most two children. Each node contains two fields: val...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 117 - Populating Next Right Pointers in Each Node II

LeetCode Problem 117 Difficulty: 🟡 Medium Topics: Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to populate the next pointer for every node in a binary tree so that it points to the node immediately to its right on the same level. If no such node exists, the next pointer should remain NULL . Unlike the easier version of this problem, where...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 752 - Open the Lock

LeetCode Problem 752 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Breadth-First Search Solution Problem Understanding The problem presents a lock with four wheels, each wheel labeled from '0' to '9' , which can rotate forwards or backwards. The lock starts at '0000' , and we are given a list of "deadends," which are lock states that will cause the lock to freeze if reached. The goal is to determine...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 431 - Encode N-ary Tree to Binary Tree

LeetCode Problem 431 Difficulty: 🔴 Hard Topics: Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree Solution Problem Understanding This problem asks us to design a reversible transformation between two different tree structures: An N-ary tree, where each node can have any number of children A binary tree, where each node has at most two children The important requirement is not how the encoding looks internally, but that the process is...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1091 - Shortest Path in Binary Matrix

LeetCode Problem 1091 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to find the shortest path from the top-left corner (0, 0) to the bottom-right corner (n-1, n-1) of a given n x n binary matrix grid . A cell with a value of 0 is passable, while a cell with a value of 1 is blocked. The path can move in any...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1242 - Web Crawler Multithreaded

LeetCode Problem 1242 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Concurrency Solution Problem Understanding The problem asks us to implement a multi-threaded web crawler that starts from a given URL startUrl and visits all URLs reachable from it, but only those that share the same hostname . We are given an interface HtmlParser that can return all URLs on a page through its getUrls(url) method. The goal is to...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 655 - Print Binary Tree

LeetCode Problem 655 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to transform a binary tree into a formatted 2D string matrix representation. Each node must appear in a specific row and column based on its position in the tree. The output is not simply a traversal order, it is a visual layout of the tree structure. We are given...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 987 - Vertical Order Traversal of a Binary Tree

LeetCode Problem 987 Difficulty: 🔴 Hard Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Sorting, Binary Tree Solution Problem Understanding The problem asks us to compute the vertical order traversal of a binary tree. In simpler terms, we are asked to “look at the tree from the side” and collect the nodes that align in the same vertical column. Each node has a position defined by (row, col) where row...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 269 - Alien Dictionary

LeetCode Problem 269 Difficulty: 🔴 Hard Topics: Array, String, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution LeetCode 269, Alien Dictionary Problem Understanding This problem asks us to reconstruct the ordering of characters in an unknown alien language. We are given a list of words that are already sorted according to the alien language's lexicographical order. The alphabet itself still uses lowercase English letters, but the order between letters...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 116 - Populating Next Right Pointers in Each Node

LeetCode Problem 116 Difficulty: 🟡 Medium Topics: Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to populate the next pointers of nodes in a perfect binary tree . A perfect binary tree has all levels completely filled; every internal node has exactly two children, and all leaves are at the same depth. The next pointer of a node should point to the...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1254 - Number of Closed Islands

LeetCode Problem 1254 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding This problem provides a 2D grid representing a map of land and water. Cells with 0 represent land, and cells with 1 represent water. An island is any contiguous region of land connected horizontally or vertically (not diagonally). A closed island is an island that is entirely surrounded by water on all four...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1020 - Number of Enclaves

LeetCode Problem 1020 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem gives us a binary matrix called grid , where: 0 represents water 1 represents land We can move only in four directions, up, down, left, and right. A land cell is considered an enclave if there is no possible path from that land cell to any boundary cell of the grid....

Practice › LeetCode › LeetCode 03xx ›

LeetCode 323 - Number of Connected Components in an Undirected Graph

LeetCode Problem 323 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem asks us to determine how many connected components exist in an undirected graph. A connected component is a group of nodes where every node can reach every other node through some path. If two groups of nodes have no path between them, they belong to different connected components. The input consists...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 107 - Binary Tree Level Order Traversal II

LeetCode Problem 107 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to traverse a binary tree and return the node values level by level, but in bottom-up order . Normally, a level order traversal collects values from the root down to the leaves. Here, we need to reverse that order and return the leaf levels first, moving up to the root. The...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 104 - Maximum Depth of Binary Tree

LeetCode Problem 104 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to determine the maximum depth of a binary tree. A binary tree consists of nodes where each node can have up to two children, a left child and a right child. The depth of a tree is defined as the number of nodes along the longest path from the...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 449 - Serialize and Deserialize BST

LeetCode Problem 449 Difficulty: 🟡 Medium Topics: String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Search Tree, Binary Tree Solution Problem Understanding The problem asks us to design two operations for a Binary Search Tree, abbreviated as BST: serialize(root) converts the BST into a string representation. deserialize(data) reconstructs the exact same BST from that string. The important requirement is that the deserialized tree must match the original tree structure and...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 993 - Cousins in Binary Tree

LeetCode Problem 993 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to determine whether two nodes in a binary tree are cousins. Two nodes are considered cousins if they satisfy two conditions simultaneously: They are located at the same depth in the tree. They have different parents. The input consists of: root , which is the root node of a...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 542 - 01 Matrix

LeetCode Problem 542 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Breadth-First Search, Matrix Solution Problem Understanding This problem gives us an m x n binary matrix where every cell contains either 0 or 1 . For every cell in the matrix, we must compute the distance to the nearest cell containing 0 . Distance is measured using Manhattan movement with four directions only: up, down, left, and right. Moving from...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 127 - Word Ladder

LeetCode Problem 127 Difficulty: 🔴 Hard Topics: Hash Table, String, Breadth-First Search Solution Problem Understanding This problem asks us to determine the length of the shortest transformation sequence between two words, beginWord and endWord , under a strict transformation rule. A valid transformation changes exactly one character at a time , and every intermediate word must exist inside the provided wordList . The beginWord itself does not need to appear...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 742 - Closest Leaf in a Binary Tree

LeetCode Problem 742 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to find the closest leaf node to a given target node k in a binary tree. The input is the root of a binary tree where each node has a unique integer value . A leaf node is defined as any node without children. The output is the value...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 785 - Is Graph Bipartite?

LeetCode Problem 785 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding The problem asks whether a given undirected graph is bipartite . In simpler terms, we are given a graph represented as an adjacency list graph , where graph[u] lists all nodes directly connected to node u . The goal is to determine if it is possible to split all nodes into two sets...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1443 - Minimum Time to Collect All Apples in a Tree

LeetCode Problem 1443 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem is asking for the minimum time required to collect all apples in a tree, where each edge traversal takes 1 second. You start and end at vertex 0. The tree is given as an undirected graph with n vertices, described using an edges array. Each edge connects two vertices ai and...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 404 - Sum of Left Leaves

LeetCode Problem 404 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem gives us the root node of a binary tree and asks us to compute the sum of all left leaves in the tree. A binary tree node may have up to two children, a left child and a right child. A leaf node is a node that has no children at...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 783 - Minimum Distance Between BST Nodes

LeetCode Problem 783 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree Solution Problem Understanding The problem asks us to find the minimum difference between values of any two nodes in a Binary Search Tree (BST). In other words, given a BST, we need to calculate the smallest absolute difference |a - b| where a and b are values of two distinct nodes. The input...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 675 - Cut Off Trees for Golf Event

LeetCode Problem 675 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Heap (Priority Queue), Matrix Solution Problem Understanding The problem gives us a two dimensional grid representing a forest. Every cell contains one of three possible values: 0 means the cell is blocked and cannot be entered. 1 means the cell is empty and can be walked through. Any value greater than 1 represents a tree, and the value itself is...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1096 - Brace Expansion II

LeetCode Problem 1096 Difficulty: 🔴 Hard Topics: Hash Table, String, Backtracking, Stack, Breadth-First Search, Sorting Solution Problem Understanding The problem asks us to interpret a string expression representing a set of words generated according to a specific grammar and return all distinct words sorted in lexicographical order. The expression can contain lowercase letters, curly braces {} , and commas , . The rules of the grammar are: A single lowercase...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1284 - Minimum Number of Flips to Convert Binary Matrix to Zero Matrix

LeetCode Problem 1284 Difficulty: 🔴 Hard Topics: Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to transform a given binary matrix mat into a zero matrix, where all elements are 0 . Each operation allows you to flip a cell and its four immediate neighbors (up, down, left, right). Flipping means changing a 1 to 0 or a 0 to 1 . The...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 582 - Kill Process

LeetCode Problem 582 Difficulty: 🟡 Medium Topics: Array, Hash Table, Tree, Depth-First Search, Breadth-First Search Solution Problem Understanding This problem models processes in an operating system as a tree structure. Every process has exactly one parent, except for the root process, which has no parent and is identified by ppid[i] = 0 . The input is given through two parallel arrays: pid[i] represents the ID of a process ppid[i] represents...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 743 - Network Delay Time

LeetCode Problem 743 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Path Solution Problem Understanding This problem models a directed weighted graph. Each node represents a computer in the network, and each directed edge represents the time required for a signal to travel from one node to another. The input times contains edges in the format: (ui, vi, wi) where: ui is the source...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1319 - Number of Operations to Make Network Connected

LeetCode Problem 1319 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding This problem models a computer network as an undirected graph. Each computer is a node, and each ethernet cable is an edge connecting two nodes. The goal is to determine the minimum number of cable rewirings needed to make the entire network fully connected. A network is considered fully connected if every computer...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1379 - Find a Corresponding Node of a Binary Tree in a Clone of That Tree

LeetCode Problem 1379 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The traversal is by reference, not value.

Practice › LeetCode › LeetCode 02xx ›

LeetCode 226 - Invert Binary Tree

LeetCode Problem 226 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem gives the root node of a binary tree and asks us to invert the tree. Inverting a binary tree means swapping the left and right child of every node in the tree. For example, if a node originally has: left child = 2 right child = 7 after inversion it becomes:...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 662 - Maximum Width of Binary Tree

LeetCode Problem 662 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to compute the maximum width among all levels of a binary tree. The important detail is that the width is not simply the number of non-null nodes at a level. Instead, the width must include the positions of missing nodes that would exist if the tree were represented as...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 200 - Number of Islands

LeetCode Problem 200 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem gives us a two dimensional grid where each cell contains either '1' or '0' . A cell containing '1' represents land, while a cell containing '0' represents water. An island is defined as a group of connected land cells. Two land cells belong to the same island only if they are...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 886 - Possible Bipartition

LeetCode Problem 886 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution Problem Understanding This problem asks whether it is possible to divide n people into exactly two groups such that no pair of people who dislike each other end up in the same group. The input contains: An integer n , representing people labeled from 1 to n A list dislikes , where each pair [a,...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 637 - Average of Levels in Binary Tree

LeetCode Problem 637 Difficulty: 🟢 Easy Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding In this problem, we are given the root node of a binary tree, and we need to compute the average value of all nodes at each depth level of the tree. A binary tree is organized into levels. The root node is at level 0 , its children are at level 1 ,...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1087 - Brace Expansion

LeetCode Problem 1087 Difficulty: 🟡 Medium Topics: String, Backtracking, Stack, Breadth-First Search, Sorting Solution Problem Understanding In this problem, we are given a string that represents multiple possible words. Each position in the word may contain either a single fixed character or a set of alternative characters enclosed in curly braces. For example: a{b,c}d means: The first character is always 'a' The second character can be either 'b' or 'c'...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 529 - Minesweeper

LeetCode Problem 529 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to simulate one move in the classic Minesweeper game. We are given a two dimensional grid representing the current game board, along with the coordinates of a user click. Our task is to update the board according to the rules of Minesweeper. Each cell on the board contains one of...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 909 - Snakes and Ladders

LeetCode Problem 909 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem is asking us to simulate a modified game of Snakes and Ladders on an n x n board. The board is labeled from 1 to n² in a boustrophedon pattern, which means the numbering starts from the bottom-left, alternates direction every row, and ends at the top-right. You start at square 1 , and...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1568 - Minimum Number of Days to Disconnect Island

LeetCode Problem 1568 Difficulty: 🔴 Hard Topics: Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Component Solution Problem Understanding The problem gives us a binary matrix where each cell is either land ( 1 ) or water ( 0 ). Land cells that touch vertically or horizontally belong to the same island. A grid is considered connected only when there is exactly one island in the entire grid. Every day,...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1466 - Reorder Routes to Make All Paths Lead to the City Zero

LeetCode Problem 1466 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding The problem gives us a directed graph of cities connected by roads. There are n cities numbered from 0 to n - 1 , and exactly n - 1 roads. Since the graph contains n - 1 edges and there is exactly one path between any pair of cities, the graph forms a tree....

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1306 - Jump Game III

LeetCode Problem 1306 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search Solution LeetCode 1306 - Jump Game III Problem Understanding The problem gives us an array of non-negative integers and a starting index. From any position i , we are allowed to jump either forward to i + arr[i] or backward to i - arr[i] . The goal is to determine whether it is possible to eventually land on...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2092 - Find All People With Secret

LeetCode Problem 2092 Difficulty: 🔴 Hard Topics: Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Sorting Solution Problem Understanding The problem describes a network of people who meet at different times. Whenever a person who already knows a secret participates in a meeting, they immediately share the secret with the other participant. The key detail is that sharing is instantaneous within the same timestamp. This means if someone learns the secret...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1034 - Coloring A Border

LeetCode Problem 1034 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us a two dimensional grid where each cell contains an integer representing a color. We are also given a starting position, (row, col) , and a new color value. The cell at grid[row][col] belongs to some connected component. A connected component is formed by cells that: Have the same original color...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 721 - Accounts Merge

LeetCode Problem 721 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find, Sorting Solution Problem Understanding This problem asks us to merge user accounts based on shared email addresses. Each account is represented as a list of strings. The first string is the user's name, and every remaining string is an email address associated with that account. The important detail is that two accounts belong to...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 749 - Contain Virus

LeetCode Problem 749 Difficulty: 🔴 Hard Topics: Array, Depth-First Search, Breadth-First Search, Matrix, Simulation Solution Problem Understanding This problem models the spread of a virus on a two-dimensional grid. Each cell is either infected ( 1 ) or uninfected ( 0 ). The virus spreads every night from infected cells to adjacent uninfected cells in the four cardinal directions: up, down, left, and right. We are allowed to build walls...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 854 - K-Similar Strings

LeetCode Problem 854 Difficulty: 🔴 Hard Topics: Hash Table, String, Breadth-First Search Solution Problem Understanding The problem asks us to determine the minimum number of swaps needed to transform one string into another, where both strings are anagrams of each other. A single operation consists of swapping any two characters in s1 . The goal is to make s1 exactly equal to s2 using as few swaps as possible. Because...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 297 - Serialize and Deserialize Binary Tree

LeetCode Problem 297 Difficulty: 🔴 Hard Topics: String, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree Solution Problem Understanding The problem asks us to design two complementary operations for a binary tree: serialization and deserialization. Serialization converts a binary tree into a string representation that can be stored or transmitted. Deserialization performs the reverse operation, reconstructing the exact same binary tree structure from the serialized string. The important detail is...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 672 - Bulb Switcher II

LeetCode Problem 672 Difficulty: 🟡 Medium Topics: Math, Bit Manipulation, Depth-First Search, Breadth-First Search Solution Problem Understanding The problem describes a room containing n light bulbs, where every bulb starts in the on state. There are four buttons available, and each button flips a specific subset of bulbs. Flipping means changing on to off or off to on . The four buttons behave as follows: Button 1 flips every bulb....

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1519 - Number of Nodes in the Sub-Tree With the Same Label

LeetCode Problem 1519 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Counting Solution Problem Understanding The problem gives us a tree with n nodes numbered from 0 to n - 1 . The tree is represented by an array of edges , where each edge connects two nodes ai and bi . Each node also has a label, represented as a string labels , where labels[i] is...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1660 - Correct a Binary Tree

LeetCode Problem 1660 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Here is a complete, detailed technical solution guide for LeetCode 1660 - Correct a Binary Tree , formatted exactly as requested. Problem Understanding The problem presents a binary tree that has a subtle defect: there is exactly one invalid node , whose right child incorrectly points to another node on the same depth...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1430 - Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree

LeetCode Problem 1430 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem asks us to determine whether a given array of integers arr represents a valid sequence from the root to a leaf in a binary tree. Each node in the tree has a value between 0 and 9, and a valid sequence is defined as a path starting from the root node...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1263 - Minimum Moves to Move a Box to Their Target Location

LeetCode Problem 1263 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Heap (Priority Queue), Matrix Solution Problem Understanding The problem is a variant of the classic "Sokoban" puzzle. You are given a grid representing a warehouse, where a player 'S' must push a box 'B' to a target location 'T' . The player can move in four directions on free floor tiles '.' but cannot walk through walls '#' or the...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 407 - Trapping Rain Water II

LeetCode Problem 407 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Heap (Priority Queue), Matrix Solution LeetCode 407 - Trapping Rain Water II Problem Understanding This problem is the two dimensional version of the classic "Trapping Rain Water" problem. Instead of a one dimensional array of heights, we are given an m x n grid where each cell represents the elevation of a block in a terrain. The goal is to...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 839 - Similar String Groups

LeetCode Problem 839 Difficulty: 🔴 Hard Topics: Array, Hash Table, String, Depth-First Search, Breadth-First Search, Union-Find Solution Problem Understanding The problem asks us to determine the number of similarity groups within a list of strings. Two strings are defined as similar if they are either identical or if we can swap exactly two letters in one string to make it equal to the other. For example, "tars" and "rats" are...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1311 - Get Watched Videos by Your Friends

LeetCode Problem 1311 Difficulty: 🟡 Medium Topics: Array, Hash Table, Breadth-First Search, Graph Theory, Sorting Solution Problem Understanding This problem models a social network as an undirected graph. Each person is represented by an integer ID from 0 to n - 1 . The friends array describes the graph connections, while watchedVideos[i] contains the list of videos watched by person i . The goal is to find all videos watched...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1298 - Maximum Candies You Can Get from Boxes

LeetCode Problem 1298 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Graph Theory Solution Problem Understanding The problem asks us to determine the maximum number of candies we can collect from a set of boxes with varying accessibility. Each box may be open or closed initially, may contain candies, keys to other boxes, and additional boxes inside it. We start with a set of initial boxes, and we can only open...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1457 - Pseudo-Palindromic Paths in a Binary Tree

LeetCode Problem 1457 Difficulty: 🟡 Medium Topics: Bit Manipulation, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to count how many root to leaf paths in a binary tree are "pseudo-palindromic". A palindrome is a sequence that reads the same forward and backward. For example, [1,2,1] and [3,4,4,3] are palindromes. The important property of a palindrome is that at most one value may appear...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 488 - Zuma Game

LeetCode Problem 488 Difficulty: 🔴 Hard Topics: String, Dynamic Programming, Stack, Breadth-First Search, Memoization Solution Problem Understanding The problem models a recursive elimination game played on a row of colored balls. The board is represented as a string where each character corresponds to a colored ball. The available colors are 'R' , 'Y' , 'B' , 'G' , and 'W' . You are also given another string called hand ,...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1602 - Find Nearest Right Node in Binary Tree

LeetCode Problem 1602 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to find the nearest node to the right of a given node u on the same level of a binary tree. A binary tree is organized into levels. The root is on level 0 , its children are on level 1 , their children are on level 2 , and so...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1197 - Minimum Knight Moves

LeetCode Problem 1197 Difficulty: 🟡 Medium Topics: Breadth-First Search Solution Problem Understanding This problem asks us to compute the minimum number of moves a knight needs to travel from the origin [0, 0] to a target position [x, y] on an infinite chessboard. The knight moves in an "L-shape," which means it can move two squares in one cardinal direction (up, down, left, right) and one square in the perpendicular...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 711 - Number of Distinct Islands II

LeetCode Problem 711 Difficulty: 🔴 Hard Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Sorting, Matrix, Hash Function Solution Problem Understanding In this problem, we are given a binary matrix where each cell contains either 0 or 1 . A value of 1 represents land, while 0 represents water. An island is formed by connecting adjacent land cells in the four cardinal directions: up, down, left, and right. The...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1123 - Lowest Common Ancestor of Deepest Leaves

LeetCode Problem 1123 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding This problem asks us to find the lowest common ancestor, abbreviated as LCA, of all the deepest leaf nodes in a binary tree. A leaf node is any node with no children. The depth of the root is 0 , and every level downward increases the depth by 1 . The...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 130 - Surrounded Regions

LeetCode Problem 130 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem gives us a two dimensional grid called board , where each cell contains either 'X' or 'O' . The goal is to modify the board in place by capturing every region of 'O' cells that is completely surrounded by 'X' . A region is formed by connecting adjacent 'O' cells horizontally...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 765 - Couples Holding Hands

LeetCode Problem 765 Difficulty: 🔴 Hard Topics: Greedy, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory Solution LeetCode 765 - Couples Holding Hands Problem Understanding This problem gives us a row of seats represented by the array row , where each value is the ID of the person currently sitting in that seat. The row contains 2n people, meaning there are exactly n couples. The couples are predefined in a very...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1245 - Tree Diameter

LeetCode Problem 1245 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding The problem asks us to find the diameter of a tree , which is defined as the number of edges in the longest path between any two nodes. We are given an undirected tree represented as a list of edges. Each edge connects two nodes, labeled from 0 to n -...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1377 - Frog Position After T Seconds

LeetCode Problem 1377 Difficulty: 🔴 Hard Topics: Tree, Depth-First Search, Breadth-First Search, Graph Theory Solution Problem Understanding This problem describes a frog moving through an undirected tree. A tree is a connected graph with no cycles, which means there is exactly one path between any two vertices. The frog always starts at node 1 . Every second, the frog must jump to one of its unvisited neighboring nodes. If there...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 967 - Numbers With Same Consecutive Differences

LeetCode Problem 967 Difficulty: 🟡 Medium Topics: Backtracking, Breadth-First Search Solution Problem Understanding The problem asks us to generate all integers of length n such that the absolute difference between every two consecutive digits is exactly k . The input consists of two integers: n , the number of digits the integers must have, and k , the difference constraint between consecutive digits. The output is an array of integers...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1485 - Clone Binary Tree With Random Pointer

LeetCode Problem 1485 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution That’s a detailed reference guide with multiple required sections and full implementations. Before I start, please confirm one detail: Do you want the complete guide for LeetCode 1485 in a single response , including all sections (Problem Understanding, Approaches, Algorithm Walkthrough, Python Solution, Go Solution, Worked Examples, Complexity Analysis, Test Cases, and Edge...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1730 - Shortest Path to Get Food

LeetCode Problem 1730 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to find the shortest path from a starting location to any food cell in a 2D grid. The grid consists of four types of cells: '*' indicating your starting position, '#' representing food, 'O' as free space you can move through, and 'X' as obstacles you cannot traverse. The output should be...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1654 - Minimum Jumps to Reach Home

LeetCode Problem 1654 Difficulty: 🟡 Medium Topics: Array, Hash Table, Breadth-First Search Solution Problem Understanding This problem asks us to find the minimum number of jumps required for a bug to move from position 0 to position x on a one dimensional number line. The bug follows several movement rules: It may jump forward by exactly a units. It may jump backward by exactly b units. It may not perform...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 301 - Remove Invalid Parentheses

LeetCode Problem 301 Difficulty: 🔴 Hard Topics: String, Backtracking, Breadth-First Search Solution Problem Understanding The problem asks us to remove the minimum number of invalid parentheses from a string so that the remaining string becomes valid. The input string may contain lowercase English letters in addition to parentheses. Letters do not affect validity and should always remain in the resulting strings unless they are removed as part of a broader...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 429 - N-ary Tree Level Order Traversal

LeetCode Problem 429 Difficulty: 🟡 Medium Topics: Tree, Breadth-First Search Solution Problem Understanding The problem asks us to perform a level order traversal of an n-ary tree. In other words, we need to return the values of the tree nodes grouped by their depth. The root node represents level 0, its immediate children are level 1, their children are level 2, and so on. The input is an n-ary tree...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 827 - Making A Large Island

LeetCode Problem 827 Difficulty: 🔴 Hard Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding This problem asks us to find the largest possible island size in a binary grid after changing at most one 0 into 1 . The grid is an n x n matrix where: 1 represents land 0 represents water An island is formed by land cells connected in the four cardinal directions: up...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1368 - Minimum Cost to Make at Least One Valid Path in a Grid

LeetCode Problem 1368 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution LeetCode 1368 - Minimum Cost to Make at Least One Valid Path in a Grid Problem Understanding This problem gives us a two dimensional grid where every cell contains a directional sign. The sign tells us which neighboring cell we should move to next. The four possible directions are: 1 means...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1162 - As Far from Land as Possible

LeetCode Problem 1162 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Breadth-First Search, Matrix Solution Problem Understanding The problem requires finding the water cell in a given n x n grid that is farthest from any land cell, using Manhattan distance. The grid consists only of 0 s and 1 s, where 0 represents water and 1 represents land. The Manhattan distance between two cells (x0, y0) and (x1, y1) is...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 310 - Minimum Height Trees

LeetCode Problem 310 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem gives us an undirected tree with n nodes labeled from 0 to n - 1 . The input edges describes the connections between nodes, and because the graph is guaranteed to be a tree, several important properties immediately hold true. A tree with n nodes always has exactly n -...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 994 - Rotting Oranges

LeetCode Problem 994 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution LeetCode 994, Rotting Oranges Problem Statement You are given a 2D grid where each cell represents one of three possible states: 0 means the cell is empty. 1 means the cell contains a fresh orange. 2 means the cell contains a rotten orange. Every minute, any fresh orange that is directly adjacent to a rotten orange becomes rotten...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 778 - Swim in Rising Water

LeetCode Problem 778 Difficulty: 🔴 Hard Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix Solution Problem Understanding In this problem, we are given an n x n grid where each cell contains a unique integer representing its elevation. Rain begins falling, and the water level rises over time. At any time t , you are allowed to stand on or move through any cell whose...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1261 - Find Elements in a Contaminated Binary Tree

LeetCode Problem 1261 Difficulty: 🟡 Medium Topics: Hash Table, Tree, Depth-First Search, Breadth-First Search, Design, Binary Tree Solution Problem Understanding The problem gives us a binary tree where every node value has been contaminated and replaced with -1 . However, we know the exact rule that originally generated the values in the tree. The original tree followed these rules: The root node always had value 0 If a node had...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 199 - Binary Tree Right Side View

LeetCode Problem 199 Difficulty: 🟡 Medium Topics: Tree, Depth-First Search, Breadth-First Search, Binary Tree Solution Problem Understanding The problem gives us the root node of a binary tree and asks us to determine which nodes are visible when looking at the tree from the right side. A binary tree is a hierarchical data structure where each node can have at most two children, called the left child and the right...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 210 - Course Schedule II

LeetCode Problem 210 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem asks us to determine a valid order in which courses can be completed given prerequisite relationships between them. You are given numCourses , which represents the total number of courses labeled from 0 to numCourses - 1 . You are also given a list called prerequisites , where each entry...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 207 - Course Schedule

LeetCode Problem 207 Difficulty: 🟡 Medium Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort Solution Problem Understanding This problem models course dependencies as a directed graph. Each course is represented as a node, and each prerequisite relationship is represented as a directed edge. If prerequisites[i] = [a, b] , that means course b must be completed before course a . In graph terms, there is a directed edge from...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1036: Escape a Large Maze

Problem Restatement We have a 10^6 x 10^6 grid. Some cells are blocked. We are given: blocked : list of blocked cells. source : starting cell. target : target cell. We need to return true if source can reach target , or false if it is impossible. The official constraints state that 0 <= blocked.length <= 200 , and cells are given as [r, c] . Input and Output Item...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1042: Flower Planting With No Adjacent

Problem Restatement We have n gardens labeled 1 to n and paths between some gardens. Each garden must be assigned one of 4 flower types ( 1 to 4 ). No two adjacent gardens (connected by a path) can have the same flower type. Since each node has at most 3 neighbors (guaranteed by the problem), a valid assignment always exists. Return a valid assignment as an array answer where...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1087: Brace Expansion

Problem Restatement We are given a string s representing a word with the following format: A single letter c means the set {c} . A brace expression {a,b,c,...} means choose one of the letters. Consecutive groups are concatenated. Return all strings generated by the pattern in sorted order. The official constraints state that 1 <= s.length <= 50 . Input and Output Item Meaning Input Pattern string s Output Sorted...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1034: Coloring A Border

Problem Restatement We are given an m x n integer matrix grid and three integers row , col , and color . We need to color the border of the connected component that contains cell (row, col) with the given color . A border cell of a connected component is any cell that is either on the edge of the grid or has at least one neighbor that is not...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1020: Number of Enclaves

Problem Restatement We are given a binary matrix grid where 0 represents sea and 1 represents land. A move consists of walking from one land cell to an adjacent (4-directional) land cell. We need to return the number of land cells from which it is impossible to walk off the boundary of the grid. Land cells connected to the boundary are not counted. The official constraints state that m ==...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1091: Shortest Path in Binary Matrix

Problem Restatement We are given an n x n binary matrix grid . A clear path goes from (0, 0) to (n-1, n-1) using only cells with value 0 , moving in 8 directions. Return the length of the shortest clear path, or -1 if no such path exists. The path length counts the number of cells visited. The official constraints state that n == grid.length == grid[i].length , 1...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 847: Shortest Path Visiting All Nodes

Problem Restatement We are given an undirected connected graph with n nodes labeled from 0 to n - 1 . The graph is given as an adjacency list: graph[i] contains all nodes directly connected to node i . We need to return the length of the shortest path that visits every node at least once. Important details: Rule Meaning Start We may start at any node End We may stop...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 924: Minimize Malware Spread

Problem Restatement We are given an undirected graph with n nodes. The graph is represented by an adjacency matrix: graph[i][j] == 1 means node i is directly connected to node j . Some nodes are initially infected with malware. These nodes are listed in: initial Malware spreads through connected edges. If one node in a connected component is infected, eventually every node in that component becomes infected. We must remove...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 967: Numbers With Same Consecutive Differences

Problem Restatement We are given two integers: n k Return all integers with exactly n digits such that the absolute difference between every two consecutive digits is exactly k . Numbers must not have leading zeros. The answer may be returned in any order. The official constraints are: Constraint Value n 2 <= n <= 9 k 0 <= k <= 9 Source: LeetCode problem statement. Input and Output Item...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 919: Complete Binary Tree Inserter

Problem Restatement We need to design a class called CBTInserter . It is initialized with the root of a complete binary tree. A complete binary tree has every level full except possibly the last level, and the last level is filled from left to right. The class must support: Method Meaning CBTInserter(root) Initialize with an existing complete binary tree insert(val) Insert a new node while keeping the tree complete, and...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 841: Keys and Rooms

Problem Restatement We are given n rooms numbered from 0 to n - 1 . All rooms are locked except room 0 . Each room contains keys. A key is represented by an integer, and key x unlocks room x . When we enter a room, we can take all keys inside it. Return True if we can visit every room. Otherwise, return False . Input and Output Item Meaning...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 994: Rotting Oranges

Problem Restatement We are given an m x n grid. Each cell can have one of three values: Value Meaning 0 Empty cell 1 Fresh orange 2 Rotten orange Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten. The four directions are: up, down, left, right Diagonal cells do not count. We need to return the minimum number of minutes needed until no fresh...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 993: Cousins in Binary Tree

Problem Restatement We are given the root of a binary tree with unique values. We are also given two different values: x y Both values exist in the tree. We need to return True if the nodes with values x and y are cousins. Two nodes are cousins if: Condition Meaning Same depth They are on the same tree level Different parents They do not share the same immediate parent...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 749: Contain Virus

Problem Restatement We are given a 2D grid representing infected and uninfected cells. Each cell is one of: Value Meaning 0 Uninfected 1 Infected -1 Quarantined infected region Every night: Each infected region spreads to neighboring uninfected cells. We may choose exactly one infected region to quarantine. Quarantining a region requires building walls along its border. A quarantined region no longer spreads. We always quarantine the region that would infect...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 742: Closest Leaf in a Binary Tree

Problem Restatement We are given the root of a binary tree and an integer k . The value k exists somewhere in the tree. We need to return the value of the leaf node closest to the node whose value is k . A leaf node is a node with no children. Distance means the number of edges between nodes. The closest leaf may be: inside the target node's subtree,...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 913: Cat and Mouse

Problem Restatement We are given an undirected graph. Mouse starts at node 1 . Cat starts at node 2 . The hole is node 0 . Mouse moves first. Then Cat moves. They alternate turns. On each turn, the current player must move along one graph edge. Cat is not allowed to move into node 0 . The game ends in one of three ways: Result Condition Mouse wins Mouse...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 987: Vertical Order Traversal of a Binary Tree

Problem Restatement We are given the root of a binary tree. Each node has a coordinate: Node Position Root (row = 0, col = 0) Left child (row + 1, col - 1) Right child (row + 1, col + 1) We need to return the vertical order traversal of the tree. That means: Visit columns from left to right. Inside each column, visit nodes from top to bottom. If...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 675: Cut Off Trees for Golf Event

Problem Restatement We are given a forest represented as a 2D grid. Each cell has one of these meanings: Value Meaning 0 Obstacle, cannot be walked through 1 Empty ground, can be walked through > 1 Tree, can be walked through, value is the tree height We start at position (0, 0) . We must cut all trees in increasing order of height, from shortest to tallest. After a tree...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 958: Check Completeness of a Binary Tree

Problem Restatement We are given the root of a binary tree. We need to determine whether the tree is a complete binary tree. A complete binary tree has these properties: Every level except possibly the last is completely filled. All nodes in the last level are as far left as possible. Return true if the tree is complete. Otherwise, return false . The official problem states this exact definition: every...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 934: Shortest Bridge

Problem Restatement We are given an n x n binary matrix grid . Each cell is either: 0 or: 1 A 1 represents land. A 0 represents water. An island is a group of 1 s connected in four directions: up down left right The grid contains exactly two islands. We may flip water cells from 0 to 1 . Return the smallest number of water cells we must flip...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 909: Snakes and Ladders

Problem Restatement We are given an n x n board for a Snakes and Ladders game. The squares are numbered from 1 to n^2 in a boustrophedon order. That means the numbering starts from the bottom-left square, goes left to right on one row, then right to left on the next row, alternating direction each row. From a square curr , one dice roll can move to any square from:...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 733: Flood Fill

Problem Restatement We are given an image represented as a 2D grid of integers. Each integer is a pixel color. We are also given: sr sc color sr and sc describe the starting pixel: image[sr][sc] We need to perform a flood fill from that starting pixel. Flood fill changes the starting pixel and every pixel connected to it with the same original color. Connection is only 4-directional: up down left...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 637: Average of Levels in Binary Tree

Problem Restatement We are given the root of a binary tree. We need to return an array where each element is the average value of all nodes on one level of the tree. The first value is the average of the root level. The second value is the average of the next level. The result continues from top to bottom. Answers within 10^-5 of the actual answer are accepted. The...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 662: Maximum Width of Binary Tree

Problem Restatement We are given the root of a binary tree. We need to return the maximum width among all levels of the tree. The width of a level is measured between the leftmost and rightmost non-null nodes on that level. However, null nodes between those two endpoints are also counted, as if the tree were placed inside a complete binary tree. Input and Output Item Meaning Input The root...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 928: Minimize Malware Spread II

Problem Restatement We are given an undirected graph with n nodes. The graph is represented as an adjacency matrix: graph[i][j] == 1 means node i is directly connected to node j . Some nodes are initially infected by malware. These nodes are listed in: initial Malware spreads through edges. If an infected node is connected to an uninfected node, the uninfected node also becomes infected. This continues until no more...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 547: Number of Provinces

Problem Restatement We are given an n x n matrix called isConnected . There are n cities. If: isConnected[i][j] == 1 then city i and city j are directly connected. A province is a group of cities that are directly or indirectly connected to each other, with no city outside the group connected to them. We need to return the number of provinces. This is the same as counting connected...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 542: 01 Matrix

Problem Restatement We are given an m x n binary matrix mat . Each cell contains either 0 or 1 . For every cell, we need to return the distance to the nearest cell containing 0 . The distance between two cells sharing an edge is 1 . So movement is allowed only in four directions: up, down, left, right Diagonal movement is not allowed. The problem guarantees that the...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 827: Making A Large Island

Problem Restatement We are given an n x n binary grid. Each cell is either: Value Meaning 0 Water 1 Land An island is a group of land cells connected in four directions: up, down, left, right We may change at most one 0 into 1 . Return the largest possible island size after doing this operation. If the grid is already all land, we return the size of the...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 559: Maximum Depth of N-ary Tree

Problem Restatement We are given the root of an N-ary tree. An N-ary tree is a tree where each node may have any number of children. We need to return the maximum depth of the tree. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. If the tree is empty, the depth is 0 . The constraints...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 529: Minesweeper

Problem Restatement We are given a Minesweeper board and a clicked cell. Each cell can contain one of these characters: Character Meaning "M" An unrevealed mine "E" An unrevealed empty square "B" A revealed blank square with no adjacent mines "1" to "8" A revealed square showing the number of adjacent mines "X" A revealed mine After the click, we must update the board according to the Minesweeper rules. If...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 365: Water and Jug Problem

Problem Restatement We are given two jugs with capacities x liters and y liters. There is an infinite water supply. We need to decide whether it is possible to measure exactly target liters using the two jugs. At the end, the total amount of water in both jugs must be exactly target . Allowed operations: Operation Meaning Fill Fill either jug completely Empty Empty either jug completely Pour Pour from...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 286: Walls and Gates

Problem Restatement We are given an m x n grid called rooms . Each cell has one of three values: Value Meaning -1 Wall or obstacle 0 Gate 2147483647 Empty room, also called INF We need to fill each empty room with the distance to its nearest gate. Distance is the number of steps needed to reach a gate by moving only up, down, left, or right. If an empty...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 100: Same Tree

Problem Restatement We are given the roots of two binary trees: p q We need to check whether the two trees are the same. Two binary trees are the same if: Requirement Meaning Same structure Every node position exists in both trees or in neither tree Same values Corresponding nodes have equal values The official statement defines two binary trees as the same when they are structurally identical and their...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 200: Number of Islands

Problem Restatement We are given an m x n grid. Each cell is one of two characters: Character Meaning "1" Land "0" Water We need to count how many islands exist in the grid. An island is a group of land cells connected horizontally or vertically. Diagonal connection does not count. The official problem asks for the number of islands in a binary grid of land and water. Input and...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 199: Binary Tree Right Side View

Problem Restatement We are given the root of a binary tree. Imagine standing on the right side of the tree. From that view, at each depth, only the rightmost node is visible. We need to return the visible node values from top to bottom. The official problem asks for the values of nodes visible from the right side of the binary tree. Input and Output Item Meaning Input Root of...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 339: Nested List Weight Sum

Problem Restatement We are given a nested list of integers called nestedList . Each element is either: Type Meaning Integer A single number List A nested list that may contain integers or more lists The depth of an integer is the number of lists it is inside. Return the sum of every integer multiplied by its depth. The problem examples include [[1,1],2,[1,1]] -> 10 , [1,[4,[6]]] -> 27 , and...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 279: Perfect Squares

Problem Restatement We are given an integer n . We need to return the least number of perfect square numbers whose sum is exactly n . A perfect square is a number like: 1, 4, 9, 16, 25 because: 1 = 1 * 1 4 = 2 * 2 9 = 3 * 3 16 = 4 * 4 25 = 5 * 5 For example, for n = 12...

#breadth-first-search

LeetCode 3924 - Minimum Threshold Path With Limited Heavy Edges

LeetCode 3666 - Minimum Operations to Equalize Binary String

LeetCode 3910 - Count Connected Subgraphs with Even Node Sum

LeetCode 3905 - Multi Source Flood Fill

LeetCode 3820 - Pythagorean Distance Nodes in a Tree

LeetCode 3831 - Median of a Binary Search Tree Level

LeetCode 3787 - Find Diameter Endpoints of a Tree

LeetCode 3629 - Minimum Jumps to Reach End via Prime Teleportation

LeetCode 3568 - Minimum Moves to Clean the Classroom

LeetCode 3310 - Remove Methods From Project

LeetCode 3710 - Maximum Partition Factor

LeetCode 3807 - Minimum Cost to Repair Edges to Traverse a Graph

LeetCode 3690 - Split and Merge Array Transformation

LeetCode 3528 - Unit Conversion I

LeetCode 3419 - Minimize the Maximum Edge Weight of Graph

LeetCode 3619 - Count Islands With Total Value Divisible by K

LeetCode 3607 - Power Grid Maintenance

LeetCode 3552 - Grid Teleportation Traversal

LeetCode 3535 - Unit Conversion II

LeetCode 3493 - Properties Graph

LeetCode 3481 - Apply Substitutions

LeetCode 3376 - Minimum Time to Break Locks I

LeetCode 3372 - Maximize the Number of Target Nodes After Connecting Trees I

LeetCode 1992 - Find All Groups of Farmland

LeetCode 2556 - Disconnect Path in a Binary Matrix by at Most One Flip

LeetCode 1905 - Count Sub Islands

LeetCode 2617 - Minimum Number of Visited Cells in a Grid

LeetCode 2577 - Minimum Time to Visit a Cell In a Grid

LeetCode 2641 - Cousins in Binary Tree II

LeetCode 3283 - Maximum Number of Moves to Kill All Pawns

LeetCode 2360 - Longest Cycle in a Graph

LeetCode 3373 - Maximize the Number of Target Nodes After Connecting Trees II

LeetCode 2773 - Height of Special Binary Tree

LeetCode 2998 - Minimum Number of Operations to Make X and Y Equal

LeetCode 2471 - Minimum Number of Operations to Sort a Binary Tree by Level

LeetCode 2204 - Distance to a Cycle in Undirected Graph

LeetCode 3286 - Find a Safe Walk Through a Grid

LeetCode 3015 - Count the Number of Houses at a Certain Distance I

LeetCode 2146 - K Highest Ranked Items Within a Price Range

LeetCode 2492 - Minimum Score of a Path Between Two Cities

LeetCode 1926 - Nearest Exit from Entrance in Maze

LeetCode 2503 - Maximum Number of Points From Grid Queries

LeetCode 2608 - Shortest Cycle in a Graph

LeetCode 1993 - Operations on Tree

LeetCode 2612 - Minimum Reverse Operations

LeetCode 3387 - Maximize Amount After Two Days of Conversions

LeetCode 3243 - Shortest Distance After Road Addition Queries I

LeetCode 2039 - The Time When the Network Becomes Idle

LeetCode 2415 - Reverse Odd Levels of Binary Tree

LeetCode 2596 - Check Knight Tour Configuration

LeetCode 2852 - Sum of Remoteness of All Cells

LeetCode 2192 - All Ancestors of a Node in a Directed Acyclic Graph

LeetCode 3123 - Find Edges in Shortest Paths

LeetCode 2059 - Minimum Operations to Convert Number

LeetCode 2658 - Maximum Number of Fish in a Grid

LeetCode 2583 - Kth Largest Sum in a Binary Tree

LeetCode 2045 - Second Minimum Time to Reach Destination

LeetCode 3141 - Maximum Hamming Distances

LeetCode 3383 - Minimum Runes to Add to Cast Spell

LeetCode 2328 - Number of Increasing Paths in a Grid

LeetCode 2814 - Minimum Time Takes to Reach Destination Without Drowning

LeetCode 1971 - Find if Path Exists in Graph

LeetCode 2101 - Detonate the Maximum Bombs

LeetCode 2316 - Count Unreachable Pairs of Nodes in an Undirected Graph

LeetCode 3203 - Find Minimum Diameter After Merging Two Trees

LeetCode 2258 - Escape the Spreading Fire

LeetCode 2858 - Minimum Edge Reversals So Every Node Is Reachable

LeetCode 2277 - Closest Node to Path in Tree

LeetCode 2493 - Divide Nodes Into the Maximum Number of Groups

LeetCode 2458 - Height of Binary Tree After Subtree Removal Queries

LeetCode 2685 - Count the Number of Complete Components

LeetCode 2290 - Minimum Obstacle Removal to Reach Corner

LeetCode 3235 - Check if the Rectangle Corner Is Reachable

LeetCode 2467 - Most Profitable Path in a Tree

LeetCode 2368 - Reachable Nodes With Restrictions

LeetCode 2385 - Amount of Time for Binary Tree to Be Infected

LeetCode 2445 - Number of Nodes With Value One

LeetCode 2477 - Minimum Fuel Cost to Report to the Capital

LeetCode 2174 - Remove All Ones With Row and Column Flips II