## Samsung Semiconductor Institute of Research(SSIR Software) intern/FTE | Set-3

We are given m*n matrix which can have a number between 0 and 7. Each number represents a pipe with a shape as follows: Two… Read More »

We are given m*n matrix which can have a number between 0 and 7. Each number represents a pipe with a shape as follows: Two… Read More »

Given a boolean 2D matrix. The task is to find the number of distinct islands where a group of connected 1s (horizontally or vertically) forms… Read More »

Given ‘n’ vertices and ‘m’ edges of a graph. Find the minimum number and maximum number of isolated vertices that are possible in the graph.… Read More »

Given a weighted Directed Graph where the weights may be negative, find the shortest path between every pair of vertices in the Graph using Johnson’s… Read More »

Given the number of vertices in a Cycle Graph. The task is to find the Degree and the number of Edges of the cycle graph.… Read More »

Wheel Graph: A Wheel graph is a graph formed by connecting a single universal vertex to all vertices of a cycle. Properties:- Wheel graphs are… Read More »

Given the number of Vertices and the number of Edges of an Undirected Graph. The task is to determine the Circuit rank. Circuit Rank: The… Read More »

Consider a directed graph given in below, DFS of the below graph is 1 2 4 6 3 5 7 8. In below diagram if… Read More »

Given the number of vertices in a Cycle graph. The task is to find the Total number of Spanning trees possible. Note: A cycle/circular graph… Read More »

Given the number of vertices N of a graph. The task is to determine the Edge cover. Edge Cover: Minimum number of edge required to… Read More »

Cycle:- cycle is a path of edges and vertices wherein a vertex is reachable from itself. or in other words, it is a Closed walk.… Read More »

Given N number of vertices of a Graph. The task is to find the total number of edges possible in a complete graph of N… Read More »

Give a complete graph with N-vertices. The task is to find out the maximum number of edge-disjoint spanning tree possible. Edge-disjoint Spanning Tree is a… Read More »

The level ancestor problem is the problem of preprocessing a given rooted tree T into a data structure that can determine the ancestor of a… Read More »

Given an undirected and unweighted graph. The task is to find the product of the lengths of all cycles formed in it. Example 1: The… Read More »