[LeetCode] Convex Polygon

469. Convex Polygon

You are given an array of points on the X-Y plane points where points[i] = [xi, yi]. The points form a polygon when joined sequentially.

Return true if this polygon is convex and false otherwise.

You may assume the polygon formed by given points is always a simple polygon. In other words, we ensure that exactly two edges intersect at each vertex and that edges otherwise don’t intersect each other.

Read more
[AtCoder] E - Simple String QueriesRead more
[AtCoder] D - Friend SuggestionsRead more
[AtCoder] C - Guess The NumberRead more
[AtCoder] D - String FormationRead more
[AtCoder] D - String EquivalenceRead more
[AtCoder] C - Sqrt InequalityRead more
[Codeforces] Round #293 (Div. 2) B. Tanya and PostcardRead more
[Codeforces] Round #295 (Div. 2) B. Two ButtonsRead more
[Codeforces] VK Cup 2015 - Qualification Round 2 C. Name QuestRead more