Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

ML & Data Science

Interview Corner

CS Subjects

Software and Tools

School Learning

Practice Coding Problems

Tutorials

DSA / Placements

Development

Cloud / DevOps

All Courses

Courses

JavaScript

Languages

GfG 160

GfG 360

Core Subjects

Interview Questions

Interview Puzzles

Aptitude and Reasoning

Interview Preparation

Data Analytics

Complete Data Science

Full-Stack Web Dev

Software Testing

CyberSecurity

Dev Skills

Computer Fundamentals

AI Tools

MS Excel & Google Sheets

MS Word & Google Docs

Tools

Maths For Computer Science

Tracks

We have earlier discussed Breadth First Traversal Algorithm for Graphs. We have also discussed Applications of Depth First Traversal. In this article, applications of Breadth First Search are discussed.1) Shortest Path and Minimum Spanning Tree for unweighted graph In an unweighted graph, the shortest path is the path with least number of edges. With Breadth First, we always reach a vertex from given source using the minimum number of edges. Also, in case of unweighted graphs, any spanning tree is Minimum Spanning Tree and we can use either Depth or Breadth first traversal for finding a spanning tree.Applications of Breadth First Traversal: <a href="https://www.geeksforgeeks.org/applications-of-breadth-first-traversal/">https://www.geeksforgeeks.org/applications-of-breadth-first-traversal/</a>

Applications of Breadth First Traversal

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Graph but also build up problem-solving skills. You are given an Undirected Graph having unit weight of the edges, find the shortest path from src to all the vertex and if it is unreachable to reach any vertex, then return -1 for that vertex.Examples :Input:
n = 9, m = 10
edges=[[0,1],[0,3],[3,4],[4,5],[5,6],[1,2],[2,6],[6,7],[7,8],[6,8]] 
src=0
Output:
0 1 2 1 2 3 3 4 4Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/shortest-path-in-undirected-graph-having-unit-distance/1">https://practice.geeksforgeeks.org/problems/shortest-path-in-undirected-graph-having-unit-distance/1</a>

PROBLEM OF THE DAY : 21/08/2024 | Shortest Path in Undirected Graph

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Tree but also build up problem-solving skills. Given a binary tree and a&nbsp;node data called target. Find the minimum time required to burn the complete binary tree if the target is set on fire.&nbsp;It is known that in 1 second all nodes connected to a given node get burned. That is its left child, right child, and parent. Note: The tree contains unique values. Examples :&nbsp;Input: &nbsp; &nbsp; &nbsp;
 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;1
 &nbsp; &nbsp; &nbsp; &nbsp;/ &nbsp; \
 &nbsp; &nbsp; &nbsp;2 &nbsp; &nbsp; &nbsp;3
 &nbsp; &nbsp;/ &nbsp;\ &nbsp; &nbsp; &nbsp;\
 &nbsp; 4 &nbsp; &nbsp;5 &nbsp; &nbsp; &nbsp;6
 &nbsp; &nbsp; &nbsp; / \ &nbsp; &nbsp; &nbsp;\
 &nbsp; &nbsp; &nbsp;7 &nbsp; 8 &nbsp; &nbsp; &nbsp;9
 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; \
 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 10
Target Node = 8
Output: 7
Explanation: If leaf with the value 8 is set on fire. 
After 1 sec: 5 is set on fire.
After 2 sec: 2, 7 are set to fire.
After 3 sec: 4, 1 are set to fire.
After 4 sec: 3 is set to fire.
After 5 sec: 6 is set to fire.
After 6 sec: 9 is set to fire.
After 7 sec: 10 is set to fire.
It takes 7s to burn the complete tree.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/burning-tree/1">https://practice.geeksforgeeks.org/problems/burning-tree/1</a>

PROBLEM OF THE DAY : 20/08/2024 | Burning Tree

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print the top view of it. The output nodes can be printed in any order.A node x is there in output if x is the topmost node at its horizontal distance. Horizontal distance of left child of a node x is equal to horizontal distance of x minus 1, and that of right child is horizontal distance of x plus 1.Print Nodes in Top View of Binary Tree : <a href="https://www.geeksforgeeks.org/print-nodes-top-view-binary-tree/">https://www.geeksforgeeks.org/print-nodes-top-view-binary-tree/</a>

