/** * LeetCode 827: Making A Large Island * * Problem: * You are given an n x n binary matrix grid. A cell is considered a land cell if its value is 1, * and a water cell if its value is 0. You can change at most one water cell's value to 1. *...
A tree is a hierarchical data structure with a set of connected nodes. A family tree or an organogram comes to mind easily. With this data structure, there is a parent-child relationship between an ancestor node and a child node, and these relationsh...
Introduction Graphs are a fundamental data structure used to model relationships and connections in various domains, from social networks to transportation systems and even the internet. A graph consists of vertices (or nodes) and edges (or arcs) con...
Introduction When it comes to traversing or searching through data structures like trees and graphs, Breadth-First Search (BFS) and Depth-First Search (DFS) are two of the most fundamental and widely used algorithms. Both algorithms are designed to e...
I came across a question on twitter/X. I had some ideas on how to solve it. But then I thought why not ask our LLMs if they can solve it. So let’s take a look at the question. I didn’t wanna type the question but Multi-modal LLMs for the win! Claude...
Problem Given the root of a binary tree, return the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree. This path may or may not pass through the root. The length of a p...
Problem statement Given a binary tree, determine if it is height-balanced.(link) Example 1: Input: root = [3,9,20,null,null,15,7] Output: true Example 2: Input: root = [1,2,2,3,3,null,null,4,4] Output: false Example 3: Input: root = [] Output: tr...
Topological sort algorithm using DFS import java.util.*; public class Main { public static class Graph { int v; int e; List<List<Integer>> arrList; public Graph(int v, int e) { this.v = v; this.e = e; arrList...
BFS and DFS Algorithm on a single Graph Take an Example of the below Graph import java.util.*; public class Main { public static class Graph { int v; int e; List<List<Integer>> arrList; public Graph(int v, int e) { this.v...
In this chapter, we will embark on an in-depth exploration of Graphs, one of the most versatile and widely-used data structures in computer science. Graphs play a crucial role in representing relationships between entities, making them indispensable ...
