Given a regular hexagon of side length a, the task is to find the length of it’s diagonal.
Input : a = 4 Output : 8 Input : a = 7 Output : 14
From the diagram, it is clear that the triangle ABC is an equilateral triangle, so
AB = AC = BC = a.
also it is obvious, diagonal = 2*AC or 2*BC
So the length of diagonal of the hexagon = 2*a
Below is the implementation of the above approach:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Length of a Diagonal of a Parallelogram using the length of Sides and the other Diagonal
- Area of hexagon with given diagonal length
- Diagonal of a Regular Hexagon
- Count of Equilateral Triangles of unit length possible from a given Hexagon
- Area of a square from diagonal length
- Length of the Diagonal of the Octagon
- Length of Diagonal of a n-sided regular polygon
- Length of diagonal of a parallelogram using adjacent sides and angle between them
- Area of a Hexagon
- Area of the Largest Triangle inscribed in a Hexagon
- Area of a circle inscribed in a regular hexagon
- Area of a square inscribed in a circle which is inscribed in a hexagon
- Largest Square that can be inscribed within a hexagon
- Largest hexagon that can be inscribed within a square
- Largest hexagon that can be inscribed within an equilateral triangle
- Largest square that can be inscribed within a hexagon which is inscribed within an equilateral triangle
- Biggest Reuleaux Triangle inscribed within a square which is inscribed within a hexagon
- Number of coloured 0's in an N-level hexagon
- Count of 0s in an N-level hexagon
- Find a Symmetric matrix of order N that contain integers from 0 to N-1 and main diagonal should contain only 0's
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.