Print Nodes in Top View of Binary Tree

Welcome to the daily solving of our PROBLEM OF THE DAY with Jay Dalsaniya We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Graph but also build up problem-solving skills. You are given a square&nbsp;binary grid. A grid is considered binary if every value in the grid is either&nbsp;1 or 0.&nbsp;You can change&nbsp;at most one&nbsp;cell in the grid from&nbsp;0 to 1.&nbsp;You need to find the largest group of connected&nbsp; 1's.&nbsp;Two cells are said to be connected if both are&nbsp;adjacent&nbsp;to each other and both have the same value.Examples :Input: grid = [1, 1]
 &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp;[0, 1]
 Output: 4
 Explanation: By changing cell (2,1), we can obtain a connected group of 4 1's
 [1, 1]
 [1, 1]Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/maximum-connected-group/1">https://practice.geeksforgeeks.org/problems/maximum-connected-group/1</a>

PROBLEM OF THE DAY : 11/07/2024 | Maximum Connected group

Explore the problem of finding the distance to the nearest cell containing '1' in a binary matrix with our comprehensive tutorial. This guide is perfect for computer science students, programmers, and anyone interested in mastering algorithms for matrix manipulation and shortest path problems.In this tutorial, you'll learn:<ul><li>Understanding the Problem: Gain a foundational understanding of the task, which involves calculating the minimum distance from each cell in a binary matrix to the nearest cell containing '1'. This distance is measured in terms of the number of cell moves horizontally or vertically.</li><li>Breadth-First Search (BFS) Approach: Learn why BFS is the most suitable approach for this problem, given its ability to explore all nodes at the present depth level before moving on to nodes at the next depth level, ensuring the shortest path is found.</li><li>Using a Queue for BFS: Explore how to use a queue to facilitate BFS in the matrix, where each cell containing '1' is initially enqueued, and distances are propagated from these cells.</li><li>Algorithm Steps:<ol><li>Initialization: Initialize a distance matrix of the same dimensions as the input matrix, with all values set to infinity (or a large number) except for cells containing '1', which are set to zero.</li><li>Enqueue All '1's: Push all cells containing '1' into the queue, as these are the starting points for BFS.</li><li>BFS Traversal: Dequeue each cell, and for each of its 4 possible neighbors (up, down, left, right), update their distances if a shorter path is found and enqueue them.</li></ol></li><li>Step-by-Step Code Implementation: Detailed code examples in popular programming languages like Python, Java, and C++. These examples will demonstrate how to implement the BFS algorithm to solve the problem efficiently.</li><li>Complexity Analysis: Discuss the time complexity of the BFS approach, which is 𝑂(𝑛×𝑚)O(n×m), where 𝑛n is the number of rows and 𝑚m is the number of columns in the matrix. The space complexity is also 𝑂(𝑛×𝑚)O(n×m) due to the additional distance matrix and the queue.</li><li>Handling Edge Cases: Tips on managing edge cases such as a matrix with no '1's, a matrix with all '1's, and ensuring the algorithm handles large matrices efficiently.</li><li>Practical Examples and Testing: Provide practical examples and test cases to demonstrate the function and verify its correctness across different scenarios.</li></ul>By the end of this tutorial, you’ll be well-equipped to solve the problem of finding the distance to the nearest cell containing '1' in a binary matrix, enhancing your understanding of BFS and matrix manipulation techniques.For a comprehensive guide on finding the distance to the nearest cell containing '1' in a binary matrix, including detailed explanations, code examples, and practical tips, check out our full article at <a href="https://www.geeksforgeeks.org/distance-nearest-cell-1-binary-matrix/">https://www.geeksforgeeks.org/distance-nearest-cell-1-binary-matrix/</a>.This tutorial will not only improve your understanding of BFS and matrix operations but also prepare you to tackle similar challenges in your software development and algorithmic problem-solving efforts.

