Collinear points are those which lies on a single straight line. We have 3 points in the X-Y plane with their (x,y) coordinates given. To find out if the given 3 points are collinear, we will check the angle which the lines between each pair of points make with the X-axis.…
Depth First Search (DFS) is an algorithm for traversing a graph or a tree(any acyclic connected graph is a tree). We start at a starting node, traverse on a single path in the graph, backtrack when the path ends and again traverse non-visited paths while backtracking. DFS has the following…
Stack Basics In computer science, a stack is an abstract data type, which supports two main operations: push(Element e) and pop(). push(Element e) – Adds the element e at the top of the stack. pop() – removes the element at the top of the stack. All operations takes place at…
Binary Search is used to find an element in a sorted array. Complexity of binary search algorithm is log(N), where N is size of the sorted array. At each step of Binary Search we keep on dividing the array into half and try to find the required element in one…
Problem Statement :- From a given graph, delete minimum number of edges such that there is no path from start node to end node. Start node : node with minimum value End node : node with maximum value Input format : String array, each element in the array represents an…