Oct 212017


This was a tough nut!

Its a graph problem. Its actually a combination of 2 problems in one! I have voted it as hard and given it my recommendation.

I went through the following resources (none has the actual solution but all serve as hints) to finally come up with a solution for it:


Tested and Accepted: http://www.spoj.com/status/ROBOTGRI,chandniverma/

Time complexity in the worst case: O(n^2 + E)
where n = number of rows (or columns) in the grid
and E = number of edges in the connected graph containing the starting cell ‘S’.

Space complexity: O(n^2)
Chandni Verma: [Problem3 SPOJ:ROBOTGRI] A problem for lovers of mazes!
Source: Planet Gnome

Oct 202017

Christian Schaller has posted a
list of the Fedora Workstation project’s accomplishments
since its
inception. “Wayland – We been the biggest contributor since we
joined the effort and have taken the lead on putting in place all the
pieces needed for actually using it on a desktop, including starting to
ship it as our primary offering in Fedora Workstation 25. This includes
putting a lot of effort into ensuring that XWayland works smoothly to
ensure full legacy application support.

The list as a whole is quite long.
Schaller: Looking back at Fedora Workstation so far
Source: LWN.Net