Queen's Attack II Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I came up with this as well after running into memory exceptions with my previous solution.
My first algorithm was to initialize a 2-d byte array with 1s where the obstacles are located. Then I'd start from the queen and count in each direction until I hit a 1.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Queen's Attack II
You are viewing a single comment's thread. Return to all comments →
I came up with this as well after running into memory exceptions with my previous solution.
My first algorithm was to initialize a 2-d byte array with 1s where the obstacles are located. Then I'd start from the queen and count in each direction until I hit a 1.