Browse our collection of articles on various topics related to IT technologies. Dive in and explore something new!
Structured data across a wide range of workloads—from product catalogs to telemetry streams to user...
Have you ever imagined a world without connections? Think about your social media full of random...
This blog is for developers who want to get the gist of a concept and not beat around the bush. We...
Problem TC: O(n*m) where n is the no. of nodes and m is the max no. of nodes/methods present in a...
PostgreSQL can handle any workload without streaming data to a purpose-built database. This includes...
Preamble When I first envisioned Divooka, I aimed for open source, open file formats, and...
Occasionally, I saw an article named "Why do cats...?", which analyzed some preferences and behaviors...
Quick Summary: 📝 HelixDB is a graph-vector database built in Rust, designed for RAG and AI...
Problem class Solution { public boolean findSafeWalk(List<List<Integer>> grid, int...
Chat2Graph is a graph-native agentic system powered by Ant Group TuGraph team and designed to bridge...
Problem class Solution { public int minimumEffortPath(int[][] heights) { ...
TC:O(n*mlog(n*m)) SC :O(n*m) Problem //BFS : dijkstra's class Solution { public int...
connected components What Are Connected Components? In graph theory, a connected component...
Get a gist of graph data structure here... vidhi-thakur ・...
PuppyGraph on MongoDB: Native Graph Queries Without ETL ...
Graphs are an essential part of graph theory and have applications across various domains, from...
🧩 The Problem: Flood Fill (LeetCode #733) You’re given a 2D image represented as a grid, where each...
problem TC: O(n*m) , SC :O(n*m) + O(n*m) int Directions[][] = ...
I decided to experiment with Dijkstra’s algorithm to solve a problem that may involve negative...
I am doing an algorithm graph Dijstras in C# . I now know the best priority queue you use . How do...
The Challenge: You run a multi-tenant security platform and need to ensure full tenant isolation,...
Problem TC: O(n*4alpha) class Solution { public int[] minimumCost(int n, int[][] edges,...
Problem class Solution { public int swimInWater(int[][] grid) { Queue<Data> q =...
Problem Time complexity: O(M∗N)O(M*N)O(M∗N) , since we are traversing all the cell in the...
Problem BFS: TLE class Solution { public int maxWeight(int n, int[][] edges, int k, int t) { ...
Introduction I'm working on a graph-based video recommendation system, inspired by a research paper....
Problem TC : vlogv, where v = m*n class Solution { public int minMoves(String[] matrix) { ...
Amazon Neptune is a managed graph database for connected data, ideal for recommendations, social...
Quick Summary: 📝 Kuzu is an embedded graph database designed for speed and scalability,...
O(n) : where n is no. of nodes Problem /* Definition for a Node. class Node { public int val; ...