Distance of nearest cell having 1 | DSA Problem

Learn how to determine whether a binary tree is a complete tree or not with our comprehensive tutorial on the "Check if a Given Binary Tree is a Complete Tree or Not" problem. Whether you're a beginner in data structures or an experienced programmer, understanding this concept is crucial for efficiently analyzing and working with binary trees.In this tutorial, you'll discover:<ul><li style="margin-left:0px;">Problem Definition: Understand the definition of a complete binary tree and the criteria for determining whether a given binary tree satisfies the conditions of completeness.</li><li style="margin-left:0px;">Key Characteristics: Learn about the key characteristics of a complete binary tree, including the arrangement of nodes at each level and the presence of nodes in the last level.</li><li style="margin-left:0px;">Algorithmic Approach: Explore the algorithmic approach used to determine whether a binary tree is complete, including techniques for traversing the tree and checking its properties.</li><li style="margin-left:0px;">Implementation Guide: Follow a detailed implementation guide with step-by-step explanations of how to write code to check if a given binary tree is complete in popular programming languages like Python, Java, and C++.</li><li style="margin-left:0px;">Edge Cases Handling: Learn how to handle edge cases and special scenarios that may arise when analyzing binary trees for completeness, ensuring robustness and accuracy in your implementation.</li><li style="margin-left:0px;">Time and Space Complexity: Analyze the time and space complexity of the algorithm, enabling you to assess its efficiency and scalability for different tree sizes.</li></ul>By mastering the techniques presented in this tutorial, you'll be equipped to confidently determine whether a binary tree is a complete tree or not, facilitating better decision-making in various tree-related applications.For a comprehensive exploration of checking the completeness of a binary tree, complete with detailed explanations and code examples, check out the full article at <a href="https://www.geeksforgeeks.org/check-if-a-given-binary-tree-is-complete-tree-or-not/">https://www.geeksforgeeks.org/check-if-a-given-binary-tree-is-complete-tree-or-not/</a>.This tutorial will enhance your understanding of binary tree properties and algorithms, empowering you to tackle complex tree-related problems with ease.

Complete Binary Tree | DSA Problem

Delve into the intricate structure of binary trees with our insightful tutorial on how to "Check if Two Nodes are Cousins in a Binary Tree." Whether you're a budding programmer or a seasoned developer, this guide will empower you to navigate the complexities of binary tree relationships with confidence.Here's what you'll uncover in this tutorial:<ol><li>Understanding Binary Trees: Gain a solid understanding of binary tree fundamentals, including nodes, parent-child relationships, and tree traversal techniques.</li><li>Cousins in Binary Trees: Explore the concept of cousins in binary trees and understand what distinguishes them from other node relationships.</li><li>Problem Statement: Define the problem of determining whether two nodes in a binary tree are cousins and its significance in tree analysis.</li><li>Algorithmic Approach: Learn effective algorithms and strategies for identifying cousin nodes in a binary tree, including depth-based traversal and node comparison.</li><li>Implementation Guide: Follow step-by-step instructions and coding examples in popular programming languages to implement the cousin node detection algorithm.</li><li>Visual Representation: Visualize binary tree structures and cousin node relationships through diagrams and illustrations for enhanced comprehension.</li></ol>By mastering the intricacies of cousin node detection in binary trees, you'll sharpen your algorithmic skills and deepen your understanding of tree data structures.For a detailed exploration of how to check if two nodes are cousins in a binary tree, complete with code snippets and implementation guidance, delve into our comprehensive article at <a href="https://www.geeksforgeeks.org/check-two-nodes-cousins-binary-tree/">https://www.geeksforgeeks.org/check-two-nodes-cousins-binary-tree/</a>.Embark on this enlightening journey to unravel the mysteries of binary tree relationships and elevate your programming prowess!

Check if two Nodes are Cousins | DSA Problem

