Aug 3, 2025 · 4 min read · BFS Given a connected undirected graph containing V vertices, represented by a 2-d adjacency list adj[][], where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0,...
Join discussionJul 25, 2025 · 2 min read · Problem Statement Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, construct and return the binary tree. (link) Example 1: Input: preorder ...
Join discussionJun 22, 2025 · 4 min read · Problem Statement Given the root of a binary tree, calculate the vertical order traversal of the binary tree. For each node at position (row, col), its left and right children will be at positions (row + 1, col - 1) and (row + 1, col + 1) respectivel...
Join discussionMay 21, 2025 · 2 min read · 🔸 Introduction Talk briefly about tree traversal problems and how vertical traversal adds a twist. Mention that this is a Hard-level problem and requires careful ordering based on multiple dimensions — horizontal level, depth, and node values. Pro...
Join discussionSep 22, 2024 · 7 min read · Here we illustrates the implementation of DFS iteratively using stacks. For the recursive implementation of DFS refere this article. Preorder Traversal Problem Given the root of a binary tree, return the preorder traversal of its nodes' values. (link...
Join discussion
Jul 27, 2024 · 3 min read · Construction of Linked List Input: n = 5 arr = [1,2,3,4,5] Output: 1 2 3 4 5 Explanation: Linked list for the given array will be 1->2->3->4->5 Here, the head points to a dummy which doesn't store anything. Later, when we return the new head pointer...
Join discussion
May 2, 2024 · 8 min read · https://medium.com/@subhradeep_saha/solving-a-leetcode-problem-daily-day-5-diagonal-traverse-17b173927e95 Here is the Leetcode problem: https://leetcode.com/explore/learn/card/array-and-string/202/introduction-to-2d-array/1167/ Problem Statement ...
Join discussion
Mar 29, 2023 · 7 min read · Let's have a look at some more traversals which are not that standard but will help you to expand your control over Binary trees. Spiral Traversal In this traversal, we need to print the nodes in a zig-zag format. As you can see in the above example...
Join discussion