gfg-potd

Given a matrix mat[][] of dimension n * m where each cell in the matrix can have values 0, 1 or 2 which has the following […]

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

Given a connected undirected graph represented by a 2-d adjacency list adj[][], where each adj[i] represents the list of vertices connected to vertex i. Perform a Depth First

Given a string s of lowercase English alphabets, your task is to return the maximum number of substrings formed, after possible partitions (probably zero) of s such that no

There are some gas stations along a circular route. You are given two integer arrays gas[] denoted as the amount of gas present

You are given a string s and a list dictionary[] of words. Your task is to determine whether the string s can be formed by concatenating

Given an array arr[] which represents the dimensions of a sequence of matrices where the ith matrix has the dimensions (arr[i-1] x arr[i]) for i>=1, find the most efficient way to

Given two strings s1 and s2. Return the minimum number of operations required to convert s1 to s2.The possible operations are permitted: Insert a character at any position

Given an array of points where each point is represented as points[i] = [xi, yi] on the X-Y plane and an integer k,

Serialization is to store a tree in an array so that it can be later restored and deserialization is reading

Given a Binary Search Tree (with all values unique) and two nodes n1 and n2 (n1 != n2). You may assume that both nodes exist

Given the root of a Binary search tree(BST), where exactly two nodes were swapped by mistake. Your task is to fix (or correct) the