Explore the fascinating concept of burning a tree starting from a leaf node with our comprehensive tutorial on "Minimum Time to Burn a Tree." This tutorial is perfect for those interested in understanding the intricacies of tree traversal and burning algorithms.In this tutorial, you'll uncover:<ol><li>Introduction to Burning a Tree: Delve into the concept of burning a tree from a leaf node, understanding the dynamics and challenges involved.</li><li>Minimum Time Calculation: Learn how to calculate the minimum time required to burn the entire tree, considering factors such as distances and traversal techniques.</li><li>Optimal Strategies: Explore optimal strategies and algorithms for efficient tree burning, ensuring minimal time and resource consumption.</li><li>Step-by-Step Implementation: Follow along with step-by-step implementation examples in various programming languages, gaining practical insights into burning algorithms.</li><li>Real-world Applications: Discover real-world applications and use cases where understanding tree burning algorithms is crucial for problem-solving.</li></ol>By mastering the minimum time to burn a tree, you'll enhance your understanding of tree traversal and burning algorithms, essential for various computer science and programming tasks.For detailed explanations and code implementations, check out our full article at <a href="https://www.geeksforgeeks.org/minimum-time-to-burn-a-tree-starting-from-a-leaf-node/">https://www.geeksforgeeks.org/minimum-time-to-burn-a-tree-starting-from-a-leaf-node/</a>.Join us on this enlightening journey as we unravel the mysteries of burning a tree starting from a leaf node!

Burning Tree | DSA Problem

Embark on a journey through graph theory and topological sorting with this insightful guide from GeeksforGeeks. In this illuminating article, you'll explore essential concepts and algorithms for arranging the nodes of a directed graph in such a way that all edges go from left to right, a critical skill for various applications such as task scheduling, dependency resolution, and algorithmic problem-solving.Discover the principles behind directed acyclic graphs (DAGs) and topological ordering algorithms as you delve into the intricacies of graph traversal. Whether you're a coding enthusiast or a seasoned developer, mastering the art of efficiently performing topological sorting is essential for optimizing workflow management and solving real-world problems.Prepare to elevate your problem-solving skills and algorithmic proficiency as you explore detailed explanations and practical examples for performing topological sorting. Unlock the full potential of graph analysis and workflow optimization in your projects by delving into the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/topological-sorting/">https://www.geeksforgeeks.org/topological-sorting/</a>

Course Schedule | DSA Problem

Embark on a journey through dynamic programming and graph traversal with this insightful guide from GeeksforGeeks on the snake and ladder problem. In this illuminating article, you'll explore essential concepts and algorithms for efficiently determining the minimum number of dice rolls required to reach the destination square on a snake and ladder board, a classic problem in recreational mathematics and algorithmic problem-solving.Discover the principles behind dynamic programming and graph representation techniques as you delve into algorithms and methods for navigating the snake and ladder board. Whether you're a coding enthusiast or a seasoned developer, mastering the art of efficiently solving the snake and ladder problem is essential for optimizing computational resources and solving real-world problems.Prepare to elevate your problem-solving skills and algorithmic proficiency as you explore detailed explanations and practical examples for finding the minimum number of dice rolls. Unlock the full potential of dynamic programming and graph traversal in your projects by delving into the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/snake-ladder-problem-2/">https://www.geeksforgeeks.org/snake-ladder-problem-2/</a>

Snake and Ladder Problem | DSA Problem

Embark on an illuminating journey into the realm of graph traversal with our comprehensive tutorial on Breadth-First Search (BFS). In this extensive guide, we delve deep into the intricacies of graph traversal, providing you with a thorough understanding of the BFS algorithm and its applications.Join us as we navigate through the complexities of graph manipulation, guiding you step-by-step through the process of efficiently traversing a graph using BFS. Whether you're a novice programmer or an experienced developer looking to deepen your understanding of graph algorithms, this tutorial offers invaluable insights and practical applications.For additional insights and detailed explanations, be sure to explore the accompanying article on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/">https://www.geeksforgeeks.org/breadth-first-search-or-bfs-for-a-graph/</a>Empower yourself with enhanced programming proficiency and master the nuances of graph traversal. Happy coding and exploring the diverse possibilities of algorithms!

BFS of graph | DSA Problem

Practice Problems

Linux