Geometry

Categories: Code Problem / Data Structures and Algorithms / Recursion (32) Code Problem / Data Structures and Algorithms / Binary Search (30) Code Problem / Data Structures and Algorithms / Linked Lists (26) Code Problem / Data Structures and Algorithms / Backtracking (26) Code Problem / Data Structures and Algorithms / Stacks and Queues (25) Code Problem / Data Structures and Algorithms / Hashing (24) Databases / SQL / Backup and Recovery (19) Code Problem / Data Structures and Algorithms / Arrays and Strings (19) Databases / SQL / Database Normalization (18) Code Problem / Data Structures and Algorithms / Time Complexity (17) Databases / SQL / Locking (16) Databases / SQL / Replication (15) Databases / SQL / SQL Queries (13) Code Problem / Data Structures and Algorithms / Graphs (13) Databases / SQL / Database Security (13)  More...

Recent solutions:

Check these solutions from our community:
Determine if set of points is convex.
elrichendelgart
Mathematics / Theorems DifficultyHard
This problem asks whether a given set of points is convex or not. A set of points is convex if, for any two points in the set, the line segment connecting them lies entirely within the set.
About this solution: The candidate's solution is correct and demonstrates a level of completeness. The approach is straightforward and easy to understand.
Nov 13
Isosceles Triangle Theorem
elrichendelgart
Mathematics / Theorems DifficultyHard
This theorem states that a triangle is isosceles if and only if the sum of the squares of its two shorter sides is equal to the square of its longest side.
About this solution: This solution is correct.
Nov 12
Sum of Interior Angles of a Polygon
elrichendelgart
Mathematics / Theorems DifficultyHard
The sum of the interior angles of a polygon with n sides is (n-2)*180 degrees.
About this solution: The candidate's solution is correct and demonstrates a good understanding of the problem. The approach is clear and concise.
Nov 12