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 had tried a dynamic programming approach with dp[n][n] and time complexity O(n^2) but this be able to pass only 7/21 test cases.As dp[100000][100000]could be a problem what could be an alternative to such a large 2D array
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Pair Sums
You are viewing a single comment's thread. Return to all comments →
i had tried a dynamic programming approach with dp[n][n] and time complexity O(n^2) but this be able to pass only 7/21 test cases.As dp[100000][100000]could be a problem what could be an alternative to such a large 2D array