[Codeforces] Round 178 (Div. 2) B. Shaass and BookshelfRead more
[Codeforces] Round 179 (Div. 1) B. Greg and GraphRead more
[Codeforces] Round 180 (Div. 1) A. Parity GameRead more
[LeetCode] Can Place Flowers

605. Can Place Flowers

You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.

Given an integer array flowerbed containing 0‘s and 1‘s, where 0 means empty and 1 means not empty, and an integer n, return if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule.

Read more
[Codeforces] Round 183 (Div. 1) B. Rectangle Puzzle IIRead more
[Codeforces] Round 184 (Div. 2) B. Continued FractionsRead more
[Codeforces] ABBYY Cup 3.0 G3. Good SubstringsRead more
[Codeforces] ABBYY Cup 3.0 G2. Good SubstringsRead more
[Codeforces] ABBYY Cup 3.0 G1. Good SubstringsRead more
[Codeforces] Round 190 (Div. 1) A. Ciel and RobotRead more