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

Algebra

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

Excel

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

DSA / Placements

DA / Data Science & AI

Development

DevOps Course

All Courses

Courses

ML & Data Science

CS Subjects

Software and Tools

School Learning

Tutorials

Interview Corner

Practice DSA

GfG 160

Interview Prep

Depth-first search (DFS) is an algorithm (or technique) for traversing a graph.Following are the problems that use DFS as a building block. &nbsp;1) Detecting cycle in a graph&nbsp; A graph has cycle if and only if we see a back edge during DFS. So we can run DFS for the graph and check for back edges. (See this for details)Applications of Depth First Search: <a href="https://www.geeksforgeeks.org/applications-of-depth-first-search/">https://www.geeksforgeeks.org/applications-of-depth-first-search/</a>&nbsp;

Applications of Depth First Search

A directed graph is strongly connected if there is a path between all pairs of vertices. A strongly connected component (SCC) of a directed graph is a maximal strongly connected subgraph. For example, there are 3 SCCs in the following graph.We can find all strongly connected components in O(V+E) time using Kosaraju’s algorithm. Following is detailed Kosaraju’s algorithm.1) Create an empty stack ‘S’ and do DFS traversal of a graph. In DFS traversal, after calling recursive DFS for adjacent vertices of a vertex, push the vertex to stack. In the above graph, if we start DFS from vertex 0, we get vertices in stack as 1, 2, 4, 3, 0.Kosaraju's Algorithm - Strongly Connected Components: <a href="https://www.geeksforgeeks.org/strongly-connected-components/">https://www.geeksforgeeks.org/strongly-connected-components/</a>

Kosaraju's Algorithm - Strongly Connected Components

Given a directed graph, check whether the graph contains a cycle or not. Your function should return true if the given graph contains at least one cycle, else return false.Example:Input: n = 4, e = 6&nbsp; 0 -&gt; 1, 0 -&gt; 2, 1 -&gt; 2, 2 -&gt; 0, 2 -&gt; 3, 3 -&gt; 3&nbsp; Output: Yes Detect Cycle in a Directed graph using colors: <a href="https://www.geeksforgeeks.org/detect-cycle-direct-graph-using-colors/">https://www.geeksforgeeks.org/detect-cycle-direct-graph-using-colors/</a>

Detect Cycle in a Directed graph using colors

Welcome to the daily solving of our PROBLEM OF THE DAY with Karan Mashru 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.Given a grid of size n*m (n is the number of rows and m is the number of columns in the grid) consisting of '0's (Water)&nbsp;and '1's(Land). Find the number of islands. Note:&nbsp;An island is either surrounded by water or the boundary of a grid and is formed by connecting adjacent lands horizontally or vertically or diagonally i.e., in all 8 directions.Examples:Input: grid = [[0,1],[1,0],[1,1],[1,0]]
Output: 1
Explanation:
The grid is-
0 1
1 0
1 1
1 0
All lands are connected.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1">https://practice.geeksforgeeks.org/problems/find-the-number-of-islands/1</a>

PROBLEM OF THE DAY : 06/10/2024 | Find the number of islands

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 fundamentals and applications of Depth First Search (DFS) for a graph with our comprehensive tutorial. This guide is perfect for computer science students, programmers, and anyone interested in understanding graph traversal techniques, which are crucial for solving various computational problems.In this tutorial, you'll learn:<ul><li>Understanding Depth First Search (DFS): Gain a foundational understanding of DFS, a graph traversal algorithm that explores as far as possible along each branch before backtracking. This technique is used to visit all the vertices and edges of a graph in a systematic manner.</li><li>Graph Representation: Learn how to represent graphs using adjacency lists or adjacency matrices, which are essential for implementing DFS. Understand the differences and use cases for each representation.</li><li>DFS Algorithm: Detailed explanation of the DFS algorithm, including the use of a stack (either implicit via recursion or explicit) to manage the traversal process. Explore the concept of visiting nodes and marking them to avoid revisiting.</li><li>Recursive and Iterative Implementations: Step-by-step code examples demonstrating both recursive and iterative implementations of DFS in popular programming languages like Python, Java, and C++.</li><li>Handling Connected and Disconnected Graphs: Learn how to apply DFS to both connected and disconnected graphs. This includes understanding how to initiate DFS from each unvisited node to ensure all components of a disconnected graph are covered.</li><li>Applications of DFS: Explore various applications of DFS, such as:<ul><li>Pathfinding and Maze Solving: Using DFS to find paths in mazes and networks.</li><li>Topological Sorting: Implementing topological sorting for directed acyclic graphs (DAGs) using DFS.</li><li>Cycle Detection: Detecting cycles in both directed and undirected graphs using DFS.</li><li>Finding Connected Components: Identifying all connected components in an undirected graph.</li></ul></li><li>Complexity Analysis: Discuss the time and space complexities of DFS. Typically, DFS operates in 𝑂(𝑉+𝐸)O(V+E) time, where 𝑉V is the number of vertices and 𝐸E is the number of edges. Space complexity is 𝑂(𝑉)O(V) due to the stack and visited list.</li><li>Edge Cases and Considerations: Tips on handling edge cases such as graphs with no edges, self-loops, and large graphs where recursion depth might be a concern.</li><li>Visual Demonstrations: Include diagrams to visually demonstrate how DFS traverses a graph, helping to clarify the steps involved and the order in which nodes are visited.</li><li>Best Practices: Insights into best practices for implementing DFS, including avoiding infinite loops, efficiently managing memory, and ensuring all nodes are correctly marked as visited.</li></ul>By the end of this tutorial, you’ll have a thorough understanding of how to implement and apply DFS in various scenarios, enhancing your problem-solving skills and your ability to work with graph data structures.For a comprehensive guide on Depth First Search (DFS) for a graph, including detailed explanations, code examples, and practical tips, check out our full article at <a href="https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/">https://www.geeksforgeeks.org/depth-first-search-or-dfs-for-a-graph/</a>.This tutorial will not only enhance your understanding of graph traversal algorithms but also prepare you to tackle a wide range of problems in computer science and software development.

