Diagonal Traversal You are given an n×m grid. You can go from point (x1,y1) to any point (x2,y2) of grid if and onl... |
Treasure There's a hidden treasure in a castle. There are n guards protecting the treasure. But the guards ar... |
Yet Another Strong Problem You are given a string str consisting of characters 0 and/or 1 with an arbitrary integer n. Without ... |