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.
Except the contsrtaints include the size of the matrix, which defines the problem as not memory intensive. For an arbitrary sized matrix, you've got memory problems, but you've also got computational problems of order n^2. In the case where the matrix size is unbounded, you'll need to go do a different algorithm entirely (not brute force).
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
2D Array - DS
You are viewing a single comment's thread. Return to all comments →
Except the contsrtaints include the size of the matrix, which defines the problem as not memory intensive. For an arbitrary sized matrix, you've got memory problems, but you've also got computational problems of order n^2. In the case where the matrix size is unbounded, you'll need to go do a different algorithm entirely (not brute force).