Will the Guru

  • BFS and DFS

    BFS and DFS

    Breadth-First Search Breadth-First search is commonly used to find the shortest path from the root node to target node. Implementation Note that we used visited hash set to skip adding duplicate nodes, but there are some cases where one does not need the visited hash. Depth-First Search Depth-First search can be used to find the… Read more

  • Tree Traversal

    Tree Traversal

    Tree is a frequently used data structure that simulates a tree structure. Each node of the tree will have a root value and a list of subtrees of child nodes. There are 3 different ways to traverse all nodes in the tree. Pre-order Traversal (NLR) Visit the root node first. Then, visit the left subtree.… Read more

Availability (2) Binary Search Tree (2) Consistency (2) Design Doc (1) DFS (3) Durability (2) Dynamic Programming (4) Graph (7) HashMap (3) Linked List (3) List (2) Monotonic (3) MSA (2) Performance (2) Prefix Sum (4) Rate Limiter (3) Replication (2) Scalability (3) Sliding Window (8) System Design (22) Thread (2) Trie (3) Two Pointers (3) Union-Find (6) WebSocket (2) ⭐️ (6) ⭐️⭐️ (4) ⭐️⭐️⭐️ (11) ⭐️⭐️⭐️⭐️ (24) ⭐️⭐️⭐️⭐️⭐️ (41)