[AtCoder] A - Long Common SubsequenceRead more
[AtCoder] D - Shipping CenterRead more
[AtCoder] B - Many OrangesRead more
[Codeforces] Helvetic Coding Contest 2018 online mirror (teams allowed, unrated) D1. Hyperspace Jump (easy)Read more
[Codeforces] Educational Round 41 (Rated for Div. 2) C. ChessboardRead more
[Codeforces] Educational Round 42 (Rated for Div. 2) C. Make a SquareRead more
[Codeforces] Round #478 (Div. 2) C. Valhalla SiegeRead more
[Codeforces] Round #479 (Div. 3) D. Divide by three, multiply by twoRead more
[LeetCode] Widest Vertical Area Between Two Points Containing No Points

1637. Widest Vertical Area Between Two Points Containing No Points

Given n points on a 2D plane where points[i] = [xi, yi], Return the widest vertical area between two points such that no points are inside the area.

A vertical area is an area of fixed-width extending infinitely along the y-axis (i.e., infinite height). The widest vertical area is the one with the maximum width.

Note that points on the edge of a vertical area are not considered included in the area.

Read more
[LeetCode] Minimum Flips to Make a OR b Equal to c

1318. Minimum Flips to Make a OR b Equal to c

Given 3 positives numbers a, b and c. Return the minimum flips required in some bits of a and b to make ( a OR b == c ). (bitwise OR operation).
Flip operation consists of change any single bit 1 to 0 or change the bit 0 to 1 in their binary representation.

Read more