This tutorial explains the FIFO principle of queues with everyday analogies, compares stacks and queues, lists core operations, provides a full Python implementation, demonstrates real‑world scenarios like server requests and printer jobs, and highlights common beginner pitfalls.
This article explains how to implement breadth‑first (BFS) and depth‑first (DFS) traversals—including level‑order, preorder, inorder, and postorder—on a binary tree in Java 17, covering both recursive and iterative approaches, performance considerations, and a lazy Iterable wrapper.
The article systematically explains the most common algorithms—search, sorting, two‑pointer, hash, recursion, graph traversal, greedy and dynamic programming—detailing their principles, typical use cases, real‑world code examples, and practical advice for when to apply or avoid them in everyday software development.
This article explores why top engineers speak concisely, then dives into the classic LeetCode "Rotten Oranges" BFS interview question, providing a clear Java implementation, step‑by‑step analysis, and key takeaways for mastering grid‑based graph traversal.
This article provides a step‑by‑step guide to learning Python data structures, covering basic concepts, built‑in types, hands‑on practice, advanced structures, algorithm relationships, resources, community engagement, and continuous self‑challenge to improve problem‑solving skills.
This article explains the breadth‑first search algorithm step by step, modeling a 0/1 grid as a graph, showing how a queue and a visited set work, and providing a complete Python implementation that finds the shortest path in a maze.
The article humorously discusses Huawei cafeteria competition before presenting LeetCode problem 102, which requires a breadth‑first level order traversal of a binary tree, and provides complete Java, C++, C, and Python implementations that use a queue to process each tree level.
The article explains how to obtain the rightmost node values at each depth of a binary tree by performing a level‑order (BFS) traversal, and provides a complete Go implementation that records the last node of every level as the right‑side view.
This article explains how to determine the maximum number of Linux distributions in a connected group by modeling the relationships as an adjacency matrix and applying BFS or DFS to count the largest connected component, with full Python implementations and complexity analysis.
Given an N×N adjacency matrix representing direct connections among N servers, the task is to determine the minimum number of servers that must initiate a broadcast so every server receives the message, with solutions using BFS or DFS to count connected components and detailed Python implementations plus time‑space analysis.
This article explains the 2023Q1A "Happy Elimination" problem, where a binary matrix must be turned all zeros by clicking cells that toggle themselves and their eight neighbors, and shows how to compute the minimum number of clicks with BFS or DFS counting connected components.
This article explains the 2023B problem of locating the maximum‑value mine cluster on a grid of '0', '1', and '2' cells, provides BFS and DFS solutions in Python, and details input format, examples, and time‑space complexity.
This article explains how to determine the shortest waiting time required to perform integration testing on a specific microservice when services have startup dependencies and individual load times, using a BFS‑based topological sort algorithm with a detailed Python implementation and complexity analysis.
The article presents a grid‑based Mars terraforming problem where cells are marked YES, NO, or NA, and asks to determine the minimum number of solar days needed to convert all convertible (NO) cells to habitable (YES) using a multi‑source BFS approach, returning –1 if impossible, with full Python implementation and complexity analysis.
This article explains a graph‑based interview problem where, given an undirected network of N nodes and their connections, you must determine the minimum time for a broadcast node to receive all responses, and provides a full Python BFS solution with complexity analysis.
This article introduces the basic concepts of graphs, including vertices, edges, directed and undirected types, explains common storage methods such as adjacency matrices and adjacency lists with examples, and demonstrates graph traversal techniques like depth‑first and breadth‑first search using Java code.
This article details the end‑to‑end algorithmic strategy our team used to rank third in a multi‑robot competition, covering task analysis, distance‑based scheduling, custom collision detection, A* and DWA path planning, Euclidean distance transforms, radar‑based enemy tracking, and the final round’s dual‑team tactics, complete with code snippets and performance insights.
This article explains the classic "Number of Islands" problem, presents two example grids, and demonstrates how depth‑first search (DFS) and breadth‑first search (BFS) can be applied to count isolated land masses in a 2D matrix.
This tutorial explains how to create a fully interactive 3D maze game using CSS3D properties, matrix transformations, JavaScript mouse and keyboard controls, and a BFS algorithm to compute and display the shortest path within the maze.
This article explains Linux's sophisticated scheduling system for multi‑core, SMP, and NUMA architectures, describes global, clustered, partitioned, and arbitrary schedulers, details scheduling domains and load‑balancing mechanisms, and provides practical performance‑tuning techniques using tools like perf, flame graphs, and various kernel optimizations.
Given a four‑wheel combination lock with digits 0‑9, the task is to find the minimum number of rotations needed to reach a target combination while avoiding a list of dead‑end states, using a breadth‑first search algorithm illustrated with Java code examples.
This article explains how graph traversal algorithms like BFS and DFS underpin web crawlers, illustrating the concepts with examples from China's road network and tracing the history from Euler's bridges to modern internet indexing.
