## Maximum area of triangle having different vertex colors

Given a matrix of N rows and M columns, consists of three value {r, g, b}. The task is to find the area of the… Read More »

- Number of Isosceles triangles in a binary tree
- Recursive program to print triangular patterns
- Number of triangles that can be formed with given N points
- Find other two sides and angles of a right angle triangle
- Program to find the Radius of the incircle of the triangle
- Maximum path sum in an Inverted triangle | SET 2
- Program for incrementing/decrementing triangle pattern
- Minimum length of the shortest path of a triangle
- Divide an isosceles triangle in two parts with ratio of areas as n:m
- Area of the circumcircle of any triangles with sides given
- Largest triangle that can be inscribed in a semicircle
- Number of triangles formed from a set of points on three lines
- Program to calculate the Area and Perimeter of Incircle of an Equilateral Triangle
- Area of Incircle of a Right Angled Triangle

Given a matrix of N rows and M columns, consists of three value {r, g, b}. The task is to find the area of the… Read More »

Given an array of integers, we need to find out whether it is possible to construct at least one non-degenerate triangle using array values as… Read More »

We have given numbers in form of triangle, by starting at the top of the triangle and moving to adjacent numbers on the row below,… Read More »

Given n points in a Cartesian coordinate system. Count the number of triangles formed. Examples: Input : point[] = {(0, 0), (1, 1), (2, 0),… Read More »

Given hypotenuse and area of a right angle triangle, get its base and height and if any triangle with given hypotenuse and area is not… Read More »

We have N coins which need to arrange in form of a triangle, i.e. first row will have 1 coin, second row will have 2… Read More »

We are given co-ordinates of a triangle. The task is to classify this triangle on basis of sides and angle. Examples: Input : p1 =… Read More »

Prerequisites: BIT Given ‘n’ line segments, each of them is either horizontal or vertical, find the maximum number of triangles(including triangles with zero area) that… Read More »

Pre-requisite : BIT(Binary Indexed Tree or Fenwick Tree), 2D BIT Given a 2D plane, respond to Q queries, each of the following type: Insert x… Read More »

We are given n triangles along with length of their three sides as a,b,c. Now we need to count number of unique triangles out of… Read More »

Given ordered coordinates of a polygon with n vertices. Find area of the polygon. Here ordered mean that the coordinates are given either in clockwise… Read More »

A number is termed as triangular number if we can represent it in the form of triangular grid of points such that the points form… Read More »

Given a Graph, count number of triangles in it. The graph is can be directed or undirected. Example: Input: digraph[V][V] = { {0, 0, 1,… Read More »

Given three non-collinear integral points in XY plane, find the number of integral points inside the triangle formed by the three points. (A point in… Read More »

Given an Undirected simple graph, We need to find how many triangles it can have. For example below graph have 2 triangles in it. Let… Read More »