DFS of Graph | DSA Problem

Explore how to find all possible paths between a given source and destination in a graph with our comprehensive tutorial. This guide is perfect for computer science students, programmers, and anyone interested in learning about graph traversal techniques and their applications in solving complex computational problems.In this tutorial, you'll learn:<ul><li>Understanding Graphs and Paths: Gain a foundational understanding of graphs, including directed and undirected graphs, and what constitutes a path in a graph. Learn about the significance of paths in various applications like network routing, circuit design, and more.</li><li>Graph Representation: Learn how to represent graphs in your program using adjacency lists or adjacency matrices, which are critical for implementing graph traversal algorithms.</li><li>Using Depth-First Search (DFS): Detailed instructions on implementing the Depth-First Search (DFS) algorithm to explore all possible paths between two nodes. Understand how DFS traverses a graph by exploring as far as possible along each branch before backtracking, which makes it ideal for finding paths.</li><li>Implementing Backtracking: Step-by-step guide on using backtracking with DFS to ensure all paths are considered and to avoid visiting the same node twice in the same path. This section will cover how to manage path lists and avoid cycles in the paths.</li><li>Breadth-First Search (BFS) Consideration: Discussion on when BFS might be used instead of DFS, particularly when looking for the shortest path in unweighted graphs, although the primary focus will be on using DFS for finding all paths.</li><li>Code Examples: Practical coding examples in popular programming languages like Python, Java, or C++ demonstrating how to implement these algorithms to find all paths between two nodes.</li><li>Complexity Analysis: Analyze the time and space complexities of your solutions, providing insights into the computational efficiency and potential scalability issues.</li><li>Applications and Real-World Examples: Explore real-world applications of finding paths in graphs, such as in social network analysis, logistics, and transportation planning.</li><li>Advanced Techniques: Introduction to more advanced techniques and algorithms for pathfinding in graphs, including Dijkstra’s and Floyd-Warshall algorithms for situations involving weighted paths.</li></ul>By the end of this tutorial, you’ll have a thorough understanding of how to find all paths between two nodes in a graph, enhancing your ability to solve problems that require an in-depth understanding of graph traversal techniques.For a comprehensive guide on finding paths from a given source to a destination in a graph, including detailed code examples and discussions on optimizing your algorithms, check out our full article at <a href="https://www.geeksforgeeks.org/find-paths-given-source-destination/">https://www.geeksforgeeks.org/find-paths-given-source-destination/</a>.This tutorial will not only bolster your graph theory and algorithm skills but also prepare you to tackle complex problems involving network analysis and pathfinding in various fields of computing and engineering.

Count the paths | 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

🔤 Dive deep into the world of string manipulation with our latest video! Join us as we tackle the intriguing Better String problem, a classic challenge in the realm of Data Structures and Algorithms (DSA).In this comprehensive tutorial, we dissect the Better String problem, exploring its intricacies and providing step-by-step guidance on how to solve it efficiently. Whether you're a coding enthusiast, a student brushing up on DSA concepts, or a professional developer seeking to enhance your problem-solving skills, this video is for you.Whether you're gearing up for coding interviews, working on personal projects, or simply expanding your knowledge horizons, this video equips you with the tools and techniques needed to excel in string manipulation and DSA.🚀 Ready to level up your string manipulation skills? Hit play now and embark on a journey to conquer the Better String problem like a pro! Don't miss out on this opportunity to enhance your DSA prowess and take your coding abilities to new heights.

Better String | DSA Problem

Embark on a journey through string manipulation and algorithmic optimization with this insightful guide from GeeksforGeeks. In this illuminating article, you'll explore the task of constructing the minimum length string containing all substrings of size n—an essential problem in string processing with applications in text compression, data encoding, and algorithmic design.Discover the principles behind substring generation and string construction techniques, and learn strategies for efficiently assembling the minimum length string. Whether you're a programmer optimizing algorithms or a data scientist analyzing text data, mastering the art of string manipulation is crucial for solving a wide range of computational challenges.Prepare to delve into the world of string algorithms and algorithmic strategies as you explore detailed explanations and practical examples provided in the article. Unlock the mysteries of minimum length string construction by delving into the accompanying guide on GeeksforGeeks: <a href="https://www.geeksforgeeks.org/min-length-string-with-all-substrings-of-size-n/">https://www.geeksforgeeks.org/min-length-string-with-all-substrings-of-size-n/</a>

Find the